Distributed computing with the Cloud

DOI10.1007/s00446-024-00460-wOpenAlexW4391449555MaRDI QIDQ6126134

Gal Giladi, Yehuda Afek, Boaz Patt-Shamir

Publication date: 9 April 2024

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-024-00460-w

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• On a circle-cover minimization problem
• Lessons from the congested clique applied to MapReduce
• Modeling parallel bandwidth: Local versus global restrictions
• Parallel Prefix Computation
• Locality in Distributed Graph Algorithms
• The quickest flow problem
• Distributed Computing: A Locality-Sensitive Approach
• Shortest Paths in a Hybrid Network Model
• Passing Messages while Sharing Memory
• Quickest Flows Over Time
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• Computing Shortest Paths and Diameter in the Hybrid Network Model
• Trade-offs between communication throughput and parallel time
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Distributed computing with the Cloud