Skip to main content
SpringerLink
Log in

Task Graph Scheduling

  • Reference work entry
Encyclopedia of Parallel Computing

Synonyms

DAG scheduling; Workflow scheduling

Definition

Task Graph Scheduling is the activity that consists in mapping a task graph onto a target platform. The task graph represents the application: Nodes denote computational tasks, and edges model precedence constraints between tasks. For each task, an assignment (choose the processor that will execute the task) and a schedule (decide when to start the execution) are determined. The goal is to obtain an efficient execution of the application, which translates into optimizing some objective function, most usually the total execution time.

Discussion

Introduction

Task Graph Scheduling is the activity that consists in mapping a task graph onto a target platform. The task graph is given as input to the scheduler. Hence, scheduling algorithms are completely independent of models and methods used to derive task graphs. However, it is insightful to start with a discussion on how these task graphs are constructed.

Consider an application that...

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 1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,799.99
Price excludes VAT (USA)
  • Durable hardcover 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

Bibliography

  1. Benoit A, Robert Y (2008) Mapping pipeline skeletons onto heterogeneous platforms. J Parallel Distr Comput 68(6): 790–808

    Google Scholar 

  2. Brucker P (2004) Scheduling algorithms. Springer, New York

    MATH  Google Scholar 

  3. Casanova H, Legrand A, Robert Y (2008) Parallel algorithms. Chapman & Hall/CRC Press, Beaumont, TX

    Google Scholar 

  4. Chrétienne P, Picouleau C (1995) Scheduling with communication delays: a survey. In: Chrétienne P, Coffman EG Jr, Lenstra JK, Liu Z (eds) Scheduling theory and its applications. Wiley, Hoboken, NJ, pp 65–89

    Google Scholar 

  5. Coffman EG (1976) Computer and job-shop scheduling theory. Wiley, Hoboken, NJ

    MATH  Google Scholar 

  6. Darte A, Robert Y, Vivien F (2000) Scheduling and automatic parallelization. Birkhaüser, Boston

    MATH  Google Scholar 

  7. El-Rewini H, Lewis TG, Ali HH (1994) Task scheduling in parallel and distributed systems. Prentice Hall, Englewood Cliffs

    Google Scholar 

  8. Garey MR, Johnson DS (1991) Computers and intractability, a guide to the theory of NP-completeness. WH Freeman and Company, New York

    Google Scholar 

  9. Gerasoulis A, Yang T (1992) A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J Parallel Distr Comput 16(4):276–291

    MATH  MathSciNet  Google Scholar 

  10. Graham RL (1996) Bounds for certain multiprocessor anomalies. Bell Syst Tech J 45:1563–1581

    Google Scholar 

  11. Hary SL, Ozguner F (1999) Precedence-constrained task allocation onto point-to-point networks for pipelined execution. IEEE Trans Parallel Distr Syst 10(8):838–851

    Google Scholar 

  12. Leung JY-T (ed) (2004) Handbook of scheduling: algorithms, models, and performance analysis. Chapman and Hall/CRC Press, Boca Raton

    MATH  Google Scholar 

  13. Picouleau C (1995) Task scheduling with interprocessor communication delays. Discrete App Math 60(1–3):331–342

    MATH  MathSciNet  Google Scholar 

  14. Robert Y, Vivien F (eds) (2009) Introduction to scheduling. Chapman and Hall/CRC Press, Boca Raton

    Google Scholar 

  15. Shirazi BA, Hurson AR, Kavi KM (1995) Scheduling and load balancing in parallel and distributed systems. IEEE Computer Science Press, San Diego

    Google Scholar 

  16. Sinnen O (2007) Task scheduling for parallel systems. Wiley, Hoboken

    Google Scholar 

  17. Spencer M, Ferreira R, Beynon M, Kurc T, Catalyurek U, Sussman A, Saltz J (2002) Executing multiple pipelined data analysis operations in the grid. Proceedings of the ACM/IEEE supercomputing conference. ACM Press, Los Alamitos

    Google Scholar 

  18. Subhlok J, Vondran G (1995) Optimal mapping of sequences of data parallel tasks. Proceedings of the 5th ACM SIGPLAN symposium on principles and practice of parallel programming. ACM Press, San Diego, pp 134–143

    Google Scholar 

  19. Topcuoglu H, Hariri S, Wu MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distr Syst 13(3):260–274

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LIP, Ecole Normale Supérieure de Lyon, 46 allée d’Italie, 69364, Lyon, France

    Yves Robert (Prof.)

Authors
  1. Yves Robert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Illinois at Urbana-Champaign, Urbana, IL, USA

    David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Robert, Y. (2011). Task Graph Scheduling. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_42

Download citation

Publish with us

Policies and ethics

Search

Navigation