SIGN IN
SIGN UP
Composable memory transactions
Full Text:
Pdf
Buy this Article
Authors:
Tim Harris
Microsoft Research, Cambridge, UK
Simon Marlow
Microsoft Research, Cambridge, UK
Simon Peyton-Jones
Microsoft Research, Cambridge, UK
Maurice Herlihy
Microsoft Research, Cambridge, UK
2005 Article
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 114
· Downloads (cumulative): 1,595
· Citation Count: 209
Published in:
· Proceeding
PPoPP '05
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Pages 48 - 60
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-59593-080-9
doi>
10.1145/1065944.1065952
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PPoPP '14
Share:
|
Tags:
algorithms
languages
locks
non-blocking algorithms
parallel programming
transactions
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder