Multicore Locks: The Case Is Not Closed Yet - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Multicore Locks: The Case Is Not Closed Yet


NUMA multicore machines are pervasive and many multithreaded applications are suffering from lock contention. To mitigate this issue, application and library developers can choose from the plethora of optimized mutex lock algorithms that have been designed over the past 25 years. Unfortunately, there is currently no broad study of the behavior of these optimized lock algorithms on realistic applications. In this paper, we fill this gap. We perform a performance study of 19 state-of-the-art mutex lock algorithms on 36 realistic applications. Our study shows that regarding locking on multicore machines, the case is not closed yet. Indeed, our conclusions include the following findings: (i) no single lock is the best for more than 50% of the studied workloads; (ii) every lock is harmful for several applications, even if the application parallelism is properly tuned; (iii) for several applications, the optimal lock changes when varying the number of applications or the workload. These findings call for further research on optimized lock algorithms and dynamic adaptation of contention management.
Fichier principal
Vignette du fichier
atc16_paper-guiroux.pdf (355.96 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-01486527 , version 1 (10-03-2017)


  • HAL Id : hal-01486527 , version 1


Hugo Guiroux, Renaud Lachaize, Vivien Quéma. Multicore Locks: The Case Is Not Closed Yet. 2016 USENIX Annual Technical Conference (USENIX ATC 16), Jun 2016, Denver, United States. pp.649-662. ⟨hal-01486527⟩
163 View
232 Download


Gmail Facebook Twitter LinkedIn More