This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Scheduling Strategies in a Multiprocessor System
February 1972 (vol. 21 no. 2)
pp. 137-146
C. V. Ramamoorthy, Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712.
K. M. Chandy, Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712.
Mario J. Gonzalez, Department of Computer Sciences, University of Texas at Austin, Austin, Tex. 78712.
This paper describes a set of techniques that can be used to optimally schedule a sequence of interrelated computational tasks on a multiprocessor computer system. Using a directed graph model to represent a computational process, two basic problems are solved here. First, given a set of computational tasks and the relationships between them, the tasks are scheduled such that the total execution time is minimized, and the minimum number of processors required to realize this schedule is obtained. The second problem is of a more general nature. Given k processors, the tasks are scheduled such that execution time is again minimized. Consideration is given to tasks of equal and unequal duration, and task preemption is not allowed.
Citation:
C. V. Ramamoorthy, K. M. Chandy, Mario J. Gonzalez, "Optimal Scheduling Strategies in a Multiprocessor System," IEEE Transactions on Computers, vol. 21, no. 2, pp. 137-146, Feb. 1972, doi:10.1109/TC.1972.5008918
Usage of this product signifies your acceptance of the Terms of Use.