A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computing on an anonymous ring
Journal of the ACM (JACM)
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Naming and identity in epistemic logic part II: a first-order logic for naming
Artificial Intelligence
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Distributed Algorithms
Communication and Concurrency
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
A Characterization of Eventual Byzantine Agreement
SIAM Journal on Computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Reasoning About Knowledge
Using counterfactuals in knowledge-based programming
Distributed Computing
Distributed Computing
| Hi-index | 0.00 |
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventually compute the value f(N). We call this problem global function computation. Various solutions for instances of this problem, such as Boolean function computation, leader election, (minimum) spanning tree construction, and network determination, have been proposed, each under particular assumptions about what processors know about the system and how this knowledge can be acquired. We give a necessary and sufficient condition for the problem to be solvable that generalizes a number of well-known results [3, 28, 29]. We then provide a knowledge-based (kb) program (like those of Fagin, Halpern, Moses, and Vardi [8,9]) that solves global function computation whenever possible. Finally, we improve the message overhead inherent in our initial kb program by giving a counterfactual belief-based program [15] that also solves the global function computation whenever possible, but where agents send messages only when they believe it is necessary to do so. The latter program is shown to be implemented by a number of well-known algorithms for solving leader election.