On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
SIAM Journal on Computing
Fast information sharing in a complete network
Discrete Applied Mathematics
Optimal algorithms for dissemination of information in generalized communication modes
Proceedings of the international workshop on Broadcasting and gossiping 1990
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Unicast-Based Multicast Communication in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs
Information and Computation
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Information and Computation
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Gossip in Trees under Line-Communication Mode
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
An Algorithm of Broadcasting in the Mesh of Trees
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
Feedback vertex sets in mesh-based networks
Theoretical Computer Science
OTIS-MOT: an efficient interconnection network for parallel processing
The Journal of Supercomputing
| Hi-index | 0.00 |
Meshes of trees are an ingenious hybrid of meshes and trees. They have very interesting properties, namely small degree and diameter and large bisection width. Also they are area universal, i.e., they can simulate any network with the same VLSI wire area with only polylogarithmic factor of slowdown. They are known to outperform meshes in execution of algorithms with local communication patterns, for which distance-sensitive switching, such as store-and-forward, suffices. Nowadays, parallel machines use distance-insensitive switching, such as wormhole. The performance of a machine with such a fast switching depends on the existence of efficient algorithms for commonly used collective communication operations. Little is known about collective communication properties of meshes of trees with distance-insensitive switching. We show that 2-D meshes of trees with distance-insensitive switching can execute optimally or asymptotically optimally two basic global communication operations, one-to-all broadcast and all-to-all broadcast, if routers with one-port and packet combining capabilities are used. Our algorithms work optimally for both square and rectangular meshes of trees.