Random graph generation for scheduling simulations

Daniel Cordeiro 1, 2 Grégory Mounié 1, 2 Swann Pérarnau 1, 2 Denis Trystram 1, 2 Jean-Marc Vincent 2, 3 Frédéric Wagner 1, 2
1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 LIG - Laboratoire d'Informatique de Grenoble
3 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Keywords : random graph generation direct acyclic graph scheduling toolkit
Type de document :
Communication dans un congrès
3rd International ICST Conference on Simulation Tools and Techniques (SIMUTools 2010), Mar 2010, Malaga, Spain. ICST, pp.10, 2010
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger
https://hal.archives-ouvertes.fr/hal-00471255
Contributeur : Grégory Mounié <>
Soumis le : jeudi 8 avril 2010 - 14:40:24
Dernière modification le : lundi 18 octobre 2010 - 16:41:02
Document(s) archivé(s) le : mercredi 30 novembre 2016 - 17:04:03

Fichier

ggen.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00471255, version 2

Collections

INRIA | LIG | LIG_SRCPR_MOAIS | UGA | LIG_SRCPR

Citation

Daniel Cordeiro, Grégory Mounié, Swann Pérarnau, Denis Trystram, Jean-Marc Vincent, et al.. Random graph generation for scheduling simulations. 3rd International ICST Conference on Simulation Tools and Techniques (SIMUTools 2010), Mar 2010, Malaga, Spain. ICST, pp.10, 2010. 〈hal-00471255v2〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de
la notice

403

Téléchargements du document

392

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD