Pessimistic Software Lock-Elision
Read-write locks are one of the most prevalent lock forms in concurrent 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 n...
Main Authors: | Afek, Yehuda (Author), Matveev, Alexander (Author), Shavit, Nir N. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2014-10-10T13:09:02Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Amalgamated Lock-Elision
by: Afek, Yehuda, et al.
Published: (2020) -
Towards consistency oblivious programming
by: Afek, Yehuda, et al.
Published: (2012) -
Interrupting snapshots and the Java[superscript TM] size() method
by: Afek, Yehuda, et al.
Published: (2016) -
Nested pessimistic transactions for both atomicity and synchronization in concurrent software
by: Chammah, Tarek
Published: (2011) -
Pessimistic Bilevel Optimization
by: Wiesemann, Wolfram, et al.
Published: (2013)