Synonyms
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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Benoit A, Robert Y (2008) Mapping pipeline skeletons onto heterogeneous platforms. J Parallel Distr Comput 68(6): 790–808
Brucker P (2004) Scheduling algorithms. Springer, New York
Casanova H, Legrand A, Robert Y (2008) Parallel algorithms. Chapman & Hall/CRC Press, Beaumont, TX
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
Coffman EG (1976) Computer and job-shop scheduling theory. Wiley, Hoboken, NJ
Darte A, Robert Y, Vivien F (2000) Scheduling and automatic parallelization. Birkhaüser, Boston
El-Rewini H, Lewis TG, Ali HH (1994) Task scheduling in parallel and distributed systems. Prentice Hall, Englewood Cliffs
Garey MR, Johnson DS (1991) Computers and intractability, a guide to the theory of NP-completeness. WH Freeman and Company, New York
Gerasoulis A, Yang T (1992) A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J Parallel Distr Comput 16(4):276–291
Graham RL (1996) Bounds for certain multiprocessor anomalies. Bell Syst Tech J 45:1563–1581
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
Leung JY-T (ed) (2004) Handbook of scheduling: algorithms, models, and performance analysis. Chapman and Hall/CRC Press, Boca Raton
Picouleau C (1995) Task scheduling with interprocessor communication delays. Discrete App Math 60(1–3):331–342
Robert Y, Vivien F (eds) (2009) Introduction to scheduling. Chapman and Hall/CRC Press, Boca Raton
Shirazi BA, Hurson AR, Kavi KM (1995) Scheduling and load balancing in parallel and distributed systems. IEEE Computer Science Press, San Diego
Sinnen O (2007) Task scheduling for parallel systems. Wiley, Hoboken
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
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
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-0-387-09766-4_42
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09765-7
Online ISBN: 978-0-387-09766-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering