Scalably scheduling processes with arbitrary speedup curves

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.

Saved in:
Bibliographic Details
Published in:ACM transactions on algorithms 2012-07, Vol.8 (3), p.1-10
Main Authors: Edmonds, Jeff, Pruhs, Kirk
Format: Article
Language:English
Subjects:
Algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1549-6325
1549-6333
DOI:10.1145/2229163.2229172