The architecture and programming of the Ametek series 2010 multicomputer
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Fast gossiping for the hypercube
SIAM Journal on Computing
SIAM Journal on Computing
Fast gossiping on square mesh computers
Information Processing Letters
Parallel Information Dissemination by Packets
SIAM Journal on Computing
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Fast Gossiping by Short Messages
SIAM Journal on Computing
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics
Optimal sequential gossiping by short messages
Discrete Applied Mathematics
Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes
IEEE Transactions on Parallel and Distributed Systems
Efficient All-to-All Personalized Exchange in Multidimensional Torus Networks
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Fast Gossiping by Short Messages
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Optimal Gossip in Store-and-Forward Noncombining 2-D Tori
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Efficient All-to-All Broadcast in All-Port Mesh and Torus Networks
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
Exchanging messages of different sizes
Journal of Parallel and Distributed Computing
Optimal gossiping in square 2D meshes
Theoretical Computer Science
Improved bounds for data-gathering time in sensor networks
Computer Communications
Optimal gossiping in square meshes in all-port mode and with short packets
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
Gossiping is the communication problem in which each node has a unique message (token) to be transmitted to every other node. The nodes exchange their tokens by packets. A solution to the problem is judged by how many rounds of packet sending it requires. In this paper, we consider the version of the problem in which small-size packets (each carrying exactly one token) are used, the links (edges) of the network are half-duplex (only one packet can flow through a link at a time), and the nodes are all-port (a node's incident edges can all be active at the same time). This is also known as the H* model. We study the 2D square mesh and the 2D square torus. An improved, asymptotically optimal algorithm for the mesh and an optimal algorithm for the torus are presented.