Nikhil Bansal  @ NUS Home/Search
Context
Related
| cmu.edu/anon/2003/CMUCS03209.ps Cached: PS.gz PS PDF Image Update Help From: cmu.edu/anon/2003/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study scheduling algorithms for problems arising in client-server systems. In the client-server setting, there are multiple clients that submit requests for service to the server(s) over time. Typical examples of such systems include operating systems, web-servers and database query servers. As there could be multiple clients requesting a service, the goal of a scheduling algorithm is to provide service to the clients in some reasonable way. A natural measure of the quality of service... (Update)
Active bibliography (related documents): More All
2.4: Online Scheduling - Pruhs, Sgall, Torng (2003) (Correct)
2.2: Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
1.7: Algorithms for Flow Time Scheduling - Bansal (Correct)
Similar documents based on text: More All
0.3: Scheduling for Flow-Time with Admission Control - Bansal, Blum, Chawla, Dhamdhere (Correct)
0.2: Finding (Recently) Frequent Items in Distributed Data.. - Manjhi, Shkapenyuk.. (2005) (Correct)
0.2: Probabilistic and On-line Methods in Machine Learning - Kalai (2001) (Correct)
BibTeX entry: (Update)
@misc{ bansal-algorithms,
author = "Nikhil Bansal",
title = "Algorithms for Flow Time Scheduling",
url = "citeseer.comp.nus.edu.sg/682654.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP Co.. (context) - Garey, Johnson - 1979
488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
373 Cambridge University Press (context) - Hardy, Littlewood et al. - 1952
318 Approximation algorithms for NP-hard problems (context) - Hochbaum - 1997
306 Inequalities: Theory of Majorization and Its Applications (context) - Marshall, Olkin - 1979
204 Sequencing and scheduling: algorithms and complexity (context) - Lawler, Lenstra et al. - 1993
171 Scheduling to minimize average completion time revisited: De.. - Megow, Schulz - 2003
171 Scheduling to minimize average completion time: Off-line and.. - Hall, Shmoys et al. - 1996
135 Theory of Scheduling (context) - Conway, Maxwell et al. - 1967
109 Operating systems: design and implementation (context) - Tanenbaum - 2001
96 Scheduling Algorithms (context) - Brucker - 2001
95 Complexity of machine scheduling problems (context) - Lenstra, Kan et al. - 1977
92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 2000
92 Using dual approximation algorithms for scheduling problems .. (context) - Hochbaum, Shmoys - 1987
92 Scheduling parallel machines on-line (context) - Shmoys, Wein et al. - 1995
91 Approximation Algorithms (context) - Vazirani - 2001
87 Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1990
77 Computer networking: A top-down approach featuring the Inter.. (context) - Kurose, Ross - 2002
77 Computer Networking: A Top-Down Approach Featuring the Inter.. (context) - Kurose, Ross - 2001
65 Connection scheduling in web servers - Crovella, Frangioso et al. - 1999
64 Analysis of SRPT scheduling: Investigating unfairness - Bansal, Harchol-Balter - 2001
54 Approximation techniques for average completion time schedul.. - Chekuri, Motwani et al. - 2001
54 Optimal time-critical scheduling via resource augmentation - Phillips, Stein et al. - 1997
50 Flow and stretch metrics for scheduling continuous job strea.. - Bender, Chakrabarti et al. - 1998
49 Approximability and nonapproximability results for minimizin.. - Kellerer, Tautenhahn et al. - 1996
43 Algorithms and Systems (context) - Pinedo, Theory - 1995
41 Approximating total flow time on parallel machines - Leonardi, Raz - 1997
35 Exact and approximate algorithms for scheduling nonidentical.. (context) - Horowitz, Sahni - 1976
32 Heuristic Scheduling Systems : With Applications to Producti.. (context) - Morton, Pentico - 1993
31 Approximation schemes for minimizing average weighted comple.. - Afrati, Bampis et al. - 1999
29 Approximation algorithms for scheduling (context) - Hall - 1997
25 Load balancing in the l p norm - Awerbuch, Azar et al. - 1995
25 Theoretical Computer Science (context) - Motwani, Phillips et al. - 1994
22 Line Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
21 Scheduling algorithms - Karger, Stein et al. - 1999
20 Polyhedral approaches to machine scheduling - Queyranne, Schulz - 1994
20 Single machine scheduling with release dates - Goemans, Queyranne et al. - 2002
20 Online scheduling to minimize average stretch - Muthukrishnan, Rajaraman et al. - 1999
18 Non-approximability results for scheduling problems with min.. - Hoogeveen, Schuurman et al. - 1998
18 Multiprocessor scheduling with rejection - Bartal, Leonardi et al. - 1996
16 Scheduling optimization for resource-intensive web requests .. - Zhu, Smith et al. - 1999
15 Approximation schemes for scheduling - Alon, Azar et al. - 1997
13 Web servers under overload: how scheduling can help - Schroeder, Harchol-Balter
11 Minimizing flow time nonclairvoyantly - Kalyanasundaram, Pruhs - 1997
10 Improved approximation schemes for scheduling unrelated para.. - Jansen, Porkolab - 1999
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
10 Scheduling to minimize average stretch without migration - Becchetti, Leonardi et al. - 2000
9 Online scheduling (context) - Sgall - 1998
9 The power of alpha-points in preemptive single machine sched.. - Schulz, Skutella - 2002
9 Improved algorithms for stretch scheduling - Bender, Muthukrishnan et al. - 2002
9 Minimizing the flow time without migration - Awerbuch, Azar et al. - 1999
8 Approximation schemes for scheduling on uniformly related an.. - Epstein, Sgall - 1999
8 The case for srpt scheduling of web servers (context) - Harchol-Balter, Crovella et al.
8 Online weighted flow time and deadline scheduling - Becchetti, Leonardi et al. - 2001
8 Theoretical Computer Science (context) - Edmonds, the - 2000
7 Preemptive multiprocessor scheduling with rejection - Seiden - 2001
7 Techniques for scheduling with rejection - Engels, Karger et al. - 1998
6 Non-clairvoyant scheduling for minimizing mean slowdown (context) - Bansal, Dhamdhere et al. - 2003
6 The Bell System Technical Journal (context) - Thompson - 1931
6 Algorithms for weighted flow time (context) - Chekuri, Khanna et al. - 2001
6 Polynomial time approximation algorithms for machine schedul.. - Schuurman, Woeginger - 1999
5 Approximation schemes for preemptive weighted flow time - Chekuri, Khanna - 2002
5 Minimizing weighted flow time - Bansal, Dhamdhere - 2003
3 Preemptive scheduling with rejection - Hoogeveen, Skutella et al. - 2000
3 norm: A rising tide lifts all boats (context) - Bansal, Pruhs et al. - 2003
2 Semi-clairvoyant scheduling (context) - Becchetti, Leonardi et al. - 2003
1 Minimizing total flow time and completion time with immediat.. (context) - Avrahami, Azar - 2003
1 Multi-processor scheduling to minimize # p norms of flow and.. (context) - Chekuri, Khanna et al. - 2003
1 Server scheduling in the weighted # p norm (context) - Bansal, Pruhs - 2004
1 Handbook on Scheduling: Algorithms (context) - Pruhs, Sgall et al.
1 Scheduling in Real-Time Systems (context) - Cottet, Delacroix et al. - 2002
http://www.netcraft.com/survey/
http://httpd.apache.org/docs/
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/2003/): More
A Type System for Well-Founded Recursion - Dreyer, Harper, Crary (2003) (Correct)
Approximation Schemes for Flow Time on Multiple Machines - Bansal (2003) (Correct)
Protecting Privacy in Key-Value Search Systems - Xie, O'Hallaron, Reiter (2003) (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.