40 search results - page 1 / 8 » Transactions as the Foundation of a Memory Consistency Model |
WDAG
2010
Springer
13 years 2 months ago
2010
Springer
We argue that traditional synchronization objects, such as locks, conditions, and atomic/volatile variables, should be defined in terms of transactions, rather than the other way ...
PODC
2010
ACM
13 years 8 months ago
2010
ACM
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
ICA3PP
2005
Springer
13 years 9 months ago
2005
Springer
Shared Memory is an interesting communication paradigm for SMP machines and clusters. Weak consistency models have been proposed to improve efficiency of shared memory applications...
CAV
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...