The Community for Technology Leaders
Green Image
Issue No. 11 - November (1976 vol. 25)
ISSN: 0018-9340
pp: 1067-1073
K. Vairavan , Department of Electrical Engineering, University of Wisconsin-Milwaukee
The parallel scheduling of a partially ordered set of tasks has received great attention. The partially ordered tasks can be viewed as components of a straight-line program. In this note, we discuss some aspects of the nonpreemptive parallel scheduling of a program with more general control structures. We examine the existence of optimal k-processor schedules, and in line with recent interest in the complexity of computer computations and algorithms, we study the complexity of constructing optimal k-processor schedules. In particular we show that, for every k > 1, any algorithm that would yield an optimal k-processor schedule of a loop-free program, when such a schedule exists, will be of exponential-time complexity.
Complexity of scheduling, generalized scheduling, parallel computation, task systems with control structures.

R. Demillo and K. Vairavan, "On the Computational Complexity of a Generalized Scheduling Problem," in IEEE Transactions on Computers, vol. 25, no. , pp. 1067-1073, 1976.
90 ms
(Ver 3.3 (11022016))