Publication: Reusetracker: fast yet accurate multicore reuse distance analyzer
Program
KU Authors
Co-Authors
Chabbi, Milind
Advisor
Publication Date
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Abstract
One widely used metric that measures data locality is reuse distance-the number of unique memory locations that are accessed between two consecutive accesses to a particular memory location. State-of-the-art techniques that measure reuse distance in parallel applications rely on simulators or binary instrumentation tools that incur large performance and memory overheads. Moreover, the existing sampling-based tools are limited to measuring reuse distances of a single thread and discard interactions among threads in multi-threaded programs. In this work, we propose REUSETRACKER a fast and accurate reuse distance analyzer that lever-ages existing hardware features in commodity CPUs. REUSETRACKER is designed for multi-threaded programs and takes cache-coherence effects into account. By utilizing hardware features like performance monitoring units and debug registers, REUSETRACKER can accurately profile reuse distance in parallel applications with much lower overheads than existing tools. It introduces only 2.9x runtime and 2.8x memory overheads. Our tool achieves 92% accuracy when verified against a newly developed configurable benchmark that can generate a variety of different reuse distance patterns. We demonstrate the tool's functionality with two use-case scenarios using PARSEC, Rodinia, and Synchrobench benchmark suites where REUSETRACKER guides code refactoring in these benchmarks by detecting spatial reuses in shared caches that are also false sharing and successfully predicts whether some benchmarks in these suites can benefit from adjacent cache line prefetch optimization.
Source:
ACM Transactions on Architecture and Code Optimization
Publisher:
Assoc Computing Machinery
Keywords:
Subject
Computer science, Computer architecture