Optimistic Concurrency with OPTIK

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to implement the OPTIK pattern using the novel concept of OPTIK locks. These locks enable the use of version numbers for implementing very efficient optimistic concurrent data structures. Existing state-of-the-art lock-based data structures acquire the lock and then check for conflicts. In contrast, with OPTIK locks, we merge the lock acquisition with the detection of conflicting concurrency in a single atomic step, similarly to lock-free algorithms. We illustrate the power of our OPTIK pattern and its implementation by introducing four new algorithms and by optimizing four state-of-the-art algorithms for linked lists, skip lists, hash tables, and queues. Our results show that concurrent data structures built using OPTIK are more scalable than the state of the art.


Publié dans:
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16
Présenté à:
21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16, Barcelona, Spain, 12-16 03 2016
Année
2016
Publisher:
New York, New York, USA, ACM Press
Mots-clefs:
Laboratoires:




 Notice créée le 2016-03-08, modifiée le 2019-03-17

Publisher's version:
Télécharger le documentPDF
Liens externes:
Télécharger le documentURL
Télécharger le documentURL
Télécharger le documentURL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)