An O(n n) algorithm for a load balancing problem on paths

DOI10.1007/978-3-642-22300-6_28zbMATH Open1342.68347OpenAlexW2169298952MaRDI QIDQ5199253FDOQ5199253

Authors: Nikhil R. Devanur, Uriel Feige 

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_28

Recommendations

• Locally optimal load balancing
• Efficient schemes for nearest neighbor load balancing
• scientific article; zbMATH DE number 1305097
• Discrete load balancing is (almost) as easy as continuous load balancing
• Efficient schemes for nearest neighbor load balancing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonnumerical algorithms (68W05)

Cited In (1)

• Parallel physics-inspired waterflow particle mechanics algorithm for load rebalancing

This page was built for publication: An \(O(n \log n)\) algorithm for a load balancing problem on paths

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