Distributed Computing with the Cloud

DOI10.1007/978-3-030-91081-5_1MaRDI QIDQ6488431zbMATH OpenFDO

Authors Yehuda Afek, Gal Giladi, Boaz Patt-Shamir

Publication date 21 April 2023

Mathematics Subject Classification ID

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

Recommendations

• Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
• Optimal distributed task scheduling in volunteer clouds
• On distributing symmetric streaming computations

Cites work

• scientific article; zbMATH DE number 6297759 (Why is no real title available?)
• An introduction to Kolmogorov complexity and its applications
• An introduction to network flows over time
• Computing Shortest Paths and Diameter in the Hybrid Network Model
• Distributed Computing: A Locality-Sensitive Approach
• Lessons from the congested clique applied to MapReduce
• Locality in Distributed Graph Algorithms
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• Modeling parallel bandwidth: Local versus global restrictions
• On a circle-cover minimization problem
• Parallel Prefix Computation
• Quickest Flows Over Time
• Shortest Paths in a Hybrid Network Model
• The quickest flow problem
• Trade-offs between communication throughput and parallel time

Cited in

(3)

• Asynchronous fully-decentralized SGD in the cluster-based model
• Optimal distributed task scheduling in volunteer clouds
• Cloud computing in space

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

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