NDLI: Adaptive insertion policies for high performance caching

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

Anton, a special-purpose machine for molecular dynamics simulation

Making the fast case common and the uncommon case simple in unbounded transactional memory

Virtual hierarchies to support server consolidation

An effective hybrid transactional memory system with strong isolation guarantees

Rotary router: an efficient architecture for CMP interconnection networks

Carbon: architectural support for fine-grained parallelism on chip multiprocessors

Core fusion: accommodating software diversity in chip multiprocessors

A 64-bit stream processor architecture for scientific applications

Architectural implications of brick and mortar silicon manufacturing

Mechanisms for store-wait-free multiprocessors

Limiting the power consumption of main memory

ReCycle:: pipeline adaptation to tolerate process variation

Comparing memory systems for chip multiprocessors

Performance and security lessons learned from virtualizing the alpha processor

VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization

Examining ACE analysis reliability estimates using fault-injection

Raksha: a flexible information flow architecture for software security

Mechanisms for bounding vulnerabilities of processor structures

Power provisioning for a warehouse-sized computer

Synchronization state buffer: supporting efficient fine-grain synchronization on many-core architectures

Virtual private caches

Performance pathologies in hardware transactional memory

Flattened butterfly: a cost-efficient topology for high-radix networks

Hardware atomicity for reliable software speculation

Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits

Physical simulation for animation and visual effects: parallelization and characterization for chip multiprocessors

Aquacore: a programmable architecture for microfluidics

BulkSC: bulk enforcement of sequential consistency

Power model validation through thermal measurements

Matrix scheduler reloaded

Interconnect design considerations for large NUCA caches

Automated design of application specific superscalar processors: an analytical approach

Ginger: control independence using tag rewriting

Configurable isolation: building high availability systems with commodity multi-core processors

New cache designs for thwarting software cache-based side channel attacks

Dynamic prediction of architectural vulnerability from microarchitectural state

MetaTM/TxLinux: transactional memory for an operating system

A novel dimensionally-decomposed router for on-chip communication in 3D architectures

ParallAX: an architecture for real-time physics

Thermal modeling and management of DRAM memory systems

Late-binding: enabling unordered load-store queues

Adaptive insertion policies for high performance caching

Analysis of redundancy and application balance in the SPEC CPU2006 benchmark suite

Transparent control independence (TCI)

An integrated hardware-software approach to flexible transactional memory

Express virtual channels: towards the ideal interconnection fabric

Adaptive insertion policies for high performance caching

Content Provider	ACM Digital Library
Author	Jaleel, Aamer Steely, Simon C. Emer, Joel Patt, Yale N. Qureshi, Moinuddin K.
Abstract	The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applications, the majority of lines traverse from the MRU position to the LRU position without receiving any cache hits, resulting in inefficient use of cache space. Cache performance can be improved if some fraction of the working set is retained in the cache so that at least that fraction of the working set can contribute to cache hits. We show that simple changes to the insertion policy can significantly reduce cache misses for memory-intensive workloads. We propose the LRU Insertion Policy (LIP) which places the incoming line in the LRU position instead of the MRU position. LIP protects the cache from thrashing and results in close to optimal hitrate for applications that have a cyclic reference pattern. We also propose the Bimodal Insertion Policy (BIP) as an enhancement of LIP that adapts to changes in the working set while maintaining the thrashing protection of LIP. We finally propose a Dynamic Insertion Policy (DIP) to choose between BIP and the traditional LRU policy depending on which policy incurs fewer misses. The proposed insertion policies do not require any change to the existing cache structure, are trivial to implement, and have a storage requirement of less than two bytes. We show that DIP reduces the average MPKI of the baseline 1MB 16-way L2 cache by 21%, bridging two-thirds of the gap between LRU and OPT.
Starting Page	381
Ending Page	391
Page Count	11
File Format	PDF
ISBN	9781595937063
DOI	10.1145/1250662.1250709
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-06-09
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Set dueling Replacement Thrashing Set sampling
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

Adaptive insertion policies for high performance caching

Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching

Adaptive insertion policies for managing shared caches

PACMan: prefetch-aware cache management for high performance caching

A Cache Replacement Policy Using Adaptive Insertion and Re-reference Prediction

Adaptive insertion policies for high performance caching (2007)

A Novel Cache Replacement Policy via Dynamic Adaptive Insertion and Re-Reference Prediction

The evicted-address filter: a unified mechanism to address both cache pollution and thrashing

Reducing capacity and conflict misses using Set Saturation Levels

Adaptive insertion policies for high performance caching

Similar Documents

Adaptive insertion policies for high performance caching

Set-Dueling-Controlled Adaptive Insertion for High-Performance Caching

Adaptive insertion policies for managing shared caches

PACMan: prefetch-aware cache management for high performance caching

A Cache Replacement Policy Using Adaptive Insertion and Re-reference Prediction

Adaptive insertion policies for high performance caching (2007)

A Novel Cache Replacement Policy via Dynamic Adaptive Insertion and Re-Reference Prediction

The evicted-address filter: a unified mechanism to address both cache pollution and thrashing

Reducing capacity and conflict misses using Set Saturation Levels

Adaptive insertion policies for high performance caching