Parallel Information Dissemination by Packets

DOI10.1137/S0097539790192672MaRDI QIDQ4291562zbMATH OpenFDO

Authors Anindo Bagchi, E. Schmeichel, S. Louis Hakimi

Publication date 10 May 1994

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

Full work available at URL https://doi.org/10.1137/S0097539790192672

zbMATH Keywords

algorithms for parallel communication on networksinterprocessor communicationparallel algorithmsparallel gossiping

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Parallel algorithms for gossiping by mail
• Optimal algorithms for dissemination of information in generalized communication modes
• scientific article; zbMATH DE number 1262786

Cited in

(14)

• Optimal sequential gossiping by short messages
• Communication complexity of fault-tolerant information diffusion
• On the communication complexity of polling
• Gossiping and broadcasting versus computing functions in networks.
• Optimal gossiping in paths and cycles
• Optimal gossiping in square 2D meshes
• Fast gossiping by short messages
• On the Age of Information With Packet Deadlines
• scientific article; zbMATH DE number 861430 (Why is no real title available?)
• Communication complexity of gossiping by packets
• Concurrent multicast in weighted networks
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• Concurrent multicast in weighted networks
• Gossiping in Cayley graphs by packets

This page was built for publication: Parallel Information Dissemination by Packets

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