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...

Descripción completa

Detalles Bibliográficos
Publicado en:	Communications of the ACM Vol. 51; no. 8; pp. 91 - 101
Autores principales:	Harris, Tim, Marlow, Simon, Jones, Simon Peyton, Herlihy, Maurice
Formato:	Artículo
Publicado:	Association for Computing Machinery Aug2008
Materias:	Parallel programs (Computer programs) Computer memory management Threads (Computer programs) Computer programming Parallel algorithms Software engineering
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	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 transactional memory, that offers far richer composition. All the usual benefits of transactional memory are present (e.g., freedom from low-level deadlock), but in addition we describe modular forms of blocking and choice that were inaccessible in earlier work.