On-line load balancing

DOI10.1016/0304-3975(94)90153-8zbMath0810.68080OpenAlexW2050345497MaRDI QIDQ1331958

Yossi Azar, Andrei Z. Broder, Anna R. Karlin

Publication date: 4 April 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90153-8

zbMATH Keywords

on-line load balancingservers

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items

Tight bounds for online class-constrained packing ⋮ A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks ⋮ An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem ⋮ On-line load balancing made simple: greedy strikes back ⋮ On-line algorithms for the channel assignment problem in cellular networks. ⋮ Balancing sums of random vectors ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs ⋮ On the \(k\)-orientability of random graphs ⋮ Competitive on-line scheduling of continuous-media streams

Cites Work

• Unnamed Item
• An on-line graph coloring algorithm with sublinear performance ratio
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Online load balancing of temporary tasks
• Online load balancing and network flow
• Bounds for Certain Multiprocessing Anomalies