Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

52

Voted

PE
2002
Springer

favoriteEmaildiscussreport

134views Optimization» more PE 2002»

Asymptotic convergence of scheduling policies with respect to slowdown

14 years 10 months ago

Asymptotic convergence of scheduling policies with respect to slowdown

Download www.cs.caltech.edu

Mor Harchol-Balter, Karl Sigman, Adam Wierman

Real-time Traffic

Optimization | PE 2002 |

claim paper

Related Content

» Quantifying the Properties of SRPT Scheduling

» Revisiting unfairness in Web server scheduling

» Understanding the slowdown of large jobs in an MGI1 system

» Classifying scheduling policies with respect to unfairness in an MGI1

» Searchbased Job Scheduling for Parallel Computer Workloads

» Asymptotically optimal transmission policies for lowpower wireless sensor networks

» Delay Guarantees for ThroughputOptimal Wireless Link Scheduling

» TimeSharing Parallel Jobs in the Presence of Multiple Resource Requirements

» A Stochastic Framework for Scheduling in Wireless Packet Access Networks

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	PE
Authors	Mor Harchol-Balter, Karl Sigman, Adam Wierman

Comments (0)