Sharing is harder than agreeing

DOI10.1145/1400751.1400764zbMath1301.68126OpenAlexW2028136782MaRDI QIDQ2934335

Hugues Fauconnier, Carole Delporte-Gallet, Rachid Guerraoui

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/125090/files/K2.pdf

zbMATH Keywords

message passingasynchronous systemregister\(k\)-set agreementfailure detector

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

The Weakest Failure Detector for Message Passing Set-Agreement ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems

This page was built for publication: Sharing is harder than agreeing