Pith. sign in

REVIEW 1 cited by

DAMOV: A New Methodology and Benchmark Suite for Evaluating Data Movement Bottlenecks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.03725 v6 pith:4VBV76GT submitted 2021-05-08 cs.AR cs.DCcs.PF

classification cs.ARcs.DCcs.PF
keywords datamovementtechniquesapplicationsbottlenecksdamovmemoryrange
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Data movement between the CPU and main memory is a first-order obstacle against improving performance, scalability, and energy efficiency in modern systems. Computer systems employ a range of techniques to reduce overheads tied to data movement, spanning from traditional mechanisms (e.g., deep multi-level cache hierarchies, aggressive hardware prefetchers) to emerging techniques such as Near-Data Processing (NDP), where some computation is moved close to memory. Our goal is to methodically identify potential sources of data movement over a broad set of applications and to comprehensively compare traditional compute-centric data movement mitigation techniques to more memory-centric techniques, thereby developing a rigorous understanding of the best techniques to mitigate each source of data movement. With this goal in mind, we perform the first large-scale characterization of a wide variety of applications, across a wide range of application domains, to identify fundamental program properties that lead to data movement to/from main memory. We develop the first systematic methodology to classify applications based on the sources contributing to data movement bottlenecks. From our large-scale characterization of 77K functions across 345 applications, we select 144 functions to form the first open-source benchmark suite (DAMOV) for main memory data movement studies. We select a diverse range of functions that (1) represent different types of data movement bottlenecks, and (2) come from a wide range of application domains. Using NDP as a case study, we identify new insights about the different data movement bottlenecks and use these insights to determine the most suitable data movement mitigation mechanism for a particular application. We open-source DAMOV and the complete source code for our new characterization methodology at https://github.com/CMU-SAFARI/DAMOV.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. New Tools, Programming Models, and System Support for Processing-in-Memory Architectures

    cs.AR 2025-08 conditional novelty 4.0 of 10

    A PhD dissertation contributing DAMOV (data-movement benchmark suite), MIMDRAM and Proteus (processing-using-DRAM designs), and DaPPA (near-memory programming framework), claiming large performance and energy gains fo...

Pith tools