[图书][B] Principles of transactional memory
R Guerraoui, M Kapalka - 2022 - books.google.com
Transactional memory (TM) is an appealing paradigm for concurrent programming on
shared memory architectures. With a TM, threads of an application communicate, and …
shared memory architectures. With a TM, threads of an application communicate, and …
Towards formally specifying and verifying transactional memory
S Doherty, L Groves, V Luchangco, M Moir - Formal Aspects of Computing, 2013 - Springer
Over the last decade, great progress has been made in developing practical transactional
memory (TM) implementations, but relatively little attention has been paid to precisely …
memory (TM) implementations, but relatively little attention has been paid to precisely …
Inherent limitations on disjoint-access parallel implementations of transactional memory
Transactional memory (TM) is a promising approach for designing concurrent data
structures, and it is essential to develop better understanding of the formal properties that …
structures, and it is essential to develop better understanding of the formal properties that …
Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations)
The aim of a Software Transactional Memory (STM) is to discharge the programmers from
the management of synchronization in multiprocess programs that access concurrent …
the management of synchronization in multiprocess programs that access concurrent …
On the liveness of transactional memory
V Bushkov, R Guerraoui, M Kapałka - … of the 2012 ACM symposium on …, 2012 - dl.acm.org
Despite the large amount of work on Transactional Memory (TM), little is known about how
much liveness it could provide. This paper presents the first formal treatment of the question …
much liveness it could provide. This paper presents the first formal treatment of the question …
A programming language perspective on transactional memory consistency
Transactional memory (TM) has been hailed as a paradigm for simplifying concurrent
programming. While several consistency conditions have been suggested for TM, they fall …
programming. While several consistency conditions have been suggested for TM, they fall …
[HTML][HTML] On speculative replication of transactional systems
In this paper we investigate, from a theoretical perspective, the problem of how to build
speculative replication protocols for transactional systems layered on top of an Optimistic …
speculative replication protocols for transactional systems layered on top of an Optimistic …
Decomposing opacity
M Lesani, J Palsberg - International Symposium on Distributed Computing, 2014 - Springer
Transactional memory (TM) algorithms are subtle and the TM correctness conditions are
intricate. Decomposition of the correctness condition can bring modularity to TM algorithm …
intricate. Decomposition of the correctness condition can bring modularity to TM algorithm …
[PDF][PDF] Putting opacity in its place
M Lesani, V Luchangco, M Moir - Workshop on the theory of transactional …, 2012 - Citeseer
We clarify the relationships between Guerraoui and Kapalka's opacity correctness condition
for Transactional Memory (TM) algorithms and the TMS1 and TMS2 conditions we have …
for Transactional Memory (TM) algorithms and the TMS1 and TMS2 conditions we have …
Transaction communicators: enabling cooperation among concurrent transactions
V Luchangco, VJ Marathe - Proceedings of the 16th ACM symposium on …, 2011 - dl.acm.org
In this paper, we propose to extend transactional memory with transaction communicators,
special objects through which concurrent transactions can communicate: changes by one …
special objects through which concurrent transactions can communicate: changes by one …