|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Scheduling Multiprocessor Tasks to Minimize Schedule Length
May 1986 (vol. 35 no. 5)
pp. 389-393
| ASCII Text | x | ||
| J. Blazewicz, M. Drabowski, J. Weglarz, "Scheduling Multiprocessor Tasks to Minimize Schedule Length," IEEE Transactions on Computers, vol. 35, no. 5, pp. 389-393, May, 1986. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1986.1676781, author = {J. Blazewicz and M. Drabowski and J. Weglarz}, title = {Scheduling Multiprocessor Tasks to Minimize Schedule Length}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {5}, issn = {0018-9340}, year = {1986}, pages = {389-393}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676781}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Scheduling Multiprocessor Tasks to Minimize Schedule Length IS - 5 SN - 0018-9340 SP389 EP393 EPD - 389-393 A1 - J. Blazewicz, A1 - M. Drabowski, A1 - J. Weglarz, PY - 1986 KW - scheduling multiprocessor tasks KW - Complexity analysis KW - deterministic scheduling KW - linear programming approach KW - microprocessor systems KW - polynomial-in-time algorithms KW - preemptive and nonpreemptive schedules KW - schedule length criterion VL - 35 JA - IEEE Transactions on Computers ER - | |||
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its impact on the complexity of minimizing schedule length is studied. First we concentrate on the problem of nonpreemptive scheduling. In this case, polynomial-time algorithms exist only for unit processing times. We present two such algorithms of complexity O(n) for scheduling tasks requiring an arbitrary number of processors between 1 and k at a time where k is a fixed integer. The case for which k is not fixed is shown to be NP-complete. Next, the problem of preemptive scheduling of tasks of arbitrary length is studied. First an algorithm for scheduling tasks requiring one or k processors is presented. Its complexity depends linearly on the number of tasks. Then, the possibility of a linear programming formulation for the general case is analyzed.
Index Terms:
scheduling multiprocessor tasks, Complexity analysis, deterministic scheduling, linear programming approach, microprocessor systems, polynomial-in-time algorithms, preemptive and nonpreemptive schedules, schedule length criterion
Citation:
J. Blazewicz, M. Drabowski, J. Weglarz, "Scheduling Multiprocessor Tasks to Minimize Schedule Length," IEEE Transactions on Computers, vol. 35, no. 5, pp. 389-393, May 1986, doi:10.1109/TC.1986.1676781
Usage of this product signifies your acceptance of the Terms of Use.