On-line load balancing with applications to machine scheduling and virtual circuit routing

DOI10.1145/167088.167248zbMath1310.68248OpenAlexW2027920448MaRDI QIDQ5248533

James Aspnes, Orli Waarts, Serge A. Plotkin, Amos Fiat, Yossi Azar

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (18)

An improved lower bound for load balancing of tasks with unknown duration ⋮ Harmonic buffer management policy for shared memory switches ⋮ On-line load balancing for related machines ⋮ Load balancing for response time ⋮ Adaptive Video on Demand ⋮ Online load balancing on uniform machines with limited migration ⋮ On-line routing in all-optical networks ⋮ Oblivious Routing for Sensor Network Topologies ⋮ On-line resource management with applications to routing and scheduling ⋮ Improved bounds for on-line load balancing ⋮ Unnamed Item ⋮ Competitive routing of virtual circuits with unknown duration ⋮ Combining fairness with throughput: Online routing with multiple objectives ⋮ On-line bin-stretching ⋮ A competitive analysis for retransmission timeout ⋮ On-line routing in all-optical networks ⋮ On-line restricted assignment of temporary tasks with unknown durations. ⋮ Competitive on-line scheduling of continuous-media streams

This page was built for publication: On-line load balancing with applications to machine scheduling and virtual circuit routing