Communications of the ACM - Special section on computer architecture
Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
Proceedings of the Second Conference on Hypercube Multiprocessors on Hypercube multiprocessors
Proceedings of the Second Conference on Hypercube Multiprocessors on Hypercube multiprocessors
Computing on an anonymous ring
Journal of the ACM (JACM)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
General and Efficient Decentralized Consensus Protocols
Proceedings of the 2nd International Workshop on Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A New Algorithm for the Decentralized Aggregation Problem
Distributed and Parallel Databases
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 14.98 |
Presents efficient algorithms for collecting information distributed among indistinguishable (anonymous) processors while performing certain operations on the information being collected. The efficiency objective is to minimize the communication-delay product and to obtain trade-offs between the two. The main contribution of the paper is a new efficient algorithm for performing sumlike operations (such as Abelian group operations and elementary symmetric functions) and the use of metrically regular graphs (which include the widely used hypercube interconnections) for information dissemination in distributed computations. The best algorithm has a communication-delay product of O(Nlog/sup 3/ N) (for W nodes), and obtaining an optimal /spl Omega/(Nlog/sup 2/N) algorithm remains an open problem.