- Author:
- Susan Hatcher Rodger,
- Major Professor:
- Greg N. Frederickson
In this thesis, we consider solving job scheduling problems on the CREW PRAM model. We show how to adapt Cole's pipeline merge technique to yield several efficient parallel algorithms for a number of job scheduling problems and one optimal parallel algorithm for the following job scheduling problem: Given a set of n jobs defined by release times, deadlines and processing times, find a schedule that minimizes the maximum lateness of the jobs and allows preemption when the jobs are scheduled to run on one machine. In addition, we present the first NC algorithm for the following job scheduling problem: Given a set of n jobs defined by release times, deadlines and unit processing times, determine if there is a schedule of jobs on one machine, and calculate the schedule if it exists. We identify the notion of a canonical schedule, which is the type of schedule our algorithm computes if there is a schedule. Our algorithm runs in O((log $n)\sp{2}$) time and uses O($n\sp{2}k\sp{2}$) processors, where k is the minimum number of distinct offsets of release times or deadlines.
Recommendations
Parallel Scheduling Algorithms
<P>Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish ...
Moldable parallel job scheduling using job efficiency: an iterative approach
JSSPP'06: Proceedings of the 12th international conference on Job scheduling strategies for parallel processingCurrently, job schedulers require "rigid" job submissions from users, who must specify a particular number of processors for each parallel job. Most parallel jobs can be run on different processor partition sizes, but there is often a trade-off between ...