A parallel algorithm for preemptive scheduling of uniform machines
Journal Article
·
· J. Parallel Distrib. Comput.; (United States)
The authors describe a fast parallel algorithm for preemptive scheduling of n independent jobs on m uniform machines. Each job has a processing requirement, and each machine processes jobs at a different rate. The goal of the scheduling algorithm is to find a schedule which minimizes the time at which the last job is completed. The authors develop a parallel version of this algorithm for a Concurrent Road Exclusive Write (CREW) shared memory computer. The algorithm runs in O(log n + log/sup 3/m) time using n processors.
- Research Organization:
- California Univ., Berkeley, CA (USA). Structural Engineering Lab.
- OSTI ID:
- 5698743
- Journal Information:
- J. Parallel Distrib. Comput.; (United States), Journal Name: J. Parallel Distrib. Comput.; (United States) Vol. 5:6; ISSN JPDCE
- Country of Publication:
- United States
- Language:
- English
Similar Records
Preemptive scheduling of a multiprocessor system with memories to minimize maximum lateness
Parallel job-scheduling algorithms
Randomized parallel speedups for list ranking
Journal Article
·
Wed Oct 31 23:00:00 EST 1984
· SIAM J. Comput.; (United States)
·
OSTI ID:5914700
Parallel job-scheduling algorithms
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:5457809
Randomized parallel speedups for list ranking
Journal Article
·
Mon Jun 01 00:00:00 EDT 1987
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6225065