Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs

  title={Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs},
  author={Michel Cosnard and Emmanuel Jeannot and Laurence Rougeot},
Scheduling large task graphs is an important issue in parallel computing since it allows to treat big size problems. In this paper we address the following problem: how to schedule a task graph, when it is too large to fit into memory? Our answer introduces the parameterized task graph (PTG), which is a symbolic representation of the task graph. We propose a dynamic scheduling algorithm which takes the PTG as an entry, and allows to generate a generic program. Performances of the method are… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 24 references

Construction et exécution de graphe de tâches acycliques à gros grain

M. Loi
PhD thesis, Ecole Normale Supérieure de Lyon, France, • 1996
View 8 Excerpts
Highly Influenced

Theory of linear and integer programming

Wiley-Interscience series in discrete mathematics and optimization • 1999
View 1 Excerpt

Automatic Coarse-Grained Parallelization Techniques

M. Cosnard, E. Jeannot
In Grandinetti and Kowalik, editor, NATO workshop : Advances in High Performance Computing. Kluwer academic Publishers, • 1997
View 2 Excerpts

Similar Papers

Loading similar papers…