Brief Announcement: Performance Prediction for Coarse-Grained Locking - Archive ouverte HAL Access content directly
Conference Papers Year :

Brief Announcement: Performance Prediction for Coarse-Grained Locking

(1, 2) , (3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
main.pdf (676.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01887733 , version 1 (04-10-2018)

Identifiers

Cite

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⟩
110 View
206 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More