Compact DAG Representation and Its Dynam
✍
Michel Cosnard; Emmanuel Jeannot
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 355 KB
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-t