article

Free access

A comparison of list schedules for parallel processing systems

Authors:

Thomas L. Adam,

K. M. Chandy,

J. R. DicksonAuthors Info & Claims

Communications of the ACM, Volume 17, Issue 12

Pages 685 - 690

https://doi.org/10.1145/361604.361619

Published: 01 December 1974 Publication History

PDF eReader

Abstract

The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that different algorithms suggested in the literature vary significantly in execution time and that the B-schedule of Coffman and Graham is near-optimal. A dynamic programming solution for the case in which execution times are random variables is presented.

References

[1]

Coffman, E. G., and Denning, P. J. Operating Systems Theory. Prentice-Hall, Englewood Cliffs, N.J. (to be published).

Digital Library

Google Scholar

[2]

Ramamoorthy, C.V., Chandy, K.M., and Gonzalez, M.J. Jr. Optimal scheduling strategies in a multi-processor system. IEEETrans. Comp. C-21, 2 (Feb. 1972), 137-146.

Digital Library

Google Scholar

[3]

Ramamoorthy, C.V., and Gonzalez, M.J. Jr. A survey of techniques for recognizing parallel processable streams in computer programs. Proc. AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Montvale, N.J., pp. 1-17.

Google Scholar

[4]

Fernandez, E.B., and Bussell, B. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Trans. Comp., C-22, 8 (Aug. 1973), 745-751.

Digital Library

Google Scholar

[5]

Chandy, K.M., and Dickson, J.R. Scheduling unidentical processors in a stochastic environment. Proc. COMPCON '72, 1972, pp. 171-174.

Google Scholar

[6]

Coffman, E.G., and Graham, R.L. Optimal scheduling for two-processor systems. Acta Informatica, 1, 3 (1972), 200--213.

Digital Library

Google Scholar

[7]

Graham, R.L. Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. (Nov. 1966), 1563-1581.

Crossref

Google Scholar

[8]

Martin, D.F., and Estrin, G. Experiments on models of computations and systems. IEEE Trans. EC, EC-16, 1 (Feb. 1967), 59-69.

Google Scholar

[9]

Gonzalez, M.J. Jr. A decentralized parallel processor system. Ph.D. Diss. U. of Texas at Austin, 1971.

Google Scholar

[10]

Krone, M. Heuristic programming applied to scheduling models. Proc. Fifth Ann. Conf. on Inform. Sci. and Syst. Elec. Eng. Dep., Princeton U., (1971), pp. 841-848.

Google Scholar

[11]

Manacher, G.K. Production and stabilization of real-time task schedulers. J. ACM 14, 3 (July 1967), 439-465.

Digital Library

Google Scholar

Cited By

View all

Shin JArroyo DTantawi AWang CYoussef ANagi R(2024)Cloud-native Workflow Scheduling using a Hybrid Priority Rule, Dynamic Resource Allocation, and Dynamic Task PartitionProceedings of the 2024 ACM Symposium on Cloud Computing10.1145/3698038.3698551(830-846)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3698038.3698551
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
Arias JOlarte CPetrucci LMaśko ŁPenczek WSidoruk T(2024)Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative ModelsIEEE Transactions on Reliability10.1109/TR.2024.335445973:2(861-875)Online publication date: Jun-2024
https://doi.org/10.1109/TR.2024.3354459
Show More Cited By

Recommendations

List scheduling revisited

We consider the problem of scheduling n jobs on m identical parallel machines to minimize a regular cost function. The standard list scheduling algorithm converts a list into a feasible schedule by focusing on the job start times. We prove that list ...
Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems

A main objective of scheduling independent jobs composed of multiple sequential tasks in shared-memory and distributed-memory multiprocessor computer systems is theassignment of these tasks to processors in a manner that ensures efficient operation ...
Task Scheduling on the PASM Parallel Processing System

PASM is a proposed large-scale distributed/parallel processing system which can be partitioned into independent SIMD/MIMD machines of various sizes. One design problem for systems such as PASM is task scheduling. The use of multiple FIFO queues for ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 17, Issue 12

Dec 1974

61 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/361604

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

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 ACM 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: 01 December 1974

Published in CACM Volume 17, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

478
Total Citations
View Citations
2,962
Total Downloads

Downloads (Last 12 months)228
Downloads (Last 6 weeks)26

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Shin JArroyo DTantawi AWang CYoussef ANagi R(2024)Cloud-native Workflow Scheduling using a Hybrid Priority Rule, Dynamic Resource Allocation, and Dynamic Task PartitionProceedings of the 2024 ACM Symposium on Cloud Computing10.1145/3698038.3698551(830-846)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3698038.3698551
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
Arias JOlarte CPetrucci LMaśko ŁPenczek WSidoruk T(2024)Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative ModelsIEEE Transactions on Reliability10.1109/TR.2024.335445973:2(861-875)Online publication date: Jun-2024
https://doi.org/10.1109/TR.2024.3354459
Zou XChen CLin PZhang LXu YZhang W(2024)Scalable Heterogeneous Scheduling Based Model Parallelism for Real-Time Inference of Large-Scale Deep Neural NetworksIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2024.33696288:4(2962-2973)Online publication date: Aug-2024
https://doi.org/10.1109/TETCI.2024.3369628
Dai YWang RDong YLu K(2024)Towards Highly Compatible I/O-Aware Workflow Scheduling on HPC SystemsProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC41406.2024.00031(1-15)Online publication date: 17-Nov-2024
https://dl.acm.org/doi/10.1109/SC41406.2024.00031
Papp PAnegg GKaranasiou AYzelman A(2024)Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary)2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00195(1169-1171)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00195
Sirisha DPrasad S(2024)CPTF–a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systemsCCF Transactions on High Performance Computing10.1007/s42514-024-00192-0Online publication date: 15-May-2024
https://doi.org/10.1007/s42514-024-00192-0
Shukla DSingh JMuthusamy SSatpathy SGoyal V(2024)RETRACTEDTransactions on Emerging Telecommunications Technologies10.1002/ett.468535:10Online publication date: 9-Oct-2024
https://dl.acm.org/doi/10.1002/ett.4685
Kou MGu JYao HWei SYin S(2023)TAEM 2.0: A Faster Transfer-Aware Effective Loop Mapping for Heterogeneous Resources on CGRAIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.322615242:8(2552-2565)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1109/TCAD.2022.3226152
Hu XBurgstaller BScholz B(2023)EVMTracer: Dynamic Analysis of the Parallelization and Redundancy Potential in the Ethereum Virtual MachineIEEE Access10.1109/ACCESS.2023.326727711(47159-47178)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3267277
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

List scheduling revisited

Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems

Task Scheduling on the PASM Parallel Processing System

Comments

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

List scheduling revisited

Analysis of Processor Allocation in Multiprogrammed, Distributed-Memory Parallel Processing Systems

Task Scheduling on the PASM Parallel Processing System

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations