ACM Home Page
Please provide us with feedback. Feedback
Composable memory transactions
Full text Digital EditionDigital Edition HtmlHtml (3 KB),  PdfPdf (216 KB)
Source
Communications of the ACM archive
Volume 51 ,  Issue 8  (August 2008) table of contents
Designing games with a purpose
SECTION: Research highlights table of contents
Pages 91-100  
Year of Publication: 2008
ISSN:0001-0782
Authors
Tim Harris  Microsoft Research
Simon Marlow  Microsoft Research
Simon Peyton Jones  Microsoft Research
Maurice Herlihy  Brown University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 280,   Citation Count: 3
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1378704.1378725
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
4
5
 
6
Daume III, H. Yet another Haskell tutorial, http://www.cs.utah.edu/~hal/docs/daurne02yaht.pdf, 2006.
 
7
8
9
 
10
Harris, Ò., and Peyton Jones, S. Transactional memory with data invariants. TRANSACT'06: Proceedings of the 1st ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing, June 2006.
11
12
13
 
14
 
15
16
 
17
 
18
Peyton Jones, S. Tackling the awkward squad: Monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. Engineering Theories of Software Construction, Marktoberdorf Summer School 2000.
 
19
Peyton Jones, S. Beautiful concurrency. In Beautiful Code (2007), A. Oran and G. Wilson, Eds., O'Reilly.
20
21
22
23
 
24
 
25
Sutter, H. The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's J.; March 2005).



REVIEW

"Sergei Gorlatch : Reviewer"

Transactional memory (TM) is a promising alternative to lock-based parallel programming models on shared-memory architectures. In lock-based programming models, critical memory sections used are locked and unlocked, whether more than one process a  more...

Collaborative Colleagues:
Tim Harris: colleagues
Simon Marlow: colleagues
Simon Peyton Jones: colleagues
Maurice Herlihy: colleagues