 |
Conference papers
Random graph generation for scheduling simulations
Abstract : In parallel and distributed systems, validation of scheduling heuristics is usually done by simulation on randomly generated synthetic workloads, typically represented by task graphs. Since there is no single generation method that models all possible workloads for scheduling problems, researchers often re-implement the classical generation algorithms or even implement ad-hoc ones. A bad choice of generation method can mislead the validation of the algorithm due to biases it can induce. Moreover, different implementations of the same randomized generation method may produce slightly different graphs. These problems can harm the experimental comparison of scheduling algorithms. In order to provide a comparison basis we propose GGen -- a unified and standard implementation of classical task graph generation methods used in the scheduling domain. We also provide an in-depth analysis of each generation method, emphasizing important graph properties that may influence scheduling algorithms.
Cited literature [16 references]
https://hal.archives-ouvertes.fr/hal-00471255
Contributor : Grégory Mounié <>
Submitted on : Thursday, April 8, 2010 - 2:40:24 PM
Last modification on : Tuesday, February 9, 2021 - 3:24:21 PM
Long-term archiving on: : Wednesday, November 30, 2016 - 5:04:03 PM
Contributor : Grégory Mounié <>
Submitted on : Thursday, April 8, 2010 - 2:40:24 PM
Last modification on : Tuesday, February 9, 2021 - 3:24:21 PM
Long-term archiving on: : Wednesday, November 30, 2016 - 5:04:03 PM
File
ggen.pdf
Files produced by the author(s)