research-article

DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

Authors:

A. GerasoulisAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 5, Issue 9

Pages 951 - 967

https://doi.org/10.1109/71.308533

Published: 01 September 1994 Publication History

Abstract

We present a low-complexity heuristic, named the dominant sequence clusteringalgorithm (DSC), for scheduling parallel tasks on an unbounded number of completelyconnected processors. The performance of DSC is on average, comparable to, or evenbetter than, other higher-complexity algorithms. We assume no task duplication andnonzero communication overhead between processors. Finding the optimum solution forarbitrary directed acyclic task graphs (DAG's) is NP-complete. DSC finds optimalschedules for special classes of DAG's, such as fork, join, coarse-grain trees, and somefine-grain trees. It guarantees a performance within a factor of 2 of the optimum forgeneral coarse-grain DAG's. We compare DSC with three higher-complexity generalscheduling algorithms: the ETF by J.J. Hwang, Y.C. Chow, F.D. Anger, and C.Y. Lee(1989); V. Sarkar's (1989) clustering algorithm; and the MD by M.Y. Wu and D. Gajski(1990). We also give a sample of important practical applications where DSC has beenfound useful.

References

[1]

{1} M. A. Al-Mouhamed, "Lower bound on the number of processors and time for scheduling precedence graphs with communication costs," IEEE Trans. Software Eng., vol. 16, pp. 1390-1401, 1990.

Digital Library

[2]

{2} F. D. Anger, J. Hwang, and Y. Chow, "Scheduling, with sufficient loosely coupled processors," J. Parallel Distrib. Computing, vol. 9, pp. 87-92, 1990.

Digital Library

[3]

{3} P. Chretienne, "Task scheduling over distributed memory machines," in Proc. Int. Workshop Parallel Distrib. Algorithms, 1989.

[4]

{4} P. Chretienne, "A polynomial algorithm to optimially schedule tasks over an ideal distributed system under tree-like presedence constraints," European J. Oper. Res., vol. 2, pp. 225-230, 1989.

[5]

{5} P. Chretienne, "Complexity of tree scheduling with interprocessor communication delays," Tech. Rep. M.A.S.I. 90.5, Universite Pierre et Marie Curie, 1990.

[6]

{6} J. Y. Colin and P. Chretienne, "C. P. M. scheduling with small communication delays and task duplication," Oper. Res., vol. 39, no. 4, pp. 680-684, 1991.

Digital Library

[7]

{7} M. Cosnard, M. Marrakchi, Y. Robert, and D. Trystram, "Parallel Gaussian elimination on an MIMD computer," Parallel Computing, vol. 6, pp. 275-296, 1988.

[8]

{8} A. Gerasoulis and T. Yang, "On the granularity and clustering of directed acyclic task graphs," IEEE Trans. Parallel Distrib. Syst., vol. 4, pp. 686-701, June 1993.

Digital Library

[9]

{9} A. Gerasoulis and T. Yang, "A comparison of clustering heuristics for scheduling DAG's on multiprocessors," J. Parallel Distrib. Computing, vol. 16, pp. 276-291, Dec. 1992.

[10]

{10} M. Girkar and C. Polychronopoulos, "Partitioning programs for parallel execution," in Proc. 1988 ACM Int. Conf. Supercomputing, 1988.

[11]

{11} J. J. Hwang, Y. C. Chow, F. D. Anger, and C. Y. Lee, "Scheduling precedence graphs in systems with interprocessor communication times," SIAM J. Comput., 1989, pp. 244-257.

Digital Library

[12]

{12} S. J. Kim and J. C. Browne, "A general approach to mapping of parallel computation upon multiprocessor architectures," in Int. Conf. Parallel Processing, vol. 3, pp. 1-8, 1988.

[13]

{13} B. Kruatrachue and T. Lewis, "Grain size determination for parallel processing," IEEE Software, Jan. 1988, pp. 23-32.

[14]

{14} C. McCreary and H. Gill, "Automatic determination of grain size for efficient parallel processing," Commun. ACM, vol. 32, pp. 1073-1078, Sept. 1989.

Digital Library

[15]

{15} C. Papadimitriou and M. Yannakakis, "Toward an architecture-independent analysis of parallel algorithms," SIAM J. Comput., vol. 19, pp. 322-328, 1990.

Digital Library

[16]

{16} R. Pozo, "Performance modeling of sparse matrix methods for distributed memory architectures," in Lecture Notes in Computer Science 634, Parallel Processing: CONPAR 92--VAPPV. New York: Springer-Verlag, 1992, pp. 677-688.

[17]

{17} V. Sarkar, Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. Cambridge, MA: MIT Press, 1989.

[18]

{18} R. Wolski and J. Feo, "Program parititoning for NUMA multiprocessor computer systems," J. Parallel Distrib. Computing (special issue on performance of supercomputers), vol. 19, pp. 203-218, 1993.

Digital Library

[19]

{19} M. Y. Wu and D. Gajski, "Hypertool: A programming aid for messagepassing systems," IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 330-343, 1990.

Digital Library

[20]

{20} M. Y. Wu, personal commun., Feb. 1993.

[21]

{21} J. Yang, L. Bic, and A. Nicolau, "A mapping strategy for MIMD computers," Proc. 1991 Int. Conf. Parallel Processing, vol. I, pp. 102-109.

[22]

{22} T. Yang and A. Gerasoulis, "A fast static scheduling algorithm for DAG's on an unbounded number of processors," Proc. Supercomputing '91, 1991, pp. 633-642.

Digital Library

[23]

{23} T. Yang and A. Gerasoulis, "PYRROS: Static scheduling and code generation for message passing multiprocessors," Proc. 6th ACM Int. Conf. Supercomputing, 1992, pp. 428-437.

Digital Library

Cited By

Papp PAnegg GKaranasiou AYzelman AAgrawal KPetrank E(2024)Efficient Multi-Processor Scheduling in Increasingly Realistic ModelsProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659972(463-474)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659972
Mrabet FKaramti WMahfoudhi A(2024)Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architecturesComputing10.1007/s00607-023-01237-y106:3(651-712)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00607-023-01237-y
Emami MKashani SKamahori KPourghannad MRaj RLarus JAamodt TSwift MJerger N(2023)Manticore: Hardware-Accelerated RTL Simulation with Static Bulk-Synchronous ParallelismProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 410.1145/3623278.3624750(219-237)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3623278.3624750
Show More Cited By

Recommendations

Load Balancing with Internode Precedence Relations: A New Method for Static Allocation of DAGs into Parallel Systems
PDP '96: Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)

Abstract: In order to execute a parallel program Pp on a parallel machine PM, we must determine an allocation function which assigns Pp operations to PM processors, such that the execution time of Pp is minimum. As this problem is known to be NP-...
Scheduling interval orders in parallel
HICSS '95: Proceedings of the 28th Hawaii International Conference on System Sciences

Interval orders are partial orders defined by having interval representations. It is well known that a transitively oriented digraph G is an interval order iff its (undirected) complement G~ is chordal. We investigate parallel algorithms for the ...
On the Granularity and Clustering of Directed Acyclic Task Graphs

The authors consider the impact of the granularity on scheduling task graphs. Schedulingconsists of two parts, the processors assignment of tasks, also called clustering, and theordering of tasks for execution in each processor. The authors introduce ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 5, Issue 9

September 1994

111 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © Copyright © 1994 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 September 1994

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

176
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Papp PAnegg GKaranasiou AYzelman AAgrawal KPetrank E(2024)Efficient Multi-Processor Scheduling in Increasingly Realistic ModelsProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659972(463-474)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659972
Mrabet FKaramti WMahfoudhi A(2024)Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architecturesComputing10.1007/s00607-023-01237-y106:3(651-712)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00607-023-01237-y
Emami MKashani SKamahori KPourghannad MRaj RLarus JAamodt TSwift MJerger N(2023)Manticore: Hardware-Accelerated RTL Simulation with Static Bulk-Synchronous ParallelismProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 410.1145/3623278.3624750(219-237)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3623278.3624750
Cheng SHuang JChen ZLiu JLi J(2023)Approximated Assignment Algorithms for Unordered and Ordered Tasks in Data Shared MEC SystemsIEEE Transactions on Mobile Computing10.1109/TMC.2021.311246622:4(1968-1987)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TMC.2021.3112466
Gupta PBhagat SRawat P(2022)Fault aware hybrid harmony search technique for optimal resource allocation in cloudJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-21184642:4(3677-3689)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.3233/JIFS-211846
Herbein SPatki TAhn DMobo SHathaway CCaíno-Lores SCorbett JDomyancic DScogland Tde Supinski BTaufer M(2022)An analytical performance model of generalized hierarchical schedulingInternational Journal of High Performance Computing Applications10.1177/1094342021105103936:3(289-306)Online publication date: 1-May-2022
https://dl.acm.org/doi/10.1177/10943420211051039
Pandey SShanker U(2022)On Developing Framework for Schedulable Priority-Driven Systems: A Futuristic ReviewWireless Personal Communications: An International Journal10.1007/s11277-022-10082-9128:4(2983-3001)Online publication date: 15-Nov-2022
https://dl.acm.org/doi/10.1007/s11277-022-10082-9
Berenjian GMotameni HGolsorkhtabaramiri MEbrahimnejad A(2021)Distribution slack allocation algorithm for energy aware task scheduling in cloud datacentersJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-20169641:1(251-272)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.3233/JIFS-201696
Jeon BCai LSrivastava PJiang JKe XMeng YXie CGupta IFonseca RDelimitrou COoi B(2020)BaechiProceedings of the 11th ACM Symposium on Cloud Computing10.1145/3419111.3421302(416-430)Online publication date: 12-Oct-2020
https://dl.acm.org/doi/10.1145/3419111.3421302
Beaumont OCanon LEyraud-Dubois LLucarelli GMarchal LMommessin CSimon BTrystram D(2020)Scheduling on Two Types of ResourcesACM Computing Surveys10.1145/338711053:3(1-36)Online publication date: 28-May-2020
https://dl.acm.org/doi/10.1145/3387110
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents