The Community for Technology Leaders
Green Image
Issue No. 12 - December (1975 vol. 24)
ISSN: 0018-9340
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
Acyclic directed graph model, branch-and-bound algorithm, critical path priority method, multiprocessor scheduling.

W. Kohler, "A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems," in IEEE Transactions on Computers, vol. 24, no. , pp. 1235-1238, 1975.
91 ms
(Ver 3.3 (11022016))