Parallel Information Dissemination by Packets
From MaRDI portal
Publication:4291562
DOI10.1137/S0097539790192672zbMath0804.68057MaRDI QIDQ4291562
S. Louis Hakimi, Edward F. Schmeichel, Anindo Bagchi
Publication date: 10 May 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
parallel algorithmsinterprocessor communicationalgorithms for parallel communication on networksparallel gossiping
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items
On the communication complexity of polling ⋮ Optimal gossiping in square 2D meshes ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Fast gossiping by short messages ⋮ Concurrent multicast in weighted networks ⋮ Concurrent multicast in weighted networks ⋮ 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 ⋮ ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS