Shortest-Elapsed-Time-First on a multiprocessor

Authors:
Neal Barcelo;Sungjin Im;Benjamin Moseley;Kirk Pruhs
Affiliations:
Department of Computer Science, University of Pittsburgh, United States;Computer Science Department, University of Illinois, United States;Computer Science Department, University of Illinois, United States;Department of Computer Science, University of Pittsburgh, United States
Venue:
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Year:
2012

Citing 11
Cited 0

Nonclairvoyant scheduling

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

Journal of the ACM (JACM)
Multi-processor scheduling to minimize flow time with ε resource augmentation

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Minimizing weighted flow time

ACM Transactions on Algorithms (TALG)
Scalably scheduling processes with arbitrary speedup curves

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation

Proceedings of the forty-first annual ACM symposium on Theory of computing
Better scalable algorithms for broadcast scheduling

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A tutorial on amortized local competitiveness in online scheduling

ACM SIGACT News
Scheduling heterogeneous processors isn't as easy as you think

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Nonclairvoyant Speed Scaling for Flow and Energy

Algorithmica
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor

Theory of Computing Systems - Special Issue: Parallelism in Algorithms and Architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that SETF, the idealized version of the uniprocessor scheduling algorithm used by Unix, is scalable for the objective of fractional flow on a homogeneous multiprocessor. We also give a potential function analysis for the objective of weighted fractional flow on a uniprocessor.