Using process groups to implement failure detection in asynchronous environments

DOI10.1145/112600.112628MaRDI QIDQ5255831zbMATH OpenOpenAlexFDO

Authors Aleta Ricciardi, Kenneth P. Birman

Publication date 19 June 2015

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

Full work available at URL http://hdl.handle.net/2060/19910009350

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cited in

(7)

• The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
• Dynamic group communication
• The Failure Discovery problem
• On distributed algorithms in a broadcast domain
• Effective multicast programming in large scale distributed systems
• The inherent cost of strong-partial view-synchronous communication
• Dissecting distributed coordination

This page was built for publication: Using process groups to implement failure detection in asynchronous environments

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