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

DOI10.1016/S0020-0190(97)00085-9MaRDI QIDQ287100zbMATH OpenFDO

Authors Yuan Ma, Serge 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)

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

Cites work

• scientific article; zbMATH DE number 1256657 (Why is no real title available?)
• scientific article; zbMATH DE number 742966 (Why is no real title available?)
• An optimal on-line algorithm for metrical task system
• Competitive snoopy caching
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Online load balancing of temporary tasks

Cited in

(4)

• Load balancing of temporary tasks in the \(\ell _{p}\) norm
• 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

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)