Advertisement

Data Driven Graph: A Parallel Program Model for Scheduling

  • V. D. Tran
  • L. Hluchy
  • G. T. Nguyen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1863)

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 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Y. Kwok, I. Ahmad: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors, IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 506–521, 1996.CrossRefGoogle Scholar
  3. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • V. D. Tran
    • 1
  • L. Hluchy
    • 1
  • G. T. Nguyen
    • 1
  1. 1.Institute of InformaticsSlovak Academy of SciencesSlovakia

Personalised recommendations