Distributed Computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Unreliable failure detectors for asynchronous systems (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Using process groups to implement failure detection in asynchronous environments
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Link Between Knowledge and Communication in Faulty Distributed Systems
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
Knowledge and inhibition in asynchronous distributed systems
Knowledge and inhibition in asynchronous distributed systems
| Hi-index | 0.00 |
The Group Membership Problem is concerned with propagating changes in the membership of a group of processes to the members of that group. A restricted version of this problem allows one to implement a fail-stop failure model of processes in an asynchronous environment assuming a crash failure model. While the ISIS Toolkit relies on this for its Failure Detector, the current specification of GMP sheds no light on how to implement it. We present a knowledge-based formulation, cast as a commit-style problem, that is not only easier to understand, but also makes clear where optimizations to the ISIS implementation are and are not possible. In addition, the epistemic formulation allows us to use the elegant results of knowledge-acquisition theory to discover a lower bound on the required number of messages, construct a minimal protocol, and discuss the tradeoffs between the message-minimal protocol and the optimized ISIS implementation.