Near-optimal scheduling of distributed algorithms

DOI10.1145/2767386.2767417MaRDI QIDQ2796236zbMATH OpenOpenAlexFDO

Authors 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

congestiondilationdistributed algorithmpacket routingschedulingshared randomness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1559580
• scientific article; zbMATH DE number 1256754
• Traffic-light scheduling on the grid
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(25)

• Fast distributed algorithms to make mutually coordinated decisions in stringent real time
• On efficient distributed construction of near optimal routing schemes
• Near-optimal scheduling in the congested clique
• Sublinear-time distributed algorithms for detecting small cliques and even cycles
• Low-congestion shortcut and graph parameters
• A distributed exact algorithm for the multiple resource constrained sequencing problem
• DESH: Overhead reduction algorithms for deferrable scheduling
• Optimal scheduling of contract algorithms with soft deadlines
• scientific article; zbMATH DE number 5985624 (Why is no real title available?)
• Distributed scheduling: a review of concepts and applications
• scientific article; zbMATH DE number 5629900 (Why is no real title available?)
• Efficient distributed algorithms by using the archimedean time assumption
• scientific article; zbMATH DE number 2156277 (Why is no real title available?)
• Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
• scientific article; zbMATH DE number 7561283 (Why is no real title available?)
• Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
• Finding a small vertex cut on distributed networks
• Distributed constructions of dual-failure fault-tolerant distance preservers
• Near-optimal distributed computation of small vertex cuts
• A lower bound on the period length of a distributed scheduler
• A near-optimal low-energy deterministic distributed SSSP with ramifications on congestion and APSP
• Deterministic expander routing: faster and more versatile
• Computing minimum weight cycle in the CONGEST model
• Restorable shortest path tiebreaking for edge-faulty graphs
• Near-optimal schedules for simultaneous multicasts

This page was built for publication: Near-optimal scheduling of distributed algorithms

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