A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Building a Multicasting Tree in a High-Speed Network
IEEE Concurrency
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in Star Graphs
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Broadcasting on incomplete star graph interconnection networks
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Optimal broadcasting on incomplete star graph interconnection networks
Journal of Systems Architecture: the EUROMICRO Journal
A comparative study of job allocation and migration in the pancake network
Information Sciences: an International Journal
| Hi-index | 0.01 |
Broadcasting is an important data communication operation in a parallel computer. In this paper, we first give a short survey on various broadcasting schemes on the star and pancake interconnection networks. We then present a broadcasting algorithm on the star and pancake networks, which can broadcast m messages of fixed length on an n-star or n-pancake in time O(n log n+m), improving the previous best result O(m log n log n). Our result is optimal in view of the /spl Omega/(n log n+m) lower bound for the problem. Moreover our algorithm works for both the star and pancake networks, while the previous O(m log n+n log n) algorithm is only for the star.