Scheduling tasks with nonuniform deadlines on two processors (1976)
| Venue: | Journal of the ACM |
| Citations: | 19 - 0 self |
BibTeX
@ARTICLE{Garey76schedulingtasks,
author = {M. R. Garey and D. S. Johnson},
title = {Scheduling tasks with nonuniform deadlines on two processors},
journal = {Journal of the ACM},
year = {1976},
volume = {23},
pages = {461--467}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT. Given a set ~ = {T1,T~,...,T.} of tasks, with each T, having execution time 1 and a deadline d,> 0, and a set of precedence constraints which restrict allowable schedules, the problem of determining whether there exists a schedule using two processors in which each task is completed before its deadline is examined. An efficient algorithm for finding such a schedule, whenever one exists, is given. The algorithm may also be used to find the shortest such schedule In addition it is shown that the problem of finding a one-processor schedule which mimmizes the number of tasks failing to meet their deadlines is NP-complete and, hence, is hkely to be computationally intractable KEY WORDS AND PHRASES ' multiprocessor systems, task sequencing, scheduling algorithms, NP-complete problems CR CATEGOmSS: 4 32, 5.39, 8.3 1.
