@inproceedings{e7fb95cf144f4f7aaa7b5a6f38afb7a4,
title = "Scheduling jobs with varying parallelizability to reduce variance",
abstract = "We give a (2+ε)-speed O(1)-competitive algorithm for scheduling jobs with arbitrary speed-up curves for the ℓ2 norm of flow. We give a similar result for the broadcast setting with varying page sizes.",
keywords = "Online algorithms, Scheduling algorithms",
author = "Anupam Gupta and Sungjin Im and Ravishankar Krishnaswamy and Benjamin Moseley and Kirk Pruhs",
year = "2010",
doi = "10.1145/1810479.1810482",
language = "English (US)",
isbn = "9781450300797",
series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",
pages = "11--20",
booktitle = "SPAA'10 - Proceedings of the 22nd Annual Symposium on Parallelism in Algorithms and Architectures",
note = "22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'10 ; Conference date: 13-06-2010 Through 15-06-2010",
}