The Community for Technology Leaders
Green Image
<p>Using knowledge on computation, communication, and multiprocessor topology, a class of global priority-based scheduling heuristics, called generalized list scheduling (GLS) isproposed. Task-priority is defined as the completion time of the task following backwardscheduling the computation over the multiprocessor by using the best local heuristic. GLS scheduling consists of using the task-priority in forward, graph-driven scheduling.Evaluation of local (ETF) and GLS heuristics is carried out by altering over thecommunication, parallelism, and system topology. Analysis shows that local heuristics rely on locally maximizing the efficiency and gives acceptable solutions only when theparallelism is large enough to cover the communication (bounded speedup). GLSscheduling outperforms the local approaches versus change in parallelism, communication, and network topology. The time complexity of GLS heuristics is O(pn/sup 2/), where p and n are the number of processors and that of the tasks, respectively.</p>
Index Termsperformance evaluation; computational complexity; scheduling; message passing;performance evaluation; scheduling precedence-constrained computations;message-passing systems; multiprocessor topology; global priority-based schedulingheuristics; generalized list scheduling; backward scheduling; multiprocessor; graph-driven scheduling; network topology; time complexity

A. Al-Maasarani and M. Al-Mouhamed, "Performance Evaluation of Scheduling Precedence-Constrained Computations on Message-Passing Systems," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1317-1321, 1994.
94 ms
(Ver 3.3 (11022016))