Reuse Distance-Based Probabilistic Cache Replacement

No abstract is available for this paper.

• Publication year

  2015

• Venue

  ACM Transactions on Architecture and Code Optimization (TACO)

• Publication date

  2015-10-19

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/2818374
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• SLIP: Reducing wire energy in the memory hierarchy

  2015cited by this paper
• Insertion and promotion for tree-based PseudoLRU last-level caches

  2013cited by this paper
• Improving Cache Management Policies Using Dynamic Reuse Distances

  2012influential reference
• SHiP: Signature-based Hit Predictor for high performance caching

  2011influential reference
• MARSS: A full system simulator for multicore x86 CPUs

  2011cited by this paper
• Sampling Dead Block Prediction for Last-Level Caches

  2010cited by this paper
• System-Level Performance Metrics for Multiprogram Workloads

  2008cited by this paper
• Cache bursts: A new approach for eliminating dead blocks and increasing cache efficiency

  2008cited by this paper
• CMP $ im : A Pin-Based OnThe-Fly Multi-Core Cache Simulator

  2008cited by this paper
• Cache replacement based on reuse-distance prediction

  2007cited by this paper
• Adaptive insertion policies for high performance caching

  2007cited by this paper
• Optimizing NUCA Organizations and Wiring Alternatives for Large Caches with CACTI 6.0

  2007cited by this paper
• Locality approximation using time

  2007cited by this paper
• Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches

  2004influential reference
• Pinpointing Representative Portions of Large Intel® Itanium® Programs with Dynamic Instrumentation

  2004cited by this paper
• Pinpointing Representative Portions of Large Intel® Itanium® Programs with Dynamic Instrumentation

  2004cited by this paper
• Predicting Last-Touch References under Optimal Replacement

  2002cited by this paper
• Dead-block prediction & dead-block correlating prefetchers

  2001cited by this paper
• EELRU: simple and effective adaptive page replacement

  1999cited by this paper
• High-performance computer architecture (3. ed.)

  1993cited by this paper
• The LRU-K page replacement algorithm for database disk buffering

  1993cited by this paper
• Cache Replacement with Dynamic Exclusion

  1992cited by this paper
• Principles of Optimal Page Replacement

  1971influential reference
• Evaluation Techniques for Storage Hierarchies

  1970cited by this paper
• A Study of Replacement Algorithms for Virtual-Storage Computer

  1966influential reference
• Proceedings of Fast '03: 2nd Usenix Conference on File and Storage Technologies 2nd Usenix Conference on File and Storage Technologies Arc: a Self-tuning, Low Overhead Replacement Cache

  year unknowncited by this paper

• SHARP: SHARing-Aware Cache Writeback byPass

  2025cites this paper
• GMT: GPU Orchestrated Memory Tiering for the Big Data Era

  2024cites this paper
• NCache: A Machine-Learning Cache Management Scheme for Computational SSDs

  2023cites this paper
• Blast from the Past: Least Expected Use (LEU) Cache Replacement with Statistical History

  2023cites this paper
• Designing a Cost-Effective Cache Replacement Policy using Machine Learning

  2021cites this paper
• PPT-Multicore: performance prediction of OpenMP applications using reuse profiles and analytical modeling

  2021cites this paper
• Addressing Variability in Reuse Prediction for Last-Level Caches

  2020cites this paper
• PPT-SASMM: Scalable Analytical Shared Memory Model: Predicting the Performance of Multicore Caches from a Single-Threaded Execution Trace

  2020cites this paper
• IP-aware cache partition and replacement scheme for mobile computing devices

  2019cites this paper
• A Sharing-Aware L1.5D Cache for Data Reuse in GPGPUs

  2019cites this paper
• Writeback-Aware Caching (Brief Announcement)

  2019cites this paper
• IBOM: An Integrated and Balanced On-Chip Memory for High Performance GPGPUs

  2018cites this paper
• The Attribute-weight Cache Replacement Algorithm for Encrypted Files

  2018cites this paper
• A virtual memory manager optimized for node-level cooperative multi-tasking in memory constrained systems

  2018cites this paper
• Making Belady-Inspired Replacement Policies More Effective Using Expected Hit Count

  2018cites this paper
• Write management mechanisms for systems with non-volatile memory technologies

  2017cites this paper
• An extended analysis of memory hierarchies for efficient implementations of image processing applications

  2017cites this paper
• Maximizing Cache Performance Under Uncertainty

  2017influential citation
• Leeway: Addressing Variability in Dead-Block Prediction for Last-Level Caches

  2017cites this paper
• Set-Associative History-Aided Adaptive Replacement for On-Chip Caches

  2016cites this paper
• Cache-emulated register file: An integrated on-chip memory architecture for high performance GPGPUs

  2016cites this paper
• Modeling cache performance beyond LRU

  2016cites this paper
• MIT Open Access Articles Modeling cache performance beyond LRU

  year unknowncites this paper