Skip to main content
SpringerLink
Log in

A Runtime System for Dynamic DAG Programming

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPDPS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1800))

Included in the following conference series:

  • 1025 Accesses

Abstract

A runtime system is described here for dynamic DAG execution. A large DAG which represents an application program can be executed on a parallel system without consuming large amount of memory space. A DAG scheduling algorithm has been parallelized to scale to large systems. Inaccurate estimation of task execution time and communication time can be tolerated. Implementation of this parallel incremental system demonstrates the feasibility of this approach. Preliminary results show that it is superior to other approaches.

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. I. Ahmad, Y.K. Kwok, and M. Y. Wu. Performance comparison of algorithms for static scheduling of DAGs to multiprocessors. In Second Australasian Conference on Parallel and Real-time Systems, pages 185–192, September 1995.

    Google Scholar 

  2. M. Cosnard, E. Jeannnot, and L. Rougeot. Low memory cost dynamic scheduling of large coarse grain task graphs. In International Parallel Processing Symposium, April 1998.

    Google Scholar 

  3. H. El-Rewini and T. G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, June 1990.

    Google Scholar 

  4. M.R. Gary and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.

    Google Scholar 

  5. M. Y. Wu. Parallel incremental scheduling. Parallel Processing Letters, 5(4):659–670, December 1995.

    Article  MathSciNet  Google Scholar 

  6. M. Y. Wu and D. D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Trans. Parallel and Distributed Systems, 1(3):330–343, July 1990.

    Article  Google Scholar 

  7. M. Y. Wu and W. Shu. On parallelization of static scheduling algorithms. IEEE Transactions on Software Engineering, 23(8):517–528, August 1997.

    Article  MathSciNet  Google Scholar 

  8. M. Y. Wu, W. Shu, and Y. Chen. Incremental scheduling and execution of dags. In IASTED International Conference on Parallel and Distributed Computing Systems, November 1999.

    Google Scholar 

  9. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel and Distributed System, 5(9):951–967, September 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of ECE, University of New Mexico, USA

    Min-You Wu & Wei Shu

  2. Department of ECE, University of Central Florida, USA

    Yong Chen

Authors
  1. Min-You Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Shu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre Universitaire d’Informatique, Université de Genève, 24, rue Général Dufour, CH-1211, Genève 4, Switzerland

    José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, MY., Shu, W., Chen, Y. (2000). A Runtime System for Dynamic DAG Programming. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_164

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_164

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67442-9

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation