Towards a universal construction for transaction-based multiprocess programs

DOI10.1016/J.TCS.2012.09.011MaRDI QIDQ391265zbMATH OpenOpenAlexFDO

Authors Tyler Crain, Damien Imbs, Michel Raynal

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

asynchronous systemtransactionuniversal constructionabort/commitatomic execution unitcompare and swapconcurrency 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)

Recommendations

• Software transactional memory
• Semantics of transactional memory and automatic mutual exclusion
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
• A Concurrent Calculus with Atomic Transactions

Cites work

• scientific article; zbMATH DE number 1263230 (Why is no real title available?)
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Monitors
• Permissiveness in Transactional Memories
• Software transactional memory
• Specification and Proof Techniques for Serializers
• The RedBlue Adaptive Universal Constructions
• The weakest failure detectors to boost obstruction-freedom
• Toward a theory of transactional contention managers
• X-ability: a theory of replication

Cited in

(6)

• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
• scientific article; zbMATH DE number 2060811 (Why is no real title available?)
• Distributed universality
• Software transactional memory
• Brief announcement: Proust: a design space for highly-concurrent transactional data structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391265)