ANALYSIS OF GOSSIPING ALGORITHMS WITH RESTRICTED BUFFERS

DOI10.1080/01495739808947363MaRDI QIDQ4226500zbMATH OpenOpenAlexFDO

Authors

Publication date 22 June 1999

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01495739808947363

zbMATH Keywords

distributed-memorygossiping algorithmsparallel architectures

Mathematics Subject Classification ID

Computer system organization (68M99) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Oblivious gossiping on tori
• scientific article; zbMATH DE number 1760008
• Gossiping with multiple sends and receives
• Fast gossiping on square mesh computers

Cited in

(2)

• Oblivious gossiping on tori
• Buffered Communication Analysis in Distributed Multiparty Sessions

This page was built for publication: ANALYSIS OF GOSSIPING ALGORITHMS WITH RESTRICTED BUFFERS

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