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...
Main Authors: | Afek, Yehuda, Matveev, Alexander, Shavit, Nir N. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2014
|
Online Access: | http://hdl.handle.net/1721.1/90880 https://orcid.org/0000-0002-4552-2414 |
Similar Items
-
Amalgamated Lock-Elision
by: Afek, Yehuda, et al.
Published: (2020) -
Interrupting snapshots and the Java[superscript TM] size() method
by: Afek, Yehuda, et al.
Published: (2016) -
Towards consistency oblivious programming
by: Afek, Yehuda, et al.
Published: (2012) -
Pessimistic Bilevel Optimization
by: Wiesemann, Wolfram, et al.
Published: (2013) -
Effects of optimism on defensive pessimists.
by: Lin, Minghan.
Published: (2009)