Near-Optimal Scheduling of Distributed Algorithms

DOI10.1145/2767386.2767417zbMath1333.68272OpenAlexW2026798971MaRDI QIDQ2796236

Mohsen Ghaffari

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

schedulingdilationcongestiondistributed algorithmpacket routingshared randomness

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Low-congestion shortcut and graph parameters ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time ⋮ Near-optimal scheduling in the congested clique

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model

This page was built for publication: Near-Optimal Scheduling of Distributed Algorithms