Skip to Main content Skip to Navigation
Conference papers

Brief Announcement: Performance Prediction for Coarse-Grained Locking

Abstract : A standard design pattern found in many concurrent data structures , such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Vitalii Aksenov Connect in order to contact the contributor
Submitted on : Thursday, October 4, 2018 - 4:28:22 PM
Last modification on : Monday, October 3, 2022 - 4:26:04 PM
Long-term archiving on: : Saturday, January 5, 2019 - 2:49:00 PM


Files produced by the author(s)



Vitalii Aksenov, Dan Alistarh, Petr Kuznetsov. Brief Announcement: Performance Prediction for Coarse-Grained Locking. PODC 2018 - ACM Symposium on Principles of Distributed Computing, Jul 2018, Egham, United Kingdom. ⟨10.1145/3212734.3212785⟩. ⟨hal-01887733⟩



Record views


Files downloads