Data driven graph: A parallel program model for scheduling

Abstract

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 dy- namically created tasks. With DDG, scheduling becomes an eficient tool for increasing performance of parallel systems. DDG is not only a par- allel 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.