Software transactional memory
Nir Shavit, Dan Touitou ยท 1995
As we learn from the literature, flexibility in choosing syn-chroni~ation operations greatly simplifies the task of de-
Cited by 1,197 works. doi:10.1145/224964.224987 Open-access PDF
Authors
References
- Introduction to Algorithms
- Linearizability: a correctness condition for concurrent objects
- Using cache memory to reduce processor-memory traffic
- Wait-free synchronization
- Transactional memory
- Hierarchical correctness proofs for distributed algorithms
- The MIT Alewife Machine: A Large-Scale Distributed-Memory Multiprocessor
- The drinking philosophers problem
- The performance of spin lock alternatives for shared-memory multiprocessors
- A methodology for implementing highly concurrent data objects