Composable Memory Transactions

, , , and .
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, page 48--60. New York, NY, USA, ACM, (2005)
DOI: 10.1145/1065944.1065952


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 <i>transactional memory</i>, 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 <i>blocking</i> and <i>choice</i> that have been inaccessible in earlier work.



  • @gron

Comments and Reviews