This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
December 1975 (vol. 24 no. 12)
pp. 1235-1238
W.H. Kohler, Department of Electrical and Computer Engineering, University of Massachusetts
The problem of scheduling tasks on a system of independent identical processors is discussed and the performance of a suboptimal method is evaluated. The computation is modeled by an acyclic directed graph G(T,<), where node set T represents the set of tasks to be completed and edge set < defines the precedence between tasks. The objective is to minimize the finishing time of the computation graph
Index Terms:
Acyclic directed graph model, branch-and-bound algorithm, critical path priority method, multiprocessor scheduling.
Citation:
W.H. Kohler, "A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems," IEEE Transactions on Computers, vol. 24, no. 12, pp. 1235-1238, Dec. 1975, doi:10.1109/T-C.1975.224171
Usage of this product signifies your acceptance of the Terms of Use.