Performance of global load balancing by local adjustment

DOI10.1109/18.59935MaRDI QIDQ3204318zbMATH OpenOpenAlexFDO

Authors Bruce Hajek

Publication date 1990

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b6110ebb9105ef529d0cea8fc7fd8c0b37a60eee

zbMATH Keywords

asymptotic lower bound on the distribution functionnetwork flowresource locations

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Recommendations

• Analysis of Simple Algorithms for Dynamic Load Balancing
• Perfectly balanced allocation
• Balanced loads in infinite networks
• The load-distance balancing problem
• Distributed Selfish Load Balancing

Cited in

(21)

• On large deviations in load sharing networks
• Load balancing in hypergraphs
• Locally optimal load balancing
• Balanced loads in infinite networks
• Local search for load balancing problems for servers with large dimension
• Simultaneous optimization via approximate majorization for concave profits or convex costs
• The densest subgraph problem in sparse random graphs
• The load-distance balancing problem
• Sandwiching a densest subgraph by consecutive cores
• Scalable Load-Distance Balancing
• Belief propagation for optimal edge cover in the random complete graph
• The Effect of Increasing Routing Choice on Resource Pooling
• Guaranteed global performance through local coordinations
• Load optimization in a planar network
• Matching recovery threshold for correlated random graphs
• Twin-width of sparse random graphs
• Scheduling jobs to minimize a convex function of resource usage
• On variants of a load-balancing problem with unit-load jobs
• Resolution of the Kohayakawa-Kreuter conjecture
• Optimal recovery of correlated Erdős-Rényi graphs
• Topological price of anarchy bounds for clustering games on networks

This page was built for publication: Performance of global load balancing by local adjustment

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