Tilings and patterns
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Tiling the Torus and other space forms
Discrete & Computational Geometry
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
VLSI and parallel computation
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Deadlock-free multicast wormhole routing in multicomputer networks
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Low-latency message communication support for the AP1000
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Optimal Broadcasting in Mesh-Connected Architectures
Optimal Broadcasting in Mesh-Connected Architectures
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Broadcasting, multicasting and gossiping in trees under the all-port line model
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks
IEEE Transactions on Parallel and Distributed Systems
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
Journal of Algorithms
Complete Exchange Algorithms for Meshes and Tori Using a Systematic Approach (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
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
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
Efficient Collective Communications in Dual-Cube
The Journal of Supercomputing
A Multistage Load Distribution Strategy for Three-Dimensional Meshes
Cluster Computing
Performance limits of divisible load processing in systems with limited communication buffers
Journal of Parallel and Distributed Computing
Broadcastings and digit tilings on three-dimensional torus networks
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper we present three broadcast algorithms and lower bounds on the three main components of the broadcast time for 2-dimensional torus networks (wrap-around meshes) that use synchronous circuit-switched routing. The first algorithm is based on a recursive tiling of a torus and is optimal in terms of both phases and intermediate switch settings when the start-up time to initiate message transmissions is the dominant cost. It is the first broadcast algorithm to match the lower bound of log5N on number of phases (where N is the number of nodes). The second and third algorithms are hybrids which combine circuit-switching with the pipelining and arc-disjoint spanning trees techniques that are commonly used to speed up store-and-forward routing. When the propagation time of messages through the network is significant, our hybrid algorithms achieve close to optimal performance in terms of phases, intermediate switch settings, and total transmission time. They are the first algorithms to achieve this performance in terms of all three parameters simultaneously.