Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Circuit-Switched Broadcasting in itd-Dimensional Tori and Meshes
Proceedings of the 8th International Symposium on Parallel Processing
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus
IEEE Transactions on Computers
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings
IEEE/ACM Transactions on Networking (TON)
Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori
IEEE Transactions on Computers
Circuit-Switched Broadcasting in Multi-Port Multi-Dimensional Torus Networks
The Journal of Supercomputing
Broadcasting in all-output-port meshes of trees with distance-insensitive switching
Journal of Parallel and Distributed Computing
Broadcasting in All-Port Wormhole 3-D Meshes of Trees (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Circuit-Switched Broadcasting in Multi-port Multi-dimensional Torus Networks
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Distributing and scheduling divisible task on parallel communicating processors
Journal of Computer Science and Technology
Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed Torus
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A Multistage Load Distribution Strategy for Three-Dimensional Meshes
Cluster Computing
Hi-index | 0.01 |
We consider the problem of broadcasting on torus and mesh networks using circuit-switched, half-duplex, and link-bound communication. In this paper, we obtain an optimal broadcasting algorithm that uses pd time steps for a d-dimensional torus with (2d + 1)p nodes in each side of the torus. Using this algorithm, we show that a broadcasting on a d-dimensional mesh with the same size can be done in pd + p + d驴 1 time steps.