Name
Title | ||
|---|---|---|
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring |
Abstract | ||
|---|---|---|
We study the problem of scheduling independent multiprocessor tasks, where for each task in addition to the processing time(s) there is a prespecified dedicated subset (or a family of alternative subsets) of processors which are required to process the task simultaneously. Focusing on problems where all required (alternative) subsets of processors have the same fixed cardinality, we present complexity results for computing preemptive schedules with minimum makespan closing the gap between computationally tractable and intractable instances. In particular, we show that for the dedicated version of the problem, optimal preemptive schedules of bi-processor tasks (i.e. tasks whose dedicated processor sets are all of cardinality two) can be computed in polynomial time. We give various extensions of this result including one to maximum lateness minimization with release times and due dates. All these results are based on a nice relation between preemptive scheduling and fractional coloring of graphs. In contrast to the positive results, we also prove that the problems of computing optimal preemptive schedules for three-processor tasks or for bi-processor tasks with (possible several) alternative modes are strongly NP-hard. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44612-5_40 | MFCS |
Keywords | Field | DocType |
preemptive scheduling,alternative subsets,alternative mode,preemptive schedule,optimal preemptive schedule,bi-processor task,fractional graph coloring,dedicated version,prespecified dedicated subset,dedicated processors,fixed cardinality,dedicated processor set,graph coloring | Fixed-priority pre-emptive scheduling,Mathematical optimization,Job shop scheduling,Fractional coloring,Computer science,Scheduling (computing),Cardinality,Schedule,Time complexity,Graph coloring | Conference |
ISBN | Citations | PageRank |
3-540-67901-4 | 3 | 0.43 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus Jansen | 1 | 789 | 82.68 |
| Lorant Porkolab | 2 | 271 | 21.28 |