Gossiping in Minimal Time
From MaRDI portal
Publication:3990105
DOI10.1137/0221010zbMath0743.68039OpenAlexW2057706918MaRDI QIDQ3990105
George Cybenko, K. N. Venkataraman, David W. 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/4ca6207eb644800bba8b1d344c20524ed5eee3d8
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
Fast gossiping with short unreliable messages ⋮ Methods and problems of communication in usual networks ⋮ Gossiping and broadcasting versus computing functions in networks ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Oriented hypercubes ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ Optimal gossiping in square 2D meshes ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ An online distributed gossiping protocol for mobile networks ⋮ GOSSIPING IN BUS INTERCONNECTION NETWORKS ⋮ STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS ⋮ Gossiping with multiple sends and receives ⋮ Optimal odd gossiping ⋮ Reordered gossip schemes ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Mapping pipeline skeletons onto heterogeneous platforms ⋮ The epistemic gossip problem ⋮ Unnamed Item ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Sparse networks supporting efficient reliable broadcasting ⋮ The minimum broadcast time problem for several processor networks ⋮ Fast gossiping by short messages ⋮ Odd gossiping ⋮ Lower bounds on systolic gossip ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ Communication complexity of gossiping by packets ⋮ Optimal sequential gossiping by short messages ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Optimal gossiping in paths and cycles ⋮ Efficient collective communciation in optical networks ⋮ Fast gossiping on square mesh computers ⋮ Quick gossiping by telegraphs ⋮ Graph theoretical issues in computer networks
