Towards a universal construction for transaction-based multiprocess programs

DOI10.1016/j.tcs.2012.09.011zbMath1294.68038OpenAlexW2013953807MaRDI QIDQ391265

Tyler Crain, Michel Raynal, Damien Imbs

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.011

zbMATH Keywords

compare and swapasynchronous systemtransactionuniversal constructionabort/commitatomic execution unitconcurrency managementfetch and incrementlock-freedomshared memory systemSTM system

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

Distributed universality

Cites Work

• Unnamed Item
• The weakest failure detectors to boost obstruction-freedom
• Permissiveness in Transactional Memories
• The RedBlue Adaptive Universal Constructions
• Monitors
• Specification and Proof Techniques for Serializers
• Software transactional memory
• X-Ability: a theory of replication
• Toward a theory of transactional contention managers
• Generalized FLP impossibility result for t-resilient asynchronous computations

This page was built for publication: Towards a universal construction for transaction-based multiprocess programs