The TEXbook
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Operating systems (2nd ed.): design and implementation
Operating systems (2nd ed.): design and implementation
Online computation and competitive analysis
Online computation and competitive analysis
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Theoretical Computer Science - Selected papers in honor of Manuel Blum
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
Operating Systems Theory
Operating System Concepts
Competitive Analysis of the Round Robin Algorithm
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Approximation Algorithms for Average Stretch Scheduling
Journal of Scheduling
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)
Online Scheduling to Minimize Average Stretch
SIAM Journal on Computing
SIAM Journal on Computing
Web servers under overload: How scheduling can help
ACM Transactions on Internet Technology (TOIT)
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
ACM Transactions on Algorithms (TALG)
Greedy multiprocessor server scheduling
Operations Research Letters
Scheduling heterogeneous processors isn't as easy as you think
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online scheduling with general cost functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the performance of smith's rule in single-machine scheduling with nonlinear cost
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The complexity of scheduling for p-norms of flow and stretch
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Brief announcement: online batch scheduling for flow objectives
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern that these algorithms may be insufficiently fair to individual jobs. The standard method for balancing average QoS and fairness is to optimize the $\ell_p$ norm, $1SJF), and Shortest Remaining Processing Time (SRPT), are scalable for the $\ell_p$ norms of flow and stretch. We then show that the standard nonclairvoyant algorithm for optimizing average QoS, Shortest Elapsed Time First (SETF), is also scalable for the $\ell_p$ norms of flow. We then show that the online algorithm, Highest Density First (HDF), and the nonclairvoyant algorithm, Weighted Shortest Elapsed Time First (WSETF), are scalable for the weighted $\ell_p$ norms of flow. These results suggest that the concern that these standard algorithms may unnecessarily starve jobs is unfounded. In contrast, we show that the Round Robin, or Processor Sharing, algorithm, which is sometimes adopted because of its seeming fairness properties, is not $O(1+\epsilon)$-speed, $n^{o(1)}$-competitive for sufficiently small $\epsilon$.