Compact DAG Representation and its Symbolic Scheduling - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2004

Compact DAG Representation and its Symbolic Scheduling

Michel Cosnard
  • Function : Author
  • PersonId : 950781
Emmanuel Jeannot


Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for task graph execution on parallel machines. Such an approach cannot be adapted to changes in values of program parameters and the number of processors and it also cannot handle large task graphs. In this paper, we model parallel computation using parameterized task graphs which represent coarse-grain parallelism independent of the problem size. We present a symbolic scheduling algorithm for a parameterized task graph which first derives linear clusters and then assigns task clusters to processors. The runtime system executes clusters on each processor in a multi-threaded fashion. The experiments using various scientific computing kernel benchmarks show that our method delivers compact and symbolic schedules with performance highly competitive to static approaches.
Not file

Dates and versions

inria-00099958 , version 1 (26-09-2006)


  • HAL Id : inria-00099958 , version 1


Michel Cosnard, Emmanuel Jeannot, Tao Yang. Compact DAG Representation and its Symbolic Scheduling. Journal of Parallel and Distributed Computing, 2004, 64 (8), pp.921-935. ⟨inria-00099958⟩
99 View
0 Download


Gmail Facebook Twitter LinkedIn More