Abstract | ||
---|---|---|
It is well-established that high-end scalability requires fine-grained locking, and for a system like Linux, a big lock degrades performance even at moderate core counts. Nevertheless, we argue that a big lock may be fine-grained enough for a microkernel designed to run on closely-coupled cores (sharing a cache), as with the short system calls typical for a well-designed microkernel, lock contention remains low under realistic loads. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1145/2797022.2797042 | APSys |
Field | DocType | Citations |
Computer science,Lock (computer science),Cache,Distributed lock manager,Microkernel,Compiler,Operating system kernel,Giant lock,Operating system,Scalability | Conference | 3 |
PageRank | References | Authors |
0.40 | 8 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sean Peters | 1 | 3 | 0.40 |
Adrian Danis | 2 | 11 | 1.24 |
K. Elphinstone | 3 | 1190 | 65.76 |
Gernot Heiser | 4 | 2525 | 137.42 |