Composable memory transactions
Top Cited Papers
- 15 June 2005
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
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.Keywords
This publication has 19 references indexed in Scilit:
- Programming with transactional coherence and consistency (TCC)Published by Association for Computing Machinery (ACM) ,2004
- Transactional Monitors for Concurrent ObjectsPublished by Springer Nature ,2004
- Language support for lightweight transactionsPublished by Association for Computing Machinery (ACM) ,2003
- Speculative synchronizationPublished by Association for Computing Machinery (ACM) ,2002
- Enhancing software reliability with speculative threadsPublished by Association for Computing Machinery (ACM) ,2002
- Asynchronous exceptions in HaskellPublished by Association for Computing Machinery (ACM) ,2001
- Concurrent HaskellPublished by Association for Computing Machinery (ACM) ,1996
- Lightweight recoverable virtual memoryACM Transactions on Computer Systems, 1994
- The ObjectStore database systemCommunications of the ACM, 1991
- Distributed programming in ArgusCommunications of the ACM, 1988