uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Data placement across the cache hierarchy: Minimizing data movement with reuse-aware placement
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (UART)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (UART)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (UART)
2016 (English)In: Proc. 34th International Conference on Computer Design, Piscataway, NJ: IEEE , 2016, 117-124 p.Conference paper, Published paper (Refereed)
Abstract [en]

Modern processors employ multiple levels of caching to address bandwidth, latency and performance requirements. The behavior of these hierarchies is determined by their approach to data placement and data eviction. Recent research has developed many intelligent data eviction policies, but cache hierarchies remain primarily either exclusive or inclusive with regards to data placement. This means that today's cache hierarchies typically install accessed data into all cache levels at one point or another, regardless of whether the data is reused in each level. Such data movement wastes energy by installing data into cache levels where the data is not reused. This paper presents Reuse Aware Placement (RAP), an efficient data placement mechanism to determine where to place data in the cache hierarchy based on whether the data will be reused at each level. RAP dynamically identifies data sets and measures their reuse at each level in the hierarchy. This enables RAP to determine where to move data upon installation or eviction to maximize reuse. To accomplish this, each cache line is associated with a data set and consults that data set's policy upon eviction or installation. The RAP data placement mechanism is orthogonal to the replacement policy, and can be combined with any number of proposed eviction mechanisms. By itself, the RAP data placement mechanism reduces traffic in the cache hierarchy by 21 to 64%, depending on the level, without hurting performance. As a result of this traffic reduction, RAP reduces dynamic cache energy by 28% and total cache energy by 17%.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE , 2016. 117-124 p.
Series
Proceedings IEEE International Conference on Computer Design, ISSN 1063-6404
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:uu:diva-305232DOI: 10.1109/ICCD.2016.7753269ISI: 000391829200016ISBN: 9781509051427 (print)OAI: oai:DiVA.org:uu-305232DiVA: diva2:1034820
Conference
ICCD 2016, October 2–5, Phoenix, AZ
Projects
UPMARC
Funder
Swedish Foundation for Strategic Research , FFL12-0051
Available from: 2016-11-24 Created: 2016-10-13 Last updated: 2017-02-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Sembrant, AndreasHagersten, ErikBlack-Schaffer, David

Search in DiVA

By author/editor
Sembrant, AndreasHagersten, ErikBlack-Schaffer, David
By organisation
Computer Architecture and Computer Communication
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1196 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf