Compact DAG Representation and Its Dynamic Scheduling

✍ Scribed by Michel Cosnard; Emmanuel Jeannot

• Publisher: Elsevier Science
• Year: 1999
• Tongue: English
• Weight: 355 KB
• Volume: 58
• Category: Article
• ISSN: 0743-7315
• DOI: 10.1006/jpdc.1999.1566

✦ Synopsis

Scheduling large task graphs is an important issue in parallel computing. In this paper we tackle the two following problems: (1) how to schedule a task graph, when it is too large to fit into memory? (2) How to build a generic program such that parameter values of a task graph can be given at run-time? Our answers feature the parameterized task graph (PTG), which is a symbolic representation of the task graph. We propose a dynamic scheduling algorithm which takes a PTG as an entry and allows us to generate a generic program. We present a theoretical study which shows that our algorithm finds good schedules for coarse-grain task graphs, has a low memory cost, and a low computational complexity. When the average number of operations of each task is large enough, we prove that the scheduling overhead is negligible with respect to the makespan. We also provide experimental results that demonstrate the feasibility of our approach using several compute-intensive kernels found in numerical scientific applications.