Skip to Main content Skip to Navigation
New interface
Reports (Research report)

On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution

Abstract : Technology trends are making the cost of data movement increasingly dominant, both in terms of energy and time, over the cost of performing arithmetic operations in computer systems. The fundamental ratio of aggregate data movement bandwidth to the total computational power (also referred to the machine balance parameter ) in parallel computer systems is decreasing. It is there- fore of considerable importance to characterize the inherent data movement requirements of parallel algorithms, so that the minimal architectural balance parameters required to support it on future systems can be well understood. In this paper, we develop an extension of the well-known red-blue pebble game to develop lower bounds on the data movement complexity for the parallel execution of computational directed acyclic graphs (CDAGs) on parallel systems. We model multi-node multi-core parallel systems, with the total physical memory distributed across the nodes (that are connected through some interconnection network) and in a multi-level shared cache hierarchy for processors within a node. We also develop new techniques for lower bound characterization of non-homogeneous CDAGs. We demonstrate the use of the methodology by analyzing the CDAGs of several numerical algorithms, to develop lower bounds on data movement for their parallel execution.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Fabrice Rastello Connect in order to contact the contributor
Submitted on : Friday, April 18, 2014 - 11:59:37 AM
Last modification on : Tuesday, November 29, 2022 - 12:06:07 PM
Long-term archiving on: : Monday, April 10, 2017 - 3:27:02 PM


Files produced by the author(s)


  • HAL Id : hal-00980580, version 1
  • ARXIV : 1404.4767


Venmugil Elango, Fabrice Rastello, Louis-Noël Pouchet, Jagannathan Ramanujam, P. Sadayappan. On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution. [Research Report] RR-8522, INRIA. 2014, pp.27. ⟨hal-00980580⟩



Record views


Files downloads