Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms

DOI10.1109/TC.2009.104MaRDI QIDQ5280809zbMATH OpenOpenAlexFDO

Authors A. Y. Al-Dubai, M. Ould-Khaoua, L. M. Mackenzie

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2009.104

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Complexity and approximations for multimessage multicasting
• A bandwidth latency tradeoff for broadcast and reduction
• Comparing load balancing algorithms for distributed queueing networks
• scientific article; zbMATH DE number 1522943
• Concurrent multicast in weighted networks
• Concurrent multicast in weighted networks
• Experimental and Efficient Algorithms
• Some notes on cost allocation in multicasting

Cited in

(4)

• Load partitioning and trade-off study for large matrix-vector computations in multicast bus networks with communictaion delays
• A bandwidth latency tradeoff for broadcast and reduction
• Concurrent multicast in weighted networks
• Balancing load versus decreasing communication: Parameterizing the tradeoff

This page was built for publication: Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms

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