Provable Multicore Schedulers with Ipanema: Application to Work Conservation - Archive ouverte HAL Access content directly
Conference Papers Year :

Provable Multicore Schedulers with Ipanema: Application to Work Conservation

(1) , (2) , (2) , (3) , (4) , (2, 5) , (1) , (6) , (2) , (2)
1
2
3
4
5
6

Abstract

Recent research and bug reports have shown that work conservation , the property that a core is idle only if no other core is overloaded, is not guaranteed by Linux's CFS or FreeBSD's ULE multicore schedulers. Indeed, multicore schedulers are challenging to specify and verify: they must operate under stringent performance requirements, while handling very large numbers of concurrent operations on threads. As a consequence, the verification of correctness properties of schedulers has not yet been considered. In this paper, we propose an approach, based on a domain-specific language and theorem provers, for developing sched-ulers with provable properties. We introduce the notion of concurrent work conservation (CWC), a relaxed definition of work conservation that can be achieved in a concurrent system where threads can be created, unblocked and blocked concurrently with other scheduling events. We implement several scheduling policies, inspired by CFS and ULE. We show that our schedulers obtain the same level of performance as production schedulers, while concurrent work conservation is satisfied.
Fichier principal
Vignette du fichier
paper.pdf (989.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02554342 , version 1 (25-04-2020)

Identifiers

Cite

Baptiste Lepers, Redha Gouicem, Damien Carver, Jean-Pierre Lozi, Nicolas Palix, et al.. Provable Multicore Schedulers with Ipanema: Application to Work Conservation. Eurosys 2020 - European Conference on Computer Systems, Apr 2020, Heraklion / Virtual, Greece. ⟨10.1145/3342195.3387544⟩. ⟨hal-02554342⟩
199 View
791 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More