Server scheduling in the L p norm

DOI10.1145/780542.780580zbMath1192.90062OpenAlexW2133663637MaRDI QIDQ3581295

Nikhil Bansal, Kirk R. Pruhs

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780580

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 (9)

Rejecting jobs to minimize load and maximum flow-time ⋮ Unnamed Item ⋮ A system-centric metric for the evaluation of online job schedules ⋮ Greedy multiprocessor server scheduling ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ Scheduling to minimize staleness and stretch in real-time data warehouses ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine ⋮ Unnamed Item

This page was built for publication: Server scheduling in the L _p norm