Show simple item record

dc.contributor.authorDíaz Maag, Javier
dc.contributor.authorIbáñez Marín, Pablo Enrique
dc.contributor.authorMonreal Arnal, Teresa
dc.contributor.authorViñals Yúfera, Víctor
dc.contributor.authorLlaberia Griñó, José M.
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2018-01-31T13:08:23Z
dc.date.available2018-01-31T13:08:23Z
dc.date.issued2017
dc.identifier.citationDíaz, J., Ibáñez , P., Monreal, T., Viñals, V., Llaberia, J. ReD: A policy based on reuse detection for demanding block selection in last-level Caches. A: The Cache Replacement Championship. "The Second Cache Replacement Championship: workshop schedule". Toronto: 2017, p. 1-4.
dc.identifier.urihttp://hdl.handle.net/2117/113462
dc.description.abstractIn this paper, we propose a new block selection policy for Last-Level Caches (LLCs) that decides, based on Reuse Detection, whether a block coming from main memory is inserted, or not, in the LLC. The proposed policy, called ReD, is demanding in the sense that blocks bypass the LLC unless their expected reuse behavior matches specific requirements, related either to their recent reuse history or to the behavior of associated instructions. Generally, blocks are only stored in the LLC the second time they are requested in a limited time window. Secondarily, some blocks enter the LLC on the first request if their associated requesting instruction has shown to request highly-reused blocks in the past. ReD includes two table structures that allow tracking, measuring and correlating reuse for specific block addresses and requesting program counters within a constrained storage budget. It can be implemented on top of any other base replacement algorithm. Other parts of the base replacement policy, such as promotion or victim selection, can remain unchanged, enabling our policy to work along with many state-of-the-art replacement algorithms.
dc.format.extent4 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshCache memory
dc.subject.lcshAlgorithms
dc.subject.otherLast-level caches
dc.subject.otherLLCs
dc.subject.otherReuse detection
dc.subject.otherReD
dc.titleReD: A policy based on reuse detection for demanding block selection in last-level Caches
dc.typeConference report
dc.subject.lemacMemòria ràpida de treball (Informàtica)
dc.subject.lemacAlgorismes
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.identifier.drac21718487
dc.description.versionPostprint (published version)
local.citation.authorDíaz, J.; Ibáñez, P.; Monreal, T.; Viñals, V.; Llaberia, J.
local.citation.contributorThe Cache Replacement Championship
local.citation.pubplaceToronto
local.citation.publicationNameThe Second Cache Replacement Championship: workshop schedule
local.citation.startingPage1
local.citation.endingPage4


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder