Fast Gossiping for the Hypercube

DOI10.1137/0221026MaRDI QIDQ3990659zbMATH OpenOpenAlexFDO

Authors David Krumme

Publication date 28 June 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/dba630339d5833d3f8434954d50d6e55a07f5478

zbMATH Keywords

broadcastinggossipinghypercube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Communication networks in operations research (90B18)

Recommendations

• Gossiping in Minimal Time
• Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model
• Broadcast and gossip in line-communication mode
• Fast gossiping by short messages
• Fast Gossiping by Short Messages

Cited in

(18)

• Fast gossiping on square mesh computers
• Graph theoretical issues in computer networks
• Fast gossiping with short unreliable messages
• Methods and problems of communication in usual networks
• Note on the problem of gossiping in multidimensional grids
• Note on optimal gossiping in some weak-connected graphs
• Better bounds for perpetual gossiping
• Deterministic broadcasting time with partial knowledge of the network.
• Optimal gossiping in paths and cycles
• Gossiping with multiple sends and receives
• Optimal gossiping in square 2D meshes
• Reliable broadcasting in hypercubes with random link and node failures
• The optimal structure of information dissemination
• Fast gossiping on mesh-bus computers
• Oriented hypercubes
• Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model
• Bounds for the oriented diameter of planar triangulations
• On the oriented diameter of planar triangulations

This page was built for publication: Fast Gossiping for the Hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990659)