Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Circuit-Switched Broadcasting in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Circuit-Switched Broadcasting in Torus and Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Efficient Heuristics for All-Port Multicast in Wormhole-Routed Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
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
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
OTIS-MOT: an efficient interconnection network for parallel processing
The Journal of Supercomputing
| Hi-index | 0.00 |
Meshes of trees are hybrids of meshes and trees with outstanding properties, namely small degree and diameter and large bisection width. Moreover, they are known to be area universal, i.e., they can simulate any network with the same wire area with only a polylogarithmic slowdown. Meshes of trees are known to outperform meshes in execution of algorithms with local communication patterns, e.g., sorting, for which distance-sensitive switching, such as store-and-forward, suffices. Nowadays, parallel machines use distance-insensitive, e.g., wormhole, switching. A challenging problem is to design optimal or efficient algorithms for one-to-all broadcast in all-output-port networks with distance-insensitive switching, since the lower bound on the number of rounds, logΔ+1N, where Δ is the node degree, is very strict. This problem has been solved for tori and hypercubes quite recently. In this paper, we present nearly optimal algorithms for one-to-all broadcast in both square and rectangular 2-D meshes of trees and cube 3-D meshes of trees. The algorithms need at most one round more than the trivial lower bound. We also show requirements for deadlock-free execution of the algorithms. Meshes of trees are not node-symmetric, they are not even regular. This paper shows that, in contrast to meshes, the irregularity is not an obstacle for designing efficient schemes for such an intensive communication pattern, as the all-output-port broadcast.