DMCA
Pessimistic software lock-elision (2012)
| Venue: | In Proceedings of the 26th International Conference on Distributed Computing, DISC’12 |
| Citations: | 6 - 2 self |
BibTeX
@INPROCEEDINGS{Afek12pessimisticsoftware,
author = {Yehuda Afek and Er Matveev and Nir Shavit},
title = {Pessimistic software lock-elision},
booktitle = {In Proceedings of the 26th International Conference on Distributed Computing, DISC’12},
year = {2012},
pages = {297311},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Read-write locks are one of the most prevalent lock forms in concur-rent applications because they allow read accesses to locked code to proceed in parallel. However, they do not offer any parallelism between reads and writes. This paper introduces pessimistic lock-elision (PLE), a new approach for non-speculatively replacing read-write locks with pessimistic (i.e. non-aborting) soft-ware transactional code that allows read-write concurrency even for contended code and even if the code includes system calls. On systems with hardware trans-actional support, PLE will allow failed transactions, or ones that contain system calls, to preserve read-write concurrency. Our PLE algorithm is based on a novel encounter-order design of a fully pes-simistic STM system that in a variety of benchmarks spanning from counters to trees, even when up to 40 % of calls are mutating the locked structure, provides up to 5 times the performance of a state-of-the-art read-write lock.
Keyphrases
pessimistic software lock-elision read-write concurrency read-write lock hardware trans-actional support soft-ware transactional code novel encounter-order design prevalent lock form pessimistic lock-elision state-of-the-art read-write lock ple algorithm pes-simistic stm system new approach read access locked structure failed transaction concur-rent application
