Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Speed is more powerful than clairvoyance
Nordic Journal of Computing
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Pull-based data broadcast with dependencies: be fair to users, not to items
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Non-clairvoyant scheduling with precedence constraints
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Scheduling jobs with varying parallelizability to reduce variance
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Minimizing maximum flowtime of jobs with arbitrary parallelizability
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
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
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Non-clairvoyant weighted flow time scheduling on different multi-processor models
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Non-clairvoyant weighted flow time scheduling with rejection penalty
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
Shortest-Elapsed-Time-First on a multiprocessor
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Brief announcement: online batch scheduling for flow objectives
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
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 |
We give a scalable ((1+ε)-speed O(1)-competitive) non-clairvoyant algorithm for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of average response time.