Scheduling jobs with varying parallelizability to reduce variance

Authors:
Anupam Gupta;Sungjin Im;Ravishankar Krishnaswamy;Benjamin Moseley;Kirk Pruhs
Affiliations:
Carnegie Mellon University, Pittsburgh, PA, USA;University of Illinois, Urbana, IL, USA;Carnegie Mellon University, Pittsburgh, PA, USA;University of Illinois, Urbana, IL, USA;University of Pittsburgh, Pittsburgh, PA, USA
Venue:
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Year:
2010

Citing 13
Cited 6

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
Operating System Concepts, 4th Ed.

Operating System Concepts, 4th Ed.
Minimizing flow time nonclairvoyantly

Journal of the ACM (JACM)
Non-clair voy ant multiprocessor scheduling of jobs with changing execution characteristics

Journal of Scheduling - Special issue: On-line scheduling
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
Non-clairvoyant scheduling with precedence constraints

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scalably scheduling processes with arbitrary speedup curves

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

Minimizing maximum flowtime of jobs with arbitrary parallelizability

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A tutorial on amortized local competitiveness in online scheduling

ACM SIGACT News
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a (2+ε)-speed O(1)-competitive algorithm for scheduling jobs with arbitrary speed-up curves for the l2 norm of flow. We give a similar result for the broadcast setting with varying page sizes.