On asymmetric progress conditions

DOI10.1145/1835698.1835709zbMath1315.68029OpenAlexW2011342281MaRDI QIDQ5176189

Gadi Taubenfeld, Damien Imbs, Michel Raynal

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835709

zbMATH Keywords

livenesswait-freedomobstruction-freedomprocess crashconsensus numberasynchronous shared memory systemprogress conditionfault-freedom

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (5)

Power and limits of distributed computing shared memory models ⋮ Waiting in concurrent algorithms ⋮ A closer look at fault tolerance ⋮ The computational structure of progress conditions and shared objects ⋮ What Can be Computed in a Distributed System?

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: On asymmetric progress conditions