Multi-processor scheduling to minimize flow time with resource augmentation
DOI10.1145/1007352.1007411zbMATH Open1192.68096OpenAlexW2170045213MaRDI QIDQ3580981FDOQ3580981
Authors: Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar 
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
Recommendations
- Optimal on-line flow time with resource augmentation
- Mathematical Foundations of Computer Science 2005
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- scientific article; zbMATH DE number 1839473
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (20)
- Incremental medians via online bidding
- Scheduling on unrelated machines under tree-like precedence constraints
- Greedy multiprocessor server scheduling
- Resource augmentation for weighted flow-time explained by dual fitting
- Serving in the dark should be done non-uniformly
- Optimizing the stretch of independent tasks on a cluster: from sequential tasks to moldable tasks
- Resource allocation optimization for quantitative service differentiation on server clusters
- The efficiency-fairness balance of round robin scheduling
- Non-clairvoyantly scheduling to minimize convex functions
- Title not available (Why is that?)
- Improved multi-processor scheduling for flow time and energy
- Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
- Fair scheduling via iterative quasi-uniform sampling
- Mathematical Foundations of Computer Science 2005
- New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
- The bell is ringing in speed-scaled multiprocessor scheduling
- Optimal time-critical scheduling via resource augmentation
- Rejecting jobs to minimize load and maximum flow-time
- The Distributed Wireless Gathering Problem
- Sleep management on multiple machines for energy and flow time
This page was built for publication: Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580981)
