Composable Memory Transactions

(Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy) PPoPP’05: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Chicago, Illinois, June 2005

Full Paper | BibTeX

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 , 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 and that have been inaccessible in earlier work.