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.
Type de document :
Communication dans un congrès
PODC 2018 - ACM Symposium on Principles of Distributed Computing, Jul 2018, Egham, United Kingdom. 〈10.1145/3212734.3212785〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01887733
Contributeur : Vitalii Aksenov <>
Soumis le : jeudi 4 octobre 2018 - 16:28:22
Dernière modification le : vendredi 5 octobre 2018 - 16:32:11

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

39

Téléchargements de fichiers

18