Scalably scheduling processes with arbitrary speedup curves

Authors:
Jeff Edmonds;Kirk Pruhs
Affiliations:
York University, Canada;University of Pittsburgh, PA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2012

Citing 15
Cited 1

Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Scheduling in the dark

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
Online scheduling to minimize the maximum delay factor

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete 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
Non-clairvoyant batch sets scheduling: fairness is fair enough

ESA'07 Proceedings of the 15th annual European conference on Algorithms
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

Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a scalable ((1+ε)-speed O(1)-competitive) nonclairvoyant algorithm for scheduling jobs with sublinear nondecreasing speedup curves on multiple processors with the objective of average response time.