Scheduling as a graph transformation

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

Citing 4
Cited 0

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

Journal of the ACM (JACM)
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scheduling of a set of tasks, with precedence constraints and known execution times, into a set of identical processors is considered. Optimal scheduling of these tasks implies utilizing a minimum number of processors to satisfy a deadline, or finishing in minimal time using a fixed number of processors. This process can be seen as a transformation of the original graph into another graph, whose precedences do not violate the optimality constraints and has a unique basic schedule. Analysis of this transformation provides insight into the scheduling process and also into the determination of lower bounds on the number of processors and on time for optimal schedules.