Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Reducing Global Schedulers' Complexity Through Runtime System Decoupling

Abstract : 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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

Contributor : Laércio Lima Pilla Connect in order to contact the contributor
Submitted on : Thursday, September 13, 2018 - 1:15:26 PM
Last modification on : Friday, February 4, 2022 - 3:24:40 AM
Long-term archiving on: : Friday, December 14, 2018 - 2:34:58 PM


Files produced by the author(s)


  • HAL Id : hal-01873526, version 1


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⟩



Record views


Files downloads