NDLI: The reuse cache: downsizing the shared last-level cache

Please wait, while we are loading the content...

Quality programmable vector processors for approximate computing

MLP-aware dynamic instruction window resizing for adaptively exploiting both ILP and MLP

Exploiting GPU peak-power and performance tradeoffs through reduced effective pipeline latency

Virtually-aged sampling DMR: unifying circuit failure prediction and circuit failure detection

Linearly compressed pages: a low-complexity, low-latency main memory compression framework

Crank it up or dial it down: coordinated multiprocessor frequency and folding control

Linearizing irregular memory accesses for improved correlated prefetching

Insertion and promotion for tree-based PseudoLRU last-level caches

Enabling datacenter servers to scale out economically and sustainably

Multi-grain coherence directories

Efficient management of last-level caches in graphics processors for 3D scene rendering workloads

Kiln: closing the performance gap between systems with and without persistence support

Trace based phase prediction for tightly-coupled heterogeneous cores

SAGE: self-tuning approximation for graphics engines

TLC: a tag-less cache for reducing dynamic first level cache energy

A locality-aware memory hierarchy for energy-efficient GPU architectures

Use it or lose it: wear-out and lifetime in future chip multiprocessors

RowClone: fast and energy-efficient in-DRAM bulk data copy and initialization

Wavelength stealing: an opportunistic approach to channel sharing in multi-chip photonic interconnects

RDIP: return-address-stack directed instruction prefetching

Imbalanced cache partitioning for balanced data-parallel programs

Efficient multiprogramming for multicores with SCAF

BulkCommit: scalable and fast commit of atomic blocks in a lazy multiprocessor environment

Energy efficient GPU transactional memory via space-time optimizations

Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory

Heterogeneous system coherence for integrated CPU-GPU systems

Approximate storage in solid-state memories

Decoupled compressed cache: exploiting spatial locality for energy-optimized compressed caching

Divergence-aware warp scheduling

uDIREC: unified diagnosis and reconfiguration for frugal bypass of NoC faults

Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device

DESC: energy-efficient data exchange using synchronized counters

SHIFT: shared history instruction fetch for lean-core server processors

The reuse cache: downsizing the shared last-level cache

Allocating rotating registers by scheduling

Large-reach memory management unit caches

Meet the walkers: accelerating index traversals for in-memory databases

Warped gates: gating aware scheduling and power gating for GPGPUs

Implicit-storing and redundant-encoding-of-attribute information in error-correction-codes

The reuse cache: downsizing the shared last-level cache

Content Provider	ACM Digital Library
Author	Albericio, Jorge Viñals, Víctor Llabería, José M. Ibáñez, Pablo
Abstract	Over recent years, a growing body of research has shown that a considerable portion of the shared last-level cache (SLLC) is dead, meaning that the corresponding cache lines are stored but they will not receive any further hits before being replaced. Conversely, most hits observed by the SLLC come from a small subset of already reused lines. In this paper, we propose the reuse cache, a decoupled tag/data SLLC which is designed to only store the data of lines that have been reused. Thus, the size of the data array can be dramatically reduced. Specifically, we (i) introduce a selective data allocation policy to exploit reuse locality and maintain reused data in the SLLC, (ii) tune the data allocation with a suitable replacement policy and coherence protocol, and finally, (iii) explore different ways of organizing the data/tag arrays and study the performance sensitivity to the size of the resulting structures. The role of a reuse cache to maintain performance with decreasing sizes is investigated in the experimental part of this work, by simulating multiprogrammed and multithreaded workloads in an eight-core chip multiprocessor. As an example, we show that a reuse cache with a tag array equivalent to a conventional 4 MB cache and only a 1 MB data array would perform as well as a conventional cache of 8 MB, requiring only 16.7% of the storage capacity.
Starting Page	310
Ending Page	321
Page Count	12
File Format	PDF
ISBN	9781450326384
DOI	10.1145/2540708.2540735
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-12-07
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Last-level cache organization Reuse
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exploiting Dynamic Reuse Probability to Manage Shared Last-level Caches in CPU-GPU Heterogeneous Processors

Runtime-driven shared last-level cache management for task-parallel programs

Managing shared last-level cache in a heterogeneous multicore processor

Shared Last-Level Caches and The Case for Longer Timeslices

DAPSCO: Distance-aware partially shared cache organization

Write-back aware shared last-level cache management for hybrid main memory

Last-level cache deduplication

Reducing Contention in Shared Last-Level Cache for Throughput Processors

An Adaptive Shared/Private NUCA Cache Partitioning Scheme for Chip Multiprocessors (2007)

The reuse cache: downsizing the shared last-level cache

Similar Documents

Exploiting Dynamic Reuse Probability to Manage Shared Last-level Caches in CPU-GPU Heterogeneous Processors

Runtime-driven shared last-level cache management for task-parallel programs

Managing shared last-level cache in a heterogeneous multicore processor

Shared Last-Level Caches and The Case for Longer Timeslices

DAPSCO: Distance-aware partially shared cache organization

Write-back aware shared last-level cache management for hybrid main memory

Last-level cache deduplication

Reducing Contention in Shared Last-Level Cache for Throughput Processors

An Adaptive Shared/Private NUCA Cache Partitioning Scheme for Chip Multiprocessors (2007)

The reuse cache: downsizing the shared last-level cache