Communications of the ACM - Special section on computer architecture
Discrete mathematics
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
HARTS: A Distributed Real-Time Architecture
Computer - Special issue on real-time systems
Communications of the ACM - Special issue on parallelism
Efficient parallel data mining for association rules
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
On General Results for All-to-All Broadcast
IEEE Transactions on Parallel and Distributed Systems
PeerCluster: A Cluster-Based Peer-to-Peer System
IEEE Transactions on Parallel and Distributed Systems
An all-reduce operation in star networks using all-to-all broadcast communication pattern
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
| Hi-index | 0.00 |
Broadcast, referring to a process of information dissemination in a distributed systemwhereby a message originating from a certain node is sent to all other nodes in thesystem, is a very important issue in distributed computing. All-to-all broadcast means theprocess by which every node broadcasts its certain piece of information to all othernodes. In this paper, we first develop the optimal all-to-all broadcast scheme for thecase of one-port communication, which means that each node can only send out onemessage in one communication step, and then, extend our results to the case ofmulti-port communication, i.e., k-port communication, meaning that each node can sendout k messages in one communication step. We prove that the proposed schemes areoptimal for the model considered in the sense that they not only require the minimalnumber of communication steps, but also incur the minimal number of messages.