Composable Memory Transactions.

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 concurrency model, based on t...

Full description

Bibliographic Details

Published in:	Communications of the ACM Vol. 51; no. 8; pp. 91 - 101
Main Authors:	Harris, Tim, Marlow, Simon, Jones, Simon Peyton, Herlihy, Maurice
Format:	Article
Published:	Association for Computing Machinery Aug2008
Subjects:	Parallel programs (Computer programs) Computer memory management Threads (Computer programs) Computer programming Parallel algorithms Software engineering
Online Access:	View this record in EBSCOhost