Transactional collection classes
Brian D. Carlstrom, Austen McDonald, Michael Carbin et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 2007
While parallel programmers find it easier to reason about large atomic regions, the conventional mutual exclusion-based primitives for synchronization force them to interleave many small operations to achieve performance. Transactional memory promises that programmer scan use large atomic regions while achieving similar performance. However, these large transactions can conflict when operating on shared data structures, even for logically independent operations. Transactional collection classes address this problem by allowing long-running transactions to operate on shared data while eliminating unnecessary conflicts. Transactional collection classes wrap existing data structures, without the need for custom implementations or knowledge of data structure internals.
Cited by 51 works. doi:10.1145/1229428.1229441
Authors
References
- Transaction Processing: Concepts and Techniques
- Nested Transactions: An Approach to Reliable Distributed Computing
- Transactional memory
- The transaction concept: virtues and limitations
- Niagara: A 32-Way Multithreaded Sparc Processor
- Software transactional memory
- Proceedings of the 27th International Conference on Very Large Data Bases
- Software transactional memory for dynamic-sized data structures
- Sagas
- Simple, fast, and practical non-blocking and blocking concurrent queue algorithms