Load balancing of temporary tasks in the \(\ell _{p}\) norm

DOI10.1016/J.TCS.2006.05.016zbMath1097.68019OpenAlexW2104484483MaRDI QIDQ2503355

Yossi Azar, Leah Epstein, Amir Epstein

Publication date: 14 September 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.016

zbMATH Keywords

online algorithmscompetitive ratioload balancing\(l_{p}\) normtemporary tasks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

Cites Work

• Unnamed Item
• Unnamed Item
• New algorithms for an ancient scheduling problem.
• Approximation schemes for scheduling on parallel machines
• A better lower bound for on-line scheduling
• Tighter bounds on a heuristic for a partition problem
• On-line scheduling revisited
• Off-line temporary tasks assignment.
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Algorithms for Scheduling Independent Tasks
• Better Bounds for Online Scheduling
• On-Line Load Balancing of Temporary Tasks on Identical Machines
• A Better Algorithm for an Ancient Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm

This page was built for publication: Load balancing of temporary tasks in the \(\ell _{p}\) norm