Data Driven Graph: A Parallel Program Model for Scheduling
In this paper, we present a new powerful method for parallel program representation called Data Driven Graph (DDG). DDG takes all advantages of classical Directed Acyclic Graph (DAG) and adds much more: simple definition, flexibility and ability to represent loops and dynamically created tasks. With DDG, scheduling becomes an efficient tool for increasing performance of parallel systems. DDG is not only a parallel program model, it also initiates a new parallel programming style, allows programmers to write a parallel program with minimal dificulty. We also present our parallel program development tool with support for DDG and scheduling.
Unable to display preview. Download preview PDF.
- 1.S. Ha, E. A. Lee: Compile-Time Scheduling of Dynamic Constructs in Dataflow Program Graph, IEEE Trans. Parallel and Distributed Systems, vol. 46, no. 7, pp. 768–778, 1997.Google Scholar
- 3.E. Maehle, F. Markus: Fault-Tolerant Dynamic Task Scheduling Based on Dataflow Graphs, Proc. IPPS’97, Workshop on Fault-Tolerant and Distributed Systems,Switzerland 1997.Google Scholar