Scalably scheduling processes with arbitrary speedup curves
Authors:
Open Access
- 24 July 2012
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Algorithms
- Vol. 8 (3) , 1-10
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.Keywords
This publication has 11 references indexed in Scilit:
- Speed scaling of processes with arbitrary speedup curves on a multiprocessor2009
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machinesJournal of the ACM, 2004
- On the Competitiveness of AIMD-TCP within a General NetworkLecture Notes in Computer Science, 2004
- Multicast Pull Scheduling: When Fairness Is FineAlgorithmica, 2003
- Minimizing flow time nonclairvoyantlyJournal of the ACM, 2003
- TCP is competitive against a limited adversary2003
- Optimal Time-Critical Scheduling via Resource AugmentationAlgorithmica, 2002
- Speed is as powerful as clairvoyanceJournal of the ACM, 2000
- Scheduling in the darkTheoretical Computer Science, 2000
- Nonclairvoyant schedulingTheoretical Computer Science, 1994