Reuse Distance-Based Cache Hint Selection

No abstract is available for this paper.

• Publication year

  2002

• Venue

  European Conference on Parallel Processing

• Publication date

  2002-08-27

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-45706-2_35
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Jini^ Architecture Specification Version 2.0

  2003cited by this paper
• Improving Replacement Decisions in Set-Associative Caches

  2001cited by this paper
• Improving Replacement Decisions in Set-Associative Caches TITLE2:

  2001cited by this paper
• Reuse Distance as a Metric for Cache Behavior.

  2001cited by this paper
• Software-assisted cache replacement mechanisms for embedded systems

  2001cited by this paper
• MIST: an algorithm for memory miss traffic management

  2000cited by this paper
• Itanium Processor Microarchitecture

  2000cited by this paper
• HPL-PD Architecture Specification:Version 1.1

  2000cited by this paper
• Cache miss equations: a compiler framework for analyzing and tuning memory behavior

  1999cited by this paper
• A locality sensitive multi-module cache with explicit management

  1999cited by this paper
• The Alpha 21264 microprocessor

  1999cited by this paper
• Cache miss equations: compiler analysis framework for tuning memory behavior

  1999cited by this paper
• Cache miss heuristics and preloading techniques for general-purpose programs

  1995cited by this paper
• PA-RISC 2.0 Architecture

  1995cited by this paper
• Cache miss heuristics and preloading techniques for general-purpose programs

  1995cited by this paper
• A modified approach to data cache management

  1995cited by this paper

• PinIt: Influencing OS Scheduling via Compiler-Induced Affinities

  2023cites this paper
• CARL: Compiler Assigned Reference Leasing

  2022cites this paper
• Uniform lease vs. LRU cache: analysis and evaluation

  2021cites this paper
• MLCache: A Space-Efficient Cache Scheme based on Reuse Distance and Machine Learning for NVMe SSDs

  2020cites this paper
• Predicting the Complexity of Locality Patterns in Loop Nests in C Scientific Programs

  2019cites this paper
• Global Dead-Block Management for Task-Parallel Programs

  2018cites this paper
• Software refactoring guided by multiple soft-goals Conference or Workshop Item

  2018cites this paper
• Applying Supervised Learning to the Static Prediction of Locality-Pattern Complexity in Scientific Code

  2018cites this paper
• Data Movement in Data-Intensive High Performance Computing

  2016cites this paper
• RADAR: Runtime-assisted dead region management for last-level caches

  2016cites this paper
• Optimal collaborative caching: Theory and applications

  2014cites this paper
• ScalaMemAnalysis: A Compositional Approach to Cache Analysis of Compressed Memory Traces.

  2014cites this paper
• Characterizing the Opportunity and Feasibility of Reconfigurable Memory Hierarchies for Improv ed Energy E fficiency

  2013cites this paper
• Memory Models for Embedded Multicore Architecture

  2013cites this paper
• Toward application-specific memory reconfiguration for energy efficiency

  2013cites this paper
• Pacman: program-assisted cache management

  2013cites this paper
• A generalized theory of collaborative caching

  2012cites this paper
• Automated locality optimization based on the reuse distance of string operations

  2011cites this paper
• Dynamic access distance driven cache replacement

  2011cites this paper
• On the theory and potential of LRU-MRU collaborative cache management

  2011cites this paper
• On the Theory and Potential of Collaborative Cache Management

  2011cites this paper
• Second-tier Cache Management to Support DBMS Workloads

  2011cites this paper
• Multicore-aware reuse distance analysis

  2010cites this paper
• Modeling and exploiting spatial locality trade-offs in wavelet-based applications under varying resource requirements

  2010cites this paper
• An Efficient Simulation Algorithm for Cache of Random Replacement Policy

  2010cites this paper
• Exploiting Varying Resource Requirements in Wavelet-based Applications in Dynamic Execution Environments

  2009cites this paper
• Program locality analysis using reuse distance

  2009cites this paper
• P-OPT: Program-Directed Optimal Cache Management

  2008cites this paper
• Low-power, Wavelet-Based Applications in Dynamic Environments (Wavelet-gebaseerde toepassingen met laag energieverbruik in dynamische omgevingen)

  2008cites this paper
• Sampling-based program locality approximation

  2008influential citation
• Behavior Models For Computer Programs

  2008cites this paper
• Scalable Implementation of Efficient Locality Approximation

  2008cites this paper
• On the Design of Fast Prefix-Preserving IP Address Anonymization Scheme

  2007cites this paper
• Adaptive mapping to resource availability for dynamic wavelet-based applications

  2007cites this paper
• Locality approximation using time

  2007cites this paper
• Miss Rate Prediction Across Program Inputs and Cache Configurations

  2007cites this paper
• A hierarchical model of data locality

  2006cites this paper
• Software-Controlled Scratchpad Mapping Strategies for Wavelet-Based Applications

  2006cites this paper
• Path-Based Reuse Distance Analysis

  2006cites this paper
• Feedback-directed memory disambiguation through store distance analysis

  2006cites this paper
• Hierarchical memory size estimation for loop fusion and loop shifting in data-dominated applications

  2006cites this paper
• Large-Scale Program Behavior Analysis for Adaptation and Parallelization

  2006cites this paper
• Accurate Approximation of Locality from Time Distance Histograms

  2006cites this paper
• Instruction based memory distance analysis and its application to optimization

  2005cites this paper
• An improved instruction cache replacement algorithm

  2005cites this paper
• Data-access optimization of embedded systems through selective inlining transformation

  2005cites this paper
• Using the First-Level Caches as Filters to Reduce the Pollution Caused by Speculative Memory References

  2005cites this paper
• The Periodic-Linear Model of Program Behavior Capture

  2005cites this paper
• Distance-Based Locality Analysis and Prediction

  2004cites this paper
• A Method for Hierarchical Data Placement

  2004cites this paper
• Array regrouping and structure splitting using whole-program reference affinity

  2004cites this paper
• Memory hierarchy usage estimation for global loop transformations

  2004cites this paper
• Reuse-distance-based miss-rate prediction on a per instruction basis

  2004cites this paper
• Software Methods to Improve Data Locality and Cache Behavior

  2004cites this paper
• Analyzing the behavior of loop nests in the memory hierarchy: methods, tools, and applications

  2004influential citation
• Analytical Computation of Ehrhart Polynomials and its Application in Compile-Time Generated Cache Hints

  2004cites this paper
• Predicting whole-program locality through reuse distance analysis

  2003cites this paper
• Miss rate prediction across all program inputs

  2003cites this paper
• Regression-Based Multi-Model Prediction of Data Reuse Signature

  2003cites this paper
• Software refactoring guided by multiple soft-goals Conference Item

  2003cites this paper
• Software refactoring guided by multiple soft-goals

  2003cites this paper
• Cache Behavior Analysis Without Profiling.

  2002cites this paper
• An Efficient Simulation Algorithm for Cache of Random Replacement Policy

  year unknowncites this paper
• Instruction Based Memory Distance Analysis and its Application to Optimization ∗

  year unknowncites this paper