Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models
Article No.: 2, Pages 1 - 31
Abstract
We consider the online scheduling problem of moldable task graphs on multiprocessor systems for minimizing the overall completion time (or makespan). Moldable job scheduling has been widely studied in the literature, in particular when tasks have dependencies (i.e., task graphs) or when tasks are released on-the-fly (i.e., online). However, few studies have focused on both (i.e., online scheduling of moldable task graphs). In this article, we design a new online scheduling algorithm for this problem and derive constant competitive ratios under several common yet realistic speedup models (i.e., roofline, communication, Amdahl, and a general combination). These results improve the ones we have shown in the preliminary version of the article. We also prove, for each speedup model, a lower bound on the competitiveness of any online list scheduling algorithm that allocates processors to a task based only on the task’s parameters and not on its position in the graph. This lower bound matches exactly the competitive ratio of our algorithm for the roofline, communication, and Amdahl’s model, and is close to the ratio for the general model. Finally, we provide a lower bound on the competitive ratio of any deterministic online algorithm for the arbitrary speedup model, which is not constant but depends on the number of tasks in the longest path of the graph.
References
[1]
Kunal Agrawal, Charles E. Leiserson, and Jim Sukha. 2010. Executing task graphs using work-stealing. In IPDPS. 1–12.
[2]
Gene M. Amdahl. 1967. Validity of the single processor approach to achieving large scale computing capabilities. In AFIPS’67. 483–485.
[3]
Krishna P. Belkhale and Prithviraj Banerjee. 1990. An approximate algorithm for the partitionable independent task scheduling problem. In ICPP. 72–75.
[4]
Krishna P. Belkhale, Prithviraj Banerjee, and W. Springfield Av. 1991. A scheduling algorithm for parallelizable dependent tasks. In IPPS. 500–506.
[5]
Anne Benoit, Valentin Le Fèvre, Lucas Perotin, Padma Raghavan, Yves Robert, and Hongyang Sun. 2020. Resilient scheduling of moldable jobs on failure-prone platforms. In IEEE Cluster.
[6]
Anne Benoit, Valentin Le Fèvre, Lucas Perotin, Padma Raghavan, Yves Robert, and Hongyang Sun. 2022. Resilient scheduling of moldable parallel jobs to cope with silent errors. IEEE Trans. Comput. 71, 07 (2022), 1696–1710.
[7]
Anne Benoit, Lucas Perotin, Yves Robert, and Hongyang Sun. 2022. Online scheduling of moldable task graphs under common speedup models. In ICPP. 51:1–51:11.
[8]
J. Blazewicz, M. Machowiak, G. Mounié, and D. Trystram. 2001. Approximation algorithms for scheduling independent malleable tasks. In Euro-Par. 191–197.
[9]
Louis-Claude Canon, Loris Marchal, Bertrand Simon, and Frédéric Vivien. 2020. Online scheduling of task graphs on heterogeneous platforms. IEEE Trans. Parallel Distrib. Syst. 31, 3 (2020), 721–732.
[10]
Chi-Yeh Chen and Chih-Ping Chu. 2013. A 3.42-approximation algorithm for scheduling malleable tasks under precedence constraints. IEEE Trans. Parallel Distrib. Syst. 24, 8 (2013), 1479–1488.
[11]
Richard A. Dutton and Weizhen Mao. 2007. Online scheduling of malleable parallel jobs. In PDCS. 136–141.
[12]
Dror G. Feitelson and Larry Rudolph. 1996. Toward convergence in job schedulers for parallel supercomputers. In Job Scheduling Strategies for Parallel Processing. Springer, 1–26.
[13]
Anja Feldmann, Ming-Yang Kao, Jiří Sgall, and Shang-Hua Teng. 1998. Optimal on-line scheduling of parallel jobs with dependencies. J. Combinator. Optim. 1, 4 (1998), 393–411.
[14]
R. L. Graham. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 2 (1969), 416–429.
[15]
Jessen T. Havill and Weizhen Mao. 2008. Competitive online scheduling of perfectly malleable jobs with setup times. Eur. Journal of Oper. Res. 187 (2008), 1126–1142.
[16]
Klaus Jansen. 2012. A ( \(3/2+\epsilon\) ) approximation algorithm for scheduling moldable and non-moldable parallel tasks. In SPAA. 224–235.
[17]
K. Jansen and F. Land. 2018. Scheduling monotone moldable jobs in linear time. In IPDPS. 172–181.
[18]
Klaus Jansen and Ralf Thöle. 2010. Approximation algorithms for scheduling parallel jobs. SIAM J. Comput. 39, 8 (2010), 3571–3615.
[19]
Klaus Jansen and Hu Zhang. 2005. Scheduling malleable tasks with precedence constraints. In SPAA. 86–95.
[20]
Klaus Jansen and Hu Zhang. 2006. An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Trans. Algor. 2, 3 (2006), 416–434.
[21]
Berit Johannes. 2006. Scheduling parallel jobs to minimize the makespan. J. Sched. 9, 5 (2006), 433–452.
[22]
Theodore Johnson, Timothy A. Davis, and Steven M. Hadfield. 1996. A concurrent dynamic task graph. Parallel Comput. 22, 2 (1996), 327–333.
[23]
Nathaniel Kell and Jessen Havill. 2015. Improved upper bounds for online malleable job scheduling. J. Sched. 18, 4 (2015), 393–410.
[24]
Renaud Lepère, Denis Trystram, and Gerhard J. Woeginger. 2001. Approximation algorithms for scheduling malleable tasks under precedence constraints. In ESA. 146–157.
[25]
Walter Ludwig and Prasoon Tiwari. 1994. Scheduling malleable and nonmalleable parallel tasks. In SODA. 167–176.
[26]
Gregory Mounié, Christophe Rapine, and Dennis Trystram. 1999. Efficient approximation algorithms for scheduling malleable tasks. In SPAA. 23–32.
[27]
Gregory Mounié, Christophe Rapine, and Denis Trystram. 2007. A 3/2-approximation algorithm for scheduling independent monotonic malleable tasks. SIAM J. Comput. 37, 2 (2007), 401–412.
[28]
Daniel D. Sleator and Robert E. Tarjan. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (1985), 202–208.
[29]
John Turek, Joel L. Wolf, and Philip S. Yu. 1992. Approximate algorithms scheduling parallelizable tasks. In SPAA.
[30]
Jeffrey D. Ullman. 1975. NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 3 (1975), 384–393.
[31]
Qingzhou Wang and Kam Hoi Cheng. 1992. A heuristic of scheduling parallel tasks and its analysis. SIAM J. Comput. 21, 2 (1992), 281–294.
[32]
Samuel Williams, Andrew Waterman, and David Patterson. 2009. Roofline: An insightful visual performance model for multicore architectures. Commun. ACM 52, 4 (2009), 65–76.
[33]
Deshi Ye, Danny Z. Chen, and Guochuan Zhang. 2018. Online scheduling of moldable parallel tasks. J. Sched. 21, 6 (2018), 647–654.
Index Terms
- Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models
Recommendations
Online Scheduling of Moldable Task Graphs under Common Speedup Models
ICPP '22: Proceedings of the 51st International Conference on Parallel ProcessingThe problem of scheduling moldable tasks on multiprocessor systems with the objective of minimizing the overall completion time (or makespan) has been widely studied, in particular when tasks have dependencies (i.e., task graphs), or when tasks are ...
Online scheduling of moldable parallel tasks
In this paper, we study an online scheduling problem with moldable parallel tasks on m processors. Each moldable task can be processed simultaneously on any number of processors of a parallel computer, and the processing time of a moldable task depends ...
Online scheduling of equal-processing-time task systems
We consider the problem of online scheduling a set of equal-processing-time tasks with precedence constraints so as to minimize the makespan. For arbitrary precedence constraints, it is known that any list scheduling algorithm has a competitive ratio of ...
Comments
Information & Contributors
Information
Published In
March 2024
188 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 March 2024
Online AM: 26 October 2023
Accepted: 20 October 2023
Revised: 11 October 2023
Received: 22 April 2023
Published in TOPC Volume 11, Issue 1
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- US National Science Foundation
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 129Total Downloads
- Downloads (Last 12 months)129
- Downloads (Last 6 weeks)4
Reflects downloads up to 09 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in