Server scheduling in the L p norm

DOI10.1145/780542.780580MaRDI QIDQ3581295zbMATH OpenOpenAlexFDO

Authors N. Bansal, Kirk 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

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

Cited in

(13)

• Rejecting jobs to minimize load and maximum flow-time
• A system-centric metric for the evaluation of online job schedules
• Greedy multiprocessor server scheduling
• 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
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Resource augmentation for weighted flow-time explained by dual fitting
• Approximating the norms of graph spanners
• Taming tail latency in key-value stores: a scheduling perspective
• A PTAS for minimizing weighted flow time on a single machine
• A scheduling framework for distributed key-value stores and its application to tail latency minimization
• Scheduling to minimize staleness and stretch in real-time data warehouses
• Minimizing weighted flow time

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

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