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 …