Name
Abstract | ||
|---|---|---|
The problem to be considered is one of scheduling nonpreemptable tasks in multiprocessor systems when tasks need for their processing processors and other limited resources, and when mean flow time is the system performance measure. For each task the time required for its processing and the amount of each resource which it requires, are given. Special attention is paid to the computational complexity of algorithms for determining the optimal schedules for different assumptions concerning the environment. For the case of scheduling independent, arbitrary length tasks when each task may require a unit of an additional resource of one type, an O(n3) algorithm is given. For more complicated resource requirements, however, it is proved that the problem under consideration is NP-hard in the strong sense, even for the case of two processors. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/BF00263292 | Acta Inf. |
Keywords | Field | DocType |
Computational Complexity,Information Theory,Computational Mathematic,Computer System,System Organization | Information theory,Mean flow,Multiprocessor scheduling,Scheduling (computing),Computer science,Multiprocessing,Schedule,Computational resource,Distributed computing,Computational complexity theory | Journal |
Volume | Issue | ISSN |
24 | 5 | 0001-5903 |
Citations | PageRank | References |
5 | 0.57 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacek Blazewicz | 1 | 1064 | 154.23 |
| Wieslaw Kubiak | 2 | 540 | 62.61 |
| H. Röck | 3 | 5 | 0.57 |
| Jayme Luiz Szwarcfiter | 4 | 618 | 95.79 |