Snapshot Isolation Does Not Scale Either
@inproceedings{Bushkov2013SnapshotID, title={Snapshot Isolation Does Not Scale Either}, author={V. Bushkov and Dmytro Dziuma and P. Fatourou and R. Guerraoui}, year={2013} }
Transactional memory (TM) [11, 15] allows concurrent processes to execute operations on data items within atomic blocks of instructions, called transactions. A transaction may either commit in which case all its updates become visible to other transactions, or abort in which case all its updates are discarded. The paradigm is appealing for its simplicity but implementing it efficiently is challenging. Ideally, the TM system should not introduce any contention between transactions beyond that… CONTINUE READING
Figures and Topics from this paper
Figures
4 Citations
The PCL theorem: transactions cannot be parallel, consistent and live
- Mathematics, Computer Science
- SPAA
- 2014
- 10
- PDF
On the use of Clocks to Enforce Consistency in the Cloud
- Computer Science
- IEEE Data Eng. Bull.
- 2015
- 21
- PDF
Lower Bounds and Impossibility Results for Transactional Memory Computing
- Computer Science
- Bull. EATCS
- 2014
- 3
References
SHOWING 1-10 OF 15 REFERENCES
Inherent limitations on disjoint-access parallel implementations of transactional memory
- Computer Science
- SPAA '09
- 2009
- 46
- PDF
Transactional Memory: Architectural Support For Lock-free Data Structures
- Computer Science
- Proceedings of the 20th Annual International Symposium on Computer Architecture
- 1993
- 1,111
- PDF
Disjoint-access-parallel implementations of strong shared memory primitives
- Computer Science
- PODC '94
- 1994
- 231
Towards formally specifying and verifying transactional memory
- Computer Science
- Formal Aspects of Computing
- 2012
- 110
- Highly Influential
Software transactional memory for dynamic-sized data structures
- Computer Science
- PODC '03
- 2003
- 1,079
- Highly Influential
- PDF