Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract)
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Structured communication in torus networks
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Broadcasting, multicasting and gossiping in trees under the all-port line model
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. In thispaper we study these problems under both line model, and cut-through model. The former assumes long distance calls between non neighboringprocessors. The latter com- pletes the line model by taking into account the use of a routing function. It is known that one can find time optimal broadcast and multicastprotocols in the line model inpoly- nomial time. We present a new time optimal broadcasting and multicasting algorithm in the line model. This algorithm efficiently uses the bandwidth of the network. Moreover, it also applies to the cut-through model as soon as the routing junction generates shortest paths only.