Nikhil Bansal, Kirk Pruhs  @ NUS Home/Search
Context
Related
| cmu.edu/papers/pdfs/y2003/sersl.pdf Cached: PDF PS.gz PS Image Update Help From: cmu.edu/papers/...ubmit+search%21 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Nikhil Bansal Carnegie Mellon University nikhil@cs.cmu.edu Kirk Pruhs University of Pittsburgh kirk@cs.pitt.edu ABSTRACT Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insu#ciently fair to individual jobs. The standard method for balancing average QoS and fairness is optimize the Lp metric, 1 <p<#. Thus we consider server scheduling strategies to optimize the Lp norms of... (Update)
Active bibliography (related documents): More All
2.2: Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
2.2: Algorithms for Flow Time Scheduling - Bansal (2003) (Correct)
1.1: Online Scheduling - Pruhs, Sgall, Torng (2003) (Correct)
Similar documents based on text: More All
0.3: Approximation Algorithms for Deadline-TSP and Vehicle .. - Bansal, Blum.. (2004) (Correct)
0.2: Upper Bounds for MaxSat: Further Improved - Bansal, Raman (1999) (Correct)
0.2: Another Look at Whether a Rising Tide Lifts All Boats - Hines, Jr., Hoynes, Krueger (2001) (Correct)
BibTeX entry: (Update)
@misc{ bansal-server,
author = "Nikhil Bansal and Kirk Pruhs",
title = "Server Scheduling in the L_p Norm: A Rising Tide Lifts All Boat (Extended
Abstract)",
url = "citeseer.comp.nus.edu.sg/684768.html" }
Citations (may not include all citations):109 Operating systems: design and implementation (context) - Tanenbaum - 2001
92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 2000
77 Computer networking: A top-down approach featuring the Inter.. (context) - Kurose, Ross - 2002
65 Connection scheduling in web servers - Crovella, Frangioso et al. - 1999
64 Analysis of srpt scheduling: Investigating unfairness - Bansal, Harchol-Balter - 2001
54 Optimal time-critical scheduling via resource augmentation - Phillips, Stein et al. - 1997
25 Theoretical Computer Science (context) - Motwani, Phillips et al. - 1994
25 Load balancing in the l p norm - Awerbuch, Azar et al. - 1995
22 Line Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
20 Online scheduling to minimize average stretch - Muthukrishnan, Rajaraman et al. - 1999
15 Approximation schemes for scheduling - Alon, Azar et al. - 1997
15 Fault-tolerant scheduling - Kalyanasundaram, Pruhs - 1994
13 Web servers under overload: how scheduling can help - Schroeder, Harchol-Balter
11 Minimizing flow time nonclairvoyantly - Kalyanasundaram, Pruhs - 1997
10 Non-clairvoyant scheduling to minimize the average flow time.. (context) - Becchetti, Leonardi - 2001
10 Ancient and new algorithms for load balancing in the l p nor.. - Avidor, Azar et al. - 2001
9 Improved algorithms for stretch scheduling - Bender, Muthukrishnan et al. - 2002
8 Online weighted flow time and deadline scheduling - Becchetti, Leonardi et al. - 2001
8 The case for srpt scheduling of web servers (context) - Harchol-Balter, Crovella et al.
8 Approximation schemes for scheduling on uniformly related an.. - Epstein, Sgall - 1999
8 Theoretical Computer Science (context) - Edmonds, the - 2000
6 Algorithms for weighted flow time (context) - Chekuri, Khanna et al. - 2001
6 Non-clairvoyant scheduling for minimizing mean slowdown (context) - Bansal, Dhamdhere et al. - 2003
6 The Bell System Technical Journal (context) - Thompson - 1931
5 Minimizing weighted flow time - Bansal, Dhamdhere - 2003
5 Approximation schemes for preemptive weighted flow time - Chekuri, Khanna - 2002
http://httpd.apache.org/docs/
http://www.netcraft.com/survey/
Documents on the same site (http://www.aladdin.cs.cmu.edu/papers/test.php?author=&title=&year=all+years&submit=Submit+search%21): More
Improving Index Performance through Prefetching - Chen, Gibbons, Todd (2001) (Correct)
Boosting and Maximum Likelihood for Exponential Models - Lebanon, Lafferty (2001) (Correct)
A Push-Relabel Framework for Submodular Function.. - FLEISCHER, IWATA (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.