Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service

DOI10.1137/090772228zbMath1209.68058OpenAlexW1972337144MaRDI QIDQ5390597

Nikhil Bansal, Kirk R. Pruhs

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/server-scheduling-to-balance-priorieties-fairness-and-average-qualityof-service(16b95b13-50c3-4537-abce-bb00e73b8dc3).html

zbMATH Keywords

schedulingflow timeresource augmentationshortest job firstshortest remaining processing timemultilevel feedbackshortest elapsed time first

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

A unified framework for designing EPTAS for load balancing on parallel machines ⋮ The benefit of preemption with respect to the \(\ell_p\) norm ⋮ Online covering with \(\ell_q\)-norm objectives and applications to network design ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item