Specifying and using a partitionable group communication service

DOI10.1145/259380.259422MaRDI QIDQ5361466zbMATH OpenOpenAlexFDO

Authors Alan Fekete, Nancy Lynch, Alexander A. Schwarzmann

Publication date 29 September 2017

Published in Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)

Cited in

(3)

• The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
• Revisiting the PAXOS algorithm
• A coded shared atomic memory algorithm for message passing architectures

This page was built for publication: Specifying and using a partitionable group communication service

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