Scheduling multiprocessor tasks to minimize schedule length

Journal Article · Thu May 01 04:00:00 EDT 1986 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1986.1676781· OSTI ID:5791128

Blazewicz, J; Drabowski, M; Weglarz, J

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 the authors concentrate on the problem of nonpreemptive scheduling. In this case, polynomial-time algorithms exist only for unit processing times. The authors 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.

• Research Organization: Instytut Automatyki, Politechnika Poznanska
• OSTI ID: 5791128
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-35:5; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTERS
DATA PROCESSING
ELECTRONIC CIRCUITS
FUNCTIONS
LINEAR PROGRAMMING
MATHEMATICAL LOGIC
MICROELECTRONIC CIRCUITS
MICROPROCESSORS
POLYNOMIALS
PROCESSING
PROGRAMMING
TASK SCHEDULING
TIME DEPENDENCE