DocumentCode
3791441
Title
Unbounded Transactional Memory
Author
C.S. Ananian;K. Asanovic;B.C. Kuszmaul;C.E. Leiserson;S. Lie
Author_Institution
Massachusetts Institute of Technology
Volume
26
Issue
1
fYear
2006
Firstpage
59
Lastpage
69
Abstract
This article advances the following thesis: transactional memory should be virtualized to support transactions of arbitrary footprint and duration. Such support should be provided through hardware and be made visible to software through the machines instruction set architecture. We call a transactional memory system unbounded if the system can handle transactions of arbitrary duration that have footprints nearly as big as the systems virtual memory. The primary goal of unbounded transactional memory is to make concurrent programming easier without incurring much implementation overhead. Unbounded transactional-memory architectures can achieve high performance in the common case of small transactions, without sacrificing correctness in large transactions
Keywords
"Turing machines","Hardware","Counting circuits","Data structures","Algorithms","Registers"
Journal_Title
IEEE Micro
Publisher
ieee
ISSN
0272-1732
Type
jour
DOI
10.1109/MM.2006.26
Filename
1603498
Link To Document