Composable memory transactions
Tim Harris, Simon Marlow, Simon Jones et al. · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 2005
Writing concurrent programs is notoriously difficult, and is of increasing practical importance. A particular source of concern is that even correctly-implemented concurrency abstractions cannot be composed together to form larger abstractions. In this paper we present a new concurrency model, based on transactional memory, that offers far richer composition. All the usual benefits of transactional memory are present (e.g. freedom from deadlock), but in addition we describe new modular forms of blocking and choice that have been inaccessible in earlier work.
Cited by 710 works. doi:10.1145/1065944.1065952
Authors
References
- Transaction Processing: Concepts and Techniques
- Nested Transactions: An Approach to Reliable Distributed Computing
- Transactional memory
- Imperative functional programming
- Software transactional memory
- Software transactional memory for dynamic-sized data structures
- Distributed programming in Argus
- The ObjectStore database system
- Language support for lightweight transactions
- Language support for lightweight transactions