By Topic

Performance evaluation of scheduling precedence-constrained computations on message-passing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Al-Mouhamed, M. ; Dept. of Comput. Eng., King Fahd Univ. of Pet. & Miner., Dhahran

Using knowledge on computation, communication, and multiprocessor topology, a class of global priority-based scheduling heuristics, called generalized list scheduling (GLS) is proposed. Task-priority is defined as the completion time of the task following backward scheduling 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 the communication, parallelism, and system topology. Analysis shows that local heuristics rely on locally maximizing the efficiency and gives acceptable solutions only when the parallelism is large enough to cover the communication (bounded speedup). GLS scheduling outperforms the local approaches versus change in parallelism, communication, and network topology. The time complexity of GLS heuristics is O(pn2), where p and n are the number of processors and that of the tasks, respectively

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:5 ,  Issue: 12 )