Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Scheduling to minimize average stretch without migration
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A unified analysis of hot video schedulers
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved algorithms for stretch scheduling
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Preemptive Scheduling in Overloaded Systems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Online Weighted Flow Time and Deadline Scheduling
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Maximizing Job Completions Online
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Non-migratory online deadline scheduling on multiprocessors
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGACT News
| Hi-index | 0.00 |
This paper studies online job scheduling on multiprocessors and, in particular, investigates the algorithms SRPT and SJF for minimizing total stretch, where the stretch of a job is its flow time (response time) divided by its processing time. SRPT is perhaps the most well-studied algorithm for minimizing total flow time or stretch. This paper gives the first resource augmentation analysis of the total stretch of SRPT, showing that it is indeed O(1)-speed 1-competitive. This paper also gives a simple lower bound result that SRPT is not s-speed 1-competitive for any s This paper also makes contribution to the analysis of SJF. Extending the work of [4], we are able to show that SJF is O(1)-speed 1-competitive for minimizing total stretch. More interestingly, we find that the competitiveness of SJF can be reduced arbitrarily by increasing the processor speed (precisely, SJF is O(s)-speed (1/s)-competitive for any s ≥ 1). We conjecture that SRPT also admits a similar result.