From causal to z-linearizable transactional memory
From MaRDI portal
Publication:5401450
DOI10.1145/1281100.1281162zbMath1283.68120MaRDI QIDQ5401450
Torval Riegel, Christof Fetzer, Pascal Felber, Heiko Sturzrehm
Publication date: 13 March 2014
Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1281100.1281162
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68M14: Distributed systems
68W15: Distributed algorithms
Related Items
On avoiding spare aborts in transactional memory, Extensible transactional memory testbed, Inherent limitations on disjoint-access parallel implementations of transactional memory