Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Minimizing the Flow Time Without Migration
SIAM Journal on Computing
Speed is more powerful than clairvoyance
Nordic Journal of Computing
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Mathematics of Operations Research
Greedy multiprocessor server scheduling
Operations Research Letters
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
Scheduling heterogeneous processors isn't as easy as you think
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling on identical machines using SRPT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved multi-processor scheduling for flow time and energy
Journal of Scheduling
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We analyze the shortest remaining processing time (SRPT) algorithm with respect to the problem of scheduling n jobs with release times on m identical machines to minimize total flow time. It is known that SRPT is optimal if m = 1 but that SRPT has a worst-case approximation ratio of Θ(min(log n/m, log Δ)) for this problem, where Δ is the ratio of the length of the longest job divided by the length of the shortest job. It has previously been shown that SRPT is able to use faster machines to produce a schedule as good as an optimal algorithm using slower machines. We now show that SRPT optimally uses these faster machines with respect to the worst-case approximation ratio. That is, if SRPT is given machines that are s ≥ 2 − 1/m times as fast as those used by an optimal algorithm, SRPT's flow time is at least s times smaller than the flow time incurred by the optimal algorithm. Clearly, no algorithm can offer a better worst-case guarantee, and we show that existing algorithms with similar performance guarantees to SRPT without resource augmentation do not optimally use extra resources.