By Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy
Communications of the ACM,
August 2008,
Vol. 51 No. 8, Pages 91-100
10.1145/1378704.1378725
Comments
In this paper we present a concurrency model based on transactional memory. All the usual benefits of transactional memory are present, but in addition we describe modular forms of blocking and choice that were inaccessible in earlier work.
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.