Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Optimal total exchange for a 3-D torus of processors
Information Processing Letters
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes
IEEE Transactions on Parallel and Distributed Systems
Gossiping in Cayley Graphs by Packets
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Gossiping Large Packets on Full-Port Tori
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Pipelined All-to-All Broadcast in All-Port Meshes and Tori
IEEE Transactions on Computers
Near-Optimal All-to-All Broadcast in Multidimensional All-Port Meshes and Tori
IEEE Transactions on Parallel and Distributed Systems
Fast Gossiping in Square Meshes/Tori with Bounded-Size Packets
IEEE Transactions on Parallel and Distributed Systems
Near-Optimal All-to-All Broadcast in Multidimensional All-Port Meshes and Tori
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Improved gossipings by short messages in 2-dimensional meshes
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The main results of this paper are algorithms for time-optimal gossip of large packets in noncombining full-duplex all-port 2-D tori and meshes of any size $m\times n$. The gossip algorithms define the structure of broadcast trees and lock-step scheduling schemes for packets that make the broadcast trees time-arc-disjoint. The gossip algorithm for tori is also buffer-optimal驴it requires routers with auxiliary buffers for at most three packets. The gossip algorithm for meshes requires routers with auxiliary buffers for $O(m+n)$ packets.