Amortized efficiency of list update and paging rules
Communications of the ACM
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Minimizing the flow time without migration
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
Dynamic Memory Allocation for Multiple-Query Workloads
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Developments from a June 1996 seminar on Online algorithms: the state of the art
A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing
A Scheduling Framework for Web Server Clusters with Intensive Dynamic Content Processing
Algorithms and theory of computation handbook
Scheduling to minimize average stretch without migration
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation schemes for preemptive weighted flow time
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
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
SRPT Scheduling for Web Servers
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Online real-time preemptive scheduling of jobs with deadlines
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Tool for Controlling Response Time in Real-Time Systems
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
Approximation Algorithms for Average Stretch Scheduling
Journal of Scheduling
Average stretch without migration
Journal of Computer and System Sciences
Enhancing both network and user performance for networks supporting best effort traffic
IEEE/ACM Transactions on Networking (TON)
Scheduling data transfers in a network and the set scheduling problem
Journal of 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
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The Granularity Metric for Fine-Grain Real-Time Scheduling
IEEE Transactions on Computers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Minimizing the stretch when scheduling flows of biological requests
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Revisiting unfairness in web server scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient scheduling of heterogeneous continuous queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Theoretical Computer Science
ACM SIGMETRICS Performance Evaluation Review
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
ACM Transactions on Algorithms (TALG)
Algorithms and metrics for processing multiple heterogeneous continuous queries
ACM Transactions on Database Systems (TODS)
Scheduling despite inexact job-size information
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Minimizing the stretch when scheduling flows of divisible requests
Journal of Scheduling
Scheduling shared scans of large data files
Proceedings of the VLDB Endowment
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Online scheduling of malleable parallel jobs
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
A moldable online scheduling algorithm and its application to parallel short sequence mapping
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
Enhancements to the decision process of the self-tuning dynp scheduler
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
Journal of Parallel and Distributed Computing
On the value of preemption in scheduling
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Greedy multiprocessor server scheduling
Operations Research Letters
A segmentation approach for file broadcast scheduling
Journal of Parallel and Distributed Computing
Stretch optimization for virtual screening on multi-user pilot-agent platforms on grid/cloud
Proceedings of the Fourth Symposium on Information and Communication Technology
Decoupled speed scaling: Analysis and evaluation
Performance Evaluation
Hi-index | 0.00 |
We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of time that the job spends in the system to the processing time of the job. For a given sequence of jobs, we measure the performance of an algorithm by the average stretch achieved by the algorithm over all the jobs in the sequence. The average stretch metric has been used to evaluate the performance of scheduling algorithms in many applications arising in databases, networks and systems; however, no formal analysis of scheduling algorithms is known for the average stretch metric.The main contribution of this paper is to show that the shortest remaining processing time algorithm (SRPT) is O(1)-competitive with respect to average stretch for both uniprocessors as well as multiprocessors. For uniprocessors, we prove that SRPT is 2-competitive; we also establish an essentially matching lower bound on the competitive ratio of SRPT. For multiprocessors, we show that the competitive ratio of SRPT is at most 14. Furthermore, we establish constant-factor lower bounds on the competitive ratio of any on-line algorithm for both uniprocessors and multiprocessors.