Trade-offs between communication throughput and parallel time

DOI10.1145/195058.195199MaRDI QIDQ5890843zbMATH OpenOpenAlexFDO

Authors Yishay Mansour, Noam Nisan, Uzi Vishkin

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195199

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Trade-offs between communication throughput and parallel time
• Communication-Efficient Parallel Sorting
• Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds
• Communication-processor tradeoffs in a limited resources PRAM
• scientific article; zbMATH DE number 176491

Cited in

(6)

• Communication-processor tradeoffs in a limited resources PRAM
• scientific article; zbMATH DE number 2102734 (Why is no real title available?)
• Trade-offs between communication throughput and parallel time
• Balancing load versus decreasing communication: Parameterizing the tradeoff
• Compression using efficient multicasting
• Combining temporal partitioning and temporal placement techniques for communication cost improvement

This page was built for publication: Trade-offs between communication throughput and parallel time

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