Published December 1974
| public
Journal Article
A comparison of list schedules for parallel processing systems
- Creators
- Adam, Thomas L.
- Chandy, K. M.
- Dickson, J. R.
Chicago
An error occurred while generating the citation.
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.
Additional Information
© 1974 Association for Computing Machinery, Inc. Received April 1973; revised February 1974. This work was supported by NSF Grant GJ-35109. The authors would like to thank Professor Edward G. Coffman for his suggestions.Additional details
- Eprint ID
- 92231
- DOI
- 10.1145/361604.361619
- Resolver ID
- CaltechAUTHORS:20190111-160504256
- NSF
- GJ-35109
- Created
-
2019-01-12Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field