Zobrazit v EDS

Composable Memory Transactions.

Uloženo v:
Podrobná bibliografie
Název: Composable Memory Transactions.
Autoři: Harris, Tim tharris@microsoft.com, Marlow, Simon simonmar@microsoft.com, Jones, Simon Peyton simonpj@microsoft.com, Herlihy, Maurice1 mph@cs.brown.edu
Zdroj: Communications of the ACM. Aug2008, Vol. 51 Issue 8, p91-100. 10p. 1 Chart.
Témata: *COMPUTER programming, *SOFTWARE engineering, PARALLEL programs (Computer programs), COMPUTER memory management, THREADS (Computer programs), PARALLEL algorithms
Abstrakt: 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. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Business Source Index
Popis
Abstrakt: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. [ABSTRACT FROM AUTHOR]
ISSN:00010782
DOI:10.1145/1378704.1378725