Path-Based Reuse Distance Analysis

Fang, Changpeng; Carr, Steve; Önder, Soner; Wang, Zhenlin

doi:10.1007/11688839_4

Cited by 6 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RD has been widely used for memory access behavior prediction at granularities ranging from instruction-level to whole-program [7,9,10,19,38,39,41]. RD has also been used as the basis for program transformations and cache management schemes for improving data locality [2,18,20,40].…”

Section: Reuse Distancementioning

confidence: 99%

Imbalanced cache partitioning for balanced data-parallel programs

Pan

Pai

2013

Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture

View full text Add to dashboard Cite

This paper investigates partitioning the ways of a shared last-level cache among the threads of a symmetric dataparallel application running on a chip-multiprocessor. Unlike prior work on way-partitioning for unrelated threads in a multiprogramming workload, the domain of multithreaded programs requires both throughput and fairness. Additionally, our workloads show no obvious thread differences to exploit: program threads see nearly identical IPC and data reuse as they progress (as expected for a well-written loadbalanced data-parallel program).Despite the balance and symmetry among threads, this paper shows that a balanced partitioning of cache ways between threads is suboptimal. Instead, this paper proposes a strategy of temporarily imbalancing the partitions between different threads to improve cache utilization by adapting to the locality behavior of the threads as captured by dynamic set-specific reuse-distance (SSRD). Cumulative SSRD histograms have knees that correspond to different important working sets; thus, cache ways can be taken away from a thread with only minimal performance impact if that thread is currently operating far from a knee. Those ways can then be given to a single "preferred" thread to push it over the next knee. The preferred thread is chosen in a round-robin fashion to ensure balanced progress over the execution. The algorithm also effectively handles scenarios where an unpartitioned cache might outperform any sort of explicit partitioning. This dynamic partition imbalance algorithm allows up to 44% reduction in execution time and 91% reduction in misses over an unpartitioned shared cache for 9 benchmarks from the PARSEC-2.0 and SPEC OMP suites.

show abstract

Section: Reuse Distancementioning

confidence: 99%

Imbalanced cache partitioning for balanced data-parallel programs

Pan

Pai

2013

Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture

View full text Add to dashboard Cite

show abstract

“…At the program level, reuse distance analysis extends dependence analysis, which identifies reuses of program data [1], to count the volume of the intervening data [4,8,10]. At the trace level, the analysis can correlate the change in locality in different runs to derive program-level patterns and complement static analysis [21,30,49].…”

Section: Reuse Distancementioning

confidence: 99%

Hotl

Xiang

Ding

Luo

et al. 2013

Proceedings of the Eighteenth International Conference on Architectural Support for Programming Languages and Operating Systems

View full text Add to dashboard Cite

The locality metrics are many, for example, miss ratio to test performance, data footprint to manage cache sharing, and reuse distance to analyze and optimize a program. It is unclear how different metrics are related, whether one subsumes another, and what combination may represent locality completely.This paper first derives a set of formulas to convert between five locality metrics and gives the condition for correctness. The transformation is analogous to differentiation and integration. As a result, these metrics can be assigned an order and organized into a hierarchy.Using the new theory, the paper then develops two techniques: one measures the locality in real time without special hardware support, and the other predicts multicore cache interference without parallel testing. The paper evaluates them using sequential and parallel programs as well as for a parallel mix of sequential programs.

show abstract

Discovery of Locality-Improving Refactorings by Reuse Path Analysis

Beyls

D’Hollander

2006

High Performance Computing and Communications

View full text Add to dashboard Cite

Path-Based Reuse Distance Analysis

Cited by 6 publications

References 33 publications

Imbalanced cache partitioning for balanced data-parallel programs

Imbalanced cache partitioning for balanced data-parallel programs

Hotl

Discovery of Locality-Improving Refactorings by Reuse Path Analysis

Contact Info

Product

Resources

About