Fast and Effective Task Scheduling in Heterogeneous Systems

Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogeneous systems, these two algorithms, called FCP and FLB, have shown to yield a performance equivalent to other much more costly algorithms such as MCP and ETF. In this paper we present modified versions of FCP and FLB targeted to heterogeneous systems. We show that the modified versions yield a good overall performance, which is generally comparable to algorithms specifically designed for heterogeneous systems, such as HEFT or ERT. There are a few cases, mainly for irregular problems and large processor speed variance, where FCP and FLB’s performance drops down to ¿¾± and ¿±, respectively. Considering the good overall performance and their very low cost however, FCP and FLB are interesting options for scheduling very large problems on heterogeneous systems.

• Type: Conference
• Year: 2000
• Where: HCW
• Authors: Andrei Radulescu, Arjan J. C. van Gemund
• Keywords: Compile-time List Scheduling, Distributed And Parallel Computing, HCW 2000, Heterogeneous Systems, Modified Versions