A comparison of list schedules for parallel processing systems-Reference-Cited by-同舟云学术

A comparison of list schedules for parallel processing systems

Published:1974-12 Issue:12 Volume:17 Page:685-690
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Adam Thomas L.¹,Chandy K. M.¹,Dickson J. R.¹

Affiliation:

1. Univ. of Texas at Austin, Austin

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/361604.361619

Reference11 articles.

1. Optimal Scheduling Strategies in a Multiprocessor System

2. Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules

Cited by 306 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Scalable Heterogeneous Scheduling Based Model Parallelism for Real-Time Inference of Large-Scale Deep Neural Networks;IEEE Transactions on Emerging Topics in Computational Intelligence;2024-08

2. Efficient Multi-Processor Scheduling in Increasingly Realistic Models;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

3. Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models;IEEE Transactions on Reliability;2024-06

4. Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary);2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2024-05-27

5. CPTF–a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systems;CCF Transactions on High Performance Computing;2024-05-15