Computation of lower bounds for multiprocessor schedules

Authors:
E. B. Fernández;T. Lang
Affiliations:
IBM Scientific Center, Los Angeles, CA;Computer Science Department, University of California, Los Angeles, CA
Venue:
IBM Journal of Research and Development
Year:
1975

Citing 6
Cited 1

A comparison of list schedules for parallel processing systems

Communications of the ACM
The ILLIAC IV Computer

IEEE Transactions on Computers
ILLIAC IV Software and Application Programming

IEEE Transactions on Computers
Bounds on multiprocessing anomalies and related packing algorithms

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Optimal Scheduling Strategies in a Multiprocessor System

IEEE Transactions on Computers
Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules

IEEE Transactions on Computers

The effect of operation scheduling on the performance of a data flow computer

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

A multiprocessing system composed of identical units is considered. This system is executing a set of partially ordered tasks, with known execution times, using a non-preemptive scheduling strategy. Lower bounds on the number of processors required to compute the tasks before a deadline, and on the minimum time to execute the tasks with a fixed number of processors, are of great value for the determination of the corresponding optimal schedules. In this paper, methods for the efficient computation of the lower bounds obtained by Fernindez and Bussell are discussed. Computational improvements for the case of general partial orders are reported, and further reductions of the number of operations are shown to be possible for special graphs (trees, independent chains, independent tasks).