Name
Abstract | ||
|---|---|---|
We study the problem of scheduling periodic-time-critical tasks on multiprocessor computing systems. A periodic-time-critical task consists of an infinite number of requests, each of which has a prescribed deadline. The scheduling problem is to specify an order in which the requests of a set of tasks are to be executed and the processor to be used, with the goal of meeting all the deadlines with a minimum number of processors. Since the problem of determining the minimum number of processors is difficult, we consider two heuristic algorithms. These are easy to implement and yield a number of processors that is reasonably close to the minimum number. We also analyze the worst-case behavior of these heuristics. |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1287/opre.26.1.127 | Operations Research |
Field | DocType | Volume |
Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Two-level scheduling,Least slack time scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Distributed computing | Journal | 26 |
Issue | ISSN | Citations |
1 | 0030-364X | 254 |
PageRank | References | Authors |
67.90 | 1 | 2 |