Results 1 - 2 of 2

Pessimistic software lock-elision

by Yehuda Afek, Er Matveev, Nir Shavit - In Proceedings of the 26th International Conference on Distributed Computing, DISC’12 , 2012
"... 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 app ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
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

WTTM 2012, The Fourth Workshop on the Theory of Transactional Memory

by Vincent Gramoli , Alessia Milani
"... Abstract In conjunction with PODC 2012, the TransForm project (Marie Curie Initial Training Network) and EuroTM (COST Action IC1001) supported the 4th edition of the Workshop on the Theory of Transactional Memory (WTTM 2012). The objective of WTTM was to discuss new theoretical challenges and recen ..."
Abstract - Add to MetaCart
with Yehuda Afek and Alex Matveev on "Pessimistic transactional lock-elision (PLE)" Distributed transactional memory Distributed transactional memory is the implementation of the transactional memory paradigm in a networked environment where processes communicate by exchanging messages. Differently
Results 1 - 2 of 2