Issue No. 05 - May (1986 vol. 35)
J. Blazewicz , Instytut Automatyki, Politechnika Poznanska
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.
scheduling multiprocessor tasks, Complexity analysis, deterministic scheduling, linear programming approach, microprocessor systems, polynomial-in-time algorithms, preemptive and nonpreemptive schedules, schedule length criterion
J. Weglarz, M. Drabowski and J. Blazewicz, "Scheduling Multiprocessor Tasks to Minimize Schedule Length," in IEEE Transactions on Computers, vol. 35, no. , pp. 389-393, 1986.