Name
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 schedulers 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.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3342195.3387544 | EuroSys '20: Fifteenth EuroSys Conference 2020
Heraklion
Greece
April, 2020 |
Keywords | DocType | ISBN |
scheduling, formal verification, Linux | Conference | 978-1-4503-6882-7 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
10 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baptiste Lepers | 1 | 0 | 1.01 |
| Redha Gouicem | 2 | 0 | 1.35 |
| Damien Carver | 3 | 0 | 1.69 |
| Jean-Pierre Lozi | 4 | 111 | 7.13 |
| Nicolas Palix | 5 | 182 | 13.20 |
| Maria-Virginia Aponte | 6 | 0 | 0.34 |
| Willy Zwaenepoel | 7 | 5651 | 813.97 |
| Julien Sopena | 8 | 140 | 18.04 |
| Julia Lawall | 9 | 0 | 0.34 |
| Gilles Muller | 10 | 852 | 55.95 |