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...
| Publicado en: | Communications of the ACM Vol. 51; no. 8; pp. 91 - 101 |
|---|---|
| Autores principales: | , , , |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Aug2008
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=33662989&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 33662989 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Aug2008 vid: 51 iid: 8 pid: 68 pub: Association for Computing Machinery artinfo: ui: 33662989 10.1145/1378704.1378725 ppf: 91 ppct: 10 formats: tig: atl: Composable Memory Transactions. aug: au: Harris, Tim Marlow, Simon Jones, Simon Peyton Herlihy, Maurice affil: Brown University. su: Parallel programs (Computer programs) Computer memory management Threads (Computer programs) Computer programming Parallel algorithms Software engineering sug: subj: Parallel programs (Computer programs) Computer memory management Threads (Computer programs) Computer programming Parallel algorithms Software engineering ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2008 holdings: @attributes: islocal: N |
|---|