Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
Data management for mobile computing
ACM SIGMOD Record
Optimal NODUP All-to-All Broadcast Schemes in Distributed Computing Systems
IEEE Transactions on Parallel and Distributed Systems
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Flow Control for Limited Buffer Multicast
IEEE Transactions on Software Engineering
On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.02 |
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of information to all other nodes in the system. In this paper, we develop all-to-all broadcast schemes by dealing with two classes of schemes. A prior scheme based on generation of minimal complete sets is first described, and then a new scheme based on propagation of experts is developed. The former always completes the broadcasting in the minimal number of steps and the latter is designed to minimize the number of messages. Performance of these two classes of schemes is comparatively analyzed. The all-to-all broadcast scheme desired can be derived by combining the advantages of these two classes of schemes.