An improved lower bound for load balancing of tasks with unknown duration

DOI10.1016/S0020-0190(97)00085-9zbMath1336.68014MaRDI QIDQ287100

Yuan Ma, Serge A. Plotkin

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

distributed systemsinterconnection networksload balancing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (3)

On-line load balancing made simple: greedy strikes back ⋮ On-line load balancing of temporary tasks revisited ⋮ On-line restricted assignment of temporary tasks with unknown durations.

Cites Work

• Competitive snoopy caching
• An optimal on-line algorithm for metrical task system
• Online load balancing of temporary tasks
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved lower bound for load balancing of tasks with unknown duration