Performance and complexity tradeoffs in partially-inclusive caches

dc.contributor.advisorJanapa Reddi, Vijayen
dc.contributor.advisorGreer, John R.en
dc.creatorReed, Douglas Rayeen
dc.creator.orcid0000-0002-9080-1279en
dc.date.accessioned2015-11-06T17:09:31Zen
dc.date.available2015-11-06T17:09:31Zen
dc.date.issued2015-05en
dc.date.submittedMay 2015en
dc.date.updated2015-11-06T17:09:31Zen
dc.descriptiontexten
dc.description.abstractMulti-level inclusive cache hierarchies have historically provided a convenient tradeoff between performance and design complexity. However, as the desire for more intermediate levels of caches rises, the shrinking size disparity between adjacent levels of cache exacerbates the wasteful redundancy inherent in inclusive cache designs. Where it is still beneficial to have larger, slower caches act as inclusive caches and snoop filters for smaller, faster caches nearer to the core, those benefits can be undermined by excessive data duplication and frequent back-invalidations when the larger cache is only a factor of two- to four-times the size of the smaller cache. One technique to address the issues that arise with inclusive caches is partial inclusivity. Partially inclusive caches can help address the problem of data duplication in a cache hierarchy, while still providing performance and robust snoop filtering akin to that of a traditional inclusive cache. Moreover, such cache designs can decrease the frequency of back-invalidates caused by strictly inclusive caches. We describe two approaches to implementing a partially inclusive mid-level cache, while exploring the implications of our design decisions on performance, array size, and implementation complexity. We show that the first approach, ThinL2, allows for simpler coherence record-keeping but dramatically increases snooping of the first-level caches. We also show that the second approach, WideL2, allows for relatively efficient snooping of the first-level caches but incurs much more record-keeping complexity. We then provide ideas for addressing some of the complexity problems associated with WideL2.en
dc.description.departmentComputational Science, Engineering, and Mathematicsen
dc.format.mimetypeapplication/pdfen
dc.identifierdoi:10.15781/T27321en
dc.identifier.urihttp://hdl.handle.net/2152/32269en
dc.language.isoenen
dc.subjectCache coherenceen
dc.subjectData duplicationen
dc.subjectBack invalidationen
dc.subjectInclusion propertyen
dc.subjectInclusive cacheen
dc.subjectNoninclusive cacheen
dc.subjectPartially inclusive cacheen
dc.subjectMid level cacheen
dc.titlePerformance and complexity tradeoffs in partially-inclusive cachesen
dc.typeThesisen
thesis.degree.departmentComputational Science, Engineering, and Mathematicsen
thesis.degree.disciplineElectrical and Computer Engineeringen
thesis.degree.grantorThe University of Texas at Austinen
thesis.degree.levelMastersen
thesis.degree.nameMaster of Science in Engineeringen

Access full-text files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
REED-MASTERSREPORT-2015.pdf
Size:
519.53 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.84 KB
Format:
Plain Text
Description: