Wormhole Broadcast in Hypercubes

Authors:
Shahram Latifi;Myung Hoon Lee;Pradip K. Srimani
Affiliations:
Department of Electrical Engineering, University of Nevada, Las Vegas, NV 89154-4026;Department of Electrical Engineering, University of Nevada, Las Vegas, NV 89154-4026;Department of Computer Science, Colorado State University, Ft. Collins, CO 80523 srimanis.colostate.edu
Venue:
The Journal of Supercomputing
Year:
2000

Citing 7
Cited 1

Topological Properties of Hypercubes

IEEE Transactions on Computers
Efficient communication primitives on hypercubes

Concurrency: Practice and Experience
Unicast-Based Multicast Communication in Wormhole-Routed Networks

IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Efficient multicast in all-port wormhole-routed hypercubes

Journal of Parallel and Distributed Computing
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Collective Communication in Wormhole-Routed Massively Parallel Computers

Computer

Midpoints for fuzzy sets and their application in medicine

Artificial Intelligence in Medicine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of broadcasting a message in the n-cube, Q_n, equipped with wormhole switching. The communication model assumed is one-port, and the broadcasting scheme is path-based whereby, during broadcasting along a path by a node, all the nodes on that path will receive the message. The wormhole path length is m where _−m's concurrently (cube-based broadcast). The second method is based on the concept of Gray codes (GCs), and at every given step, it forms the Hamiltonian path of appropriate size as the broadcast path (GC-based broadcast). It is shown that the steps required in GC-based broadcast is fewer than or equal to those needed by cube-based broadcast. Furthermore, comparison of time complexity of GC-based broadcast to the lower bound reveals that this algorithm is near-optimal, and in fact optimal in many cases. This work improves on the best algorithm developed for path-based broadcast in one-port hypercube both in complexity and in simplicity.