Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling optimization for resource-intensive Web requests on server clusters
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
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
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
STOC '01 Proceedings of the thirty-third 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
Operating System Concepts
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Minimizing flow time nonclairvoyantly
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Journal of Scheduling
Scheduling search procedures: The wheel of fortune
Journal of Scheduling
ACM Transactions on Algorithms (TALG)
Optimal online algorithms on two hierarchical machines with resource augmentation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We consider the problem of scheduling jobs online nonclairvoyantly, that is, when job sizes are not known. Our focus is on minimizing mean slowdown, defined as the ratio of flow time to the size of the job. We use resource augmentation in terms of allowing a faster processor to the online algorithm to make up for its lack of knowledge of job sizes.Our main result is an O(1)-speed O(log2 B)-competitive algorithm for minimizing mean slowdown non-clairvoyantly, when B is the ratio between the largest and smallest job sizes. On the other hand, we show that any O(1)-speed algorithm, deterministic or randomized, is at least 驴(logB) competitive.The motivation for bounded job sizes is supported by an 驴(n) lower bound for arbitrary job sizes, where n is the number of jobs. Furthermore, a lower bound of 驴(B) justifies the need for resource augmentation even with bounded job sizes. For the static case, i.e. when all jobs arrive at time 0, we give an O(logB) competitive algorithm which does not use resource augmentation and a matching 驴(logB) lower bound on the competitiveness.