FLB: Fast Load Balancing for Distributed-Memory Machines

This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list scheduling heuristics, FLB drastically reduces scheduling time complexity to Ǵ

• Type: Conference
• Year: 1999
• Where: ICPP
• Authors: Andrei Radulescu, Arjan J. C. van Gemund
• Keywords: Distributed And Parallel Computing, ICPP 1999, Scheduling Algorithm, Task Graph, Task Scheduling Algorithm