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

parallel algorithmsinterprocessor communicationalgorithms for parallel communication on networksparallel gossiping

Mathematics Subject Classification ID

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

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

(13)

• Communication complexity of gossiping by packets
• Gossiping in Cayley graphs by packets
• ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
• 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.
• On the Age of Information With Packet Deadlines
• Concurrent multicast in weighted networks
• Concurrent multicast in weighted networks
• Optimal gossiping in paths and cycles
• Fast gossiping by short messages
• Optimal gossiping in square 2D meshes

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)