Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth 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
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
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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)
Minimizing average flow time on related machines
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimizing Average Flow-time: Upper and Lower Bounds
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Non-Preemptive Min-Sum Scheduling with Resource Augmentation
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Minimizing Total Flow-Time: The Unrelated Case
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Better algorithms for minimizing average flow-time on related machines
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Scalably scheduling power-heterogeneous processors
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Resource augmentation for weighted flow-time explained by dual fitting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
An online scalable algorithm for minimizing lk-norms of weighted flow time on unrelated machines
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Shortest-Elapsed-Time-First on a multiprocessor
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Competitive online algorithms for multiple-machine power management and weighted flow time
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We consider the online problem of scheduling jobs on unrelated machines so as to minimize the total weighted flow time. This problem has an unbounded competitive ratio even for very restricted settings. In this paper we show that if we allow the machines of the online algorithm to have ε more speed than those of the offline algorithm then we can get an O((1+ε-1)2)-competitive algorithm. Our algorithm schedules jobs preemptively but without migration. However, we compare our solution to an offline algorithm which allows migration. Our analysis uses a potential function argument which can also be extended to give a simpler and better proof of the randomized immediate dispatch algorithm of Chekuri-Goel-Khanna-Kumar for minimizing average flow time on parallel machines.