Skip to main content
SpringerLink
Log in

Data Driven Graph: A Parallel Program Model for Scheduling

  • Conference paper
  • First Online:
Languages and Compilers for Parallel Computing (LCPC 1999)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Slovak Academy of Sciences, Slovakia

    V. D. Tran, L. Hluchy & G. T. Nguyen

Authors
  1. V. D. Tran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Hluchy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. T. Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA, 92093-0114, USA

    Larry Carter  & Jeanne Ferrante  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tran, V.D., Hluchy, L., Nguyen, G.T. (2000). Data Driven Graph: A Parallel Program Model for Scheduling. In: Carter, L., Ferrante, J. (eds) Languages and Compilers for Parallel Computing. LCPC 1999. Lecture Notes in Computer Science, vol 1863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44905-1_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-44905-1_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67858-8

  • Online ISBN: 978-3-540-44905-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation