2007 IEEE 13th International Symposium on High Performance Computer Architecture 2007
DOI: 10.1109/hpca.2007.346189
|View full text |Cite
|
Sign up to set email alerts
|

A Scalable, Non-blocking Approach to Transactional Memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
129
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 123 publications
(160 citation statements)
references
References 28 publications
0
129
0
Order By: Relevance
“…All writes are then committed through the "channel" created, after which the bus is unlocked with another LOCK BUS message, resuming normal operation. More efficient schemes can be supported in the future to enable parallel commits [3].…”
Section: Bus Extensionsmentioning
confidence: 99%
See 1 more Smart Citation
“…All writes are then committed through the "channel" created, after which the bus is unlocked with another LOCK BUS message, resuming normal operation. More efficient schemes can be supported in the future to enable parallel commits [3].…”
Section: Bus Extensionsmentioning
confidence: 99%
“…Transactional Memory can be implemented in hardware (HTM) [3], [16], which is fast but resourcebounded while usually requiring changes to the caches and the Instruction Set Architecture (ISA), or software (STM) [9] which can be flexible, run on off-the-shelf hardware, albeit at the expense of lower performance. To have the best of two worlds, there are intermediate Hybrid TM (HyTM) proposals where transactions first attempt to run on hardware, but are backed off to SW when HW resources are exceeded, and Hardwareassisted STM (HaSTM) which aims to accelerate a software-controlled TM implementation by architectural means [7], [2].…”
Section: Introductionmentioning
confidence: 99%
“…When a conflict is detected, the transaction does a rollback. The snooping version of TCC is modified in [16] to a scalable version based on a directory protocol solution.…”
Section: Transactional Coherence and Consistency Tccmentioning
confidence: 99%
“…Transactional Coherence and Consistency (TCC) [41,39,40,67,16] is based on the observation that for well synchronized programs, coherence and consistency are only needed to be maintained at synchronization points. TCC is proposed as a new shared memory model where atomic transactions always are the basic units of work and communication, as well as for memory coherence and consistency.…”
Section: Transactional Coherence and Consistency Tccmentioning
confidence: 99%
“…The Transactional Memory [10], [5], [14], [12], [7] is a technology where programmers just need to wrap a portion of the code in what is known as a transaction. It is then the responsibility of the TM framework to enforce Atomicity and Isolation properties to guarantee correctness.…”
Section: Introductionmentioning
confidence: 99%