Multi-processor scheduling to minimize flow time with ε resource augmentation

DOI10.1145/1007352.1007411zbMath1192.68096OpenAlexW2170045213MaRDI QIDQ3580981

Amit Kumar, Chandra Chekuri, Ashish Goel, Sanjeev Khanna

Publication date: 15 August 2010

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.722

Mathematics Subject Classification ID

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

Related Items (16)

Serving in the Dark should be done Non-Uniformly ⋮ Scheduling on unrelated machines under tree-like precedence constraints ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ The efficiency-fairness balance of round robin scheduling ⋮ The Distributed Wireless Gathering Problem ⋮ Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Resource allocation optimization for quantitative service differentiation on server clusters ⋮ The bell is ringing in speed-scaled multiprocessor scheduling ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Greedy multiprocessor server scheduling ⋮ Sleep Management on Multiple Machines for Energy and Flow Time ⋮ Incremental medians via online bidding ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Unnamed Item

This page was built for publication: Multi-processor scheduling to minimize flow time with ε resource augmentation