Abstract
In this paper we present several new results in the theory of homogeneous multiprocessor scheduling. We start with some assumptions about the behavior of tasks, with associated precedence constraints, as processor power is applied. We assume that as more processors are applied to a task, the time taken to compute it decreases, yielding some speedup. Because of communication, synchronization, and task scheduling overhead, this speedup increases less than linearly with the number of processors applied. We also assume that the number of processors which can be assigned to a task is a continuous variable, with a view to exploiting continuous mathematics. The optimal scheduling problem is to determine the number of processors assigned to each task, and task sequencing, to minimize the finishing time.
These assumptions allow us to recast the optimal scheduling problem in a form which can be addressed by optimal control theory. Various theorems can be proven which characterize the optimal scheduling solution. Most importantly, for the special case where the speedup function of each task isp α, wherep is the amount of processing power applied to the task, we can directly solve our equations for the optimal solution. In this case, for task graphs formed from parallel and series connections, the solution can be derived by inspection. The solution can also be shown to be shortest path from the initial to the final state, as measured by anl 1/α distance metric, subject to obstacle constraints imposed by the precedence constraints.
Similar content being viewed by others
References
M. Blazewicz, J. Drabowski, and J. Welgarz. Scheduling multiprocessor tasks to minimise schedule length.IEEE Trans. Comput. 35(5):389–393, 1986.
Bryson and Ho.Applied Optimal Control. Halstead Press, New York, 1975.
E. F. Coffman, Jr., editor.Computer and Job Shop Scheduling Theory. Wiley, New York, 1976.
J. Du and J. Y. T. Leung. Complexity of scheduling parallel task systems.SIAM J. Discrete Math., 2(4):473–487, November 1989.
C. C. Han and K. J. Lin. Scheduling parallelizable jobs on multiprocessors.Proc. IEEE Conf. on Real-Time Systems, 1989, pp. 59–67.
W. Ludwig and P. Tiwari. Scheduling malleable and nonmalleable parallel tasks.Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 167–176.
G. N. S. Prasanna, A. Agarwal, and B. R. Musicus. Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory.IEEE Trans. Parallel and Distributed Systems, July 1994, pp. 720–736.
G. N. Prasanna. Structure Driven Multiprocessor Compilation of Numeric Problems. Technical Report MIT/LCS/TR-502, Laboratory for Computer Science, Massachusetts Institute of Technology, April 1991.
V. Sarkar. Partitioning and Scheduling Programs for Multiprocessors. Ph.D. Thesis. Technical Report CSL-TR-87-328, Computer Systems Laboratory, Stanford University, April 1987.
Author information
Authors and Affiliations
Additional information
Communicated by F. T. Leighton.
This research has been funded in part by the Advanced Research Project Agency monitored by ONR under Grant No. N00014-89-J-1489, in part by Draper Laboratory, in part by DARPA Contract No. N00014-87-K-0825, and in part by NSF Grant No. MIP-9012773. The first author is now with AT&T Bell Laboratories and the second author is with BBN Incorporated.
Rights and permissions
About this article
Cite this article
Srinivasa Prasanna, G.N., Musicus, B.R. The optimal control approach to generalized multiprocessor scheduling. Algorithmica 15, 17–49 (1996). https://doi.org/10.1007/BF01942605
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01942605