Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
Broadcasting in all-output-port meshes of trees with distance-insensitive switching
Journal of Parallel and Distributed Computing
Broadcasting in Hypercubes in the Circuit Switched Model
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
In this paper, we consider the problem of one-to-all broadcast (OAB) in an interconnection network with the topology of the n-dimensional cube-connected cycles, CCCn, under the following conditions. Routers use distance insensitive switching, e.g., wormhole. A OAB proceeds in rounds that consist of message passing between pairs of nodes using disjoint paths. Routers also have all-output-port functionality, i.e., they can send a packet via all output ports simultaneously. In CCCn, this assumption implies that the lower bound on the number rounds of the OAB is log4(|V(CCCn)|). The main result of this paper is an algorithm for the OAB in CCCn whose number of rounds is greater than the lower bound by at most 1 for all n