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

DOI10.1016/S0020-0190(97)00085-9zbMATH Open1336.68014MaRDI QIDQ287100FDOQ287100

Authors: Yuan Ma, Serge Plotkin 

Publication date: 26 May 2016

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

Recommendations

• On-Line Load Balancing of Temporary Tasks
• Temporary tasks assignment resolved
• Online load balancing of temporary tasks
• scientific article; zbMATH DE number 1256657
• On-line load balancing

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)

Cites Work

• Competitive snoopy caching
• Title not available (Why is that?)
• An optimal on-line algorithm for metrical task system
• Title not available (Why is that?)
• Online load balancing of temporary tasks
• On-line load balancing with applications to machine scheduling and virtual circuit routing

Cited In (4)

• On-line restricted assignment of temporary tasks with unknown durations.
• On-line load balancing of temporary tasks revisited
• On-line load balancing made simple: greedy strikes back
• Load balancing of temporary tasks in the \(\ell _{p}\) norm

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

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