Parallel algorithms for gossiping by mail
From MaRDI portal
Publication:911271
DOI10.1016/0020-0190(90)90160-YzbMATH Open0696.68048MaRDI QIDQ911271FDOQ911271
S. Louis Hakimi, John Mitchem, Anindo Bagchi, E. Schmeichel
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2114510
- Efficient gossip and robust distributed computation
- Efficient gossip and robust distributed computation
- On the complexity of asynchronous gossip
- Broadcast Gossip Algorithms for Consensus
- scientific article; zbMATH DE number 2061800
- Parallel graph algorithms based upon broadcast communications
- Distributed Algorithms for Message-Passing Systems
- Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)
Cites Work
Cited In (10)
- On the number of broadcast schemes in networks
- Note on optimal gossiping in some weak-connected graphs
- Optimal algorithms for dissemination of information in some interconnection networks
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- Fast gossiping on square mesh computers
- Graph theoretical issues in computer networks
- The complexity of systolic dissemination of information in interconnection networks
- Optimal algorithms for dissemination of information in generalized communication modes
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes
- Gossiping with multiple sends and receives
This page was built for publication: Parallel algorithms for gossiping by mail
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911271)