Sciweavers

Share
IPPS
1999
IEEE

LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems

9 years 3 months ago
LLB: A Fast and Effective Scheduling Algorithm for Distributed-Memory Systems
This paper presents a new algorithm called List-based Load Balancing (LLB) for compile-time task scheduling on distributed-memory machines. LLB is intended as a cluster-mapping and task-ordering step in the multi-step class of scheduling algorithms. Unlike current multistep approaches, LLB integrates cluster-mapping and taskordering in a single step. The benefits of this integration are twofold. First, it allows dynamic load balancing in time, because only the ready tasks are considered in the mapping process. Second, communication is also considered, as opposed to algorithms like WCM and GLB. The algorithm has a low time complexity of Ǵ
Andrei Radulescu, Arjan J. C. van Gemund, Hai-Xian
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors Andrei Radulescu, Arjan J. C. van Gemund, Hai-Xiang Lin
Comments (0)
books