The multiplicative power of consensus numbers

DOI10.1145/1835698.1835705zbMath1315.68271OpenAlexW2006011254MaRDI QIDQ5176187

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.1835705

zbMATH Keywords

simulationfault-tolerancereduction algorithmasynchronous processeswait-freedom\(k\)-set agreementdistributed computabilityshared memory systemconsensus numberprocess crash failuresystem model\(t\)-resilienceBG simulationsynchronization power

Mathematics Subject Classification ID

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

Related Items (4)

From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ A Simple Object that Spans the Whole Consensus Hierarchy ⋮ Power and limits of distributed computing shared memory models ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations

Uses Software

• CCSTM

Cites Work

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

This page was built for publication: The multiplicative power of consensus numbers