Reducing Global Schedulers' Complexity Through Runtime System Decoupling - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Reducing Global Schedulers' Complexity Through Runtime System Decoupling

Résumé

Global schedulers are components used in parallel solutions, specially in dynamic applications, to optimize resource usage. Nonetheless, their development is a cumbersome process due to necessary adaptations to cope with the programming interfaces and abstractions of runtime systems. This paper proposes a model to dissociate sched-ulers from runtime systems to lower software complexity. Our model is based on the scheduler breakdown into modular and reusable concepts that better express the scheduler requirements. Through the use of meta-programming and design patterns, we were able to achieve fully reusable workload-aware scheduling strategies with up to 63% fewer lines of code with negligible run time overhead.
Fichier principal
Vignette du fichier
mogs.pdf (510.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01873526 , version 1 (13-09-2018)

Identifiants

  • HAL Id : hal-01873526 , version 1

Citer

Alexandre Santana, Vinicius Freitas, Marcio Castro, Laércio Lima Pilla, Jean-François Méhaut. Reducing Global Schedulers' Complexity Through Runtime System Decoupling. WSCAD 2018 - XIX Simpósio de Sistemas Computacionais de Alto Desempenho, Oct 2018, São Paulo, Brazil. pp.1-12. ⟨hal-01873526⟩
227 Consultations
170 Téléchargements

Partager

Gmail Facebook X LinkedIn More