Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan  Home/Search
Context Related
| belllabs.com/project/m...stretch.ps.gz ibm.com/cs/k53/papers/soda98.ps belllabs.com/projects/...stretch.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/project/mobius/ (more) From: belllabs.com/projects/mobius/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many servers, such as web and database servers, receive a continual stream of requests requiring vastly different amounts of processing time. The servers should schedule these requests to provide the "best" and "fairest" possible service to users. Standard strategies and the metrics they optimize while producing a schedule, are unfair since they may delay some job to an unbounded extent. We propose two new metrics to optimize, namely, max-flow and max-stretch; these metrics gauge the... (Update)
Cited by: More
Web servers under overload: How scheduling can help - Bianca Schroeder Mor (2002) (Correct)
Size-based Scheduling to Improve Web Performance MOR.. - Mukesh Agrawal Carnegie (Correct)
Non-clairvoyant Scheduling for Minimizing - Mean Slowdown Bansal (Correct)
Active bibliography (related documents): More All
0.5: Operator Scheduling in Data Stream Systems - Shivnath (2003) (Correct)
0.3: Goal-Oriented Memory Allocation In Database Management Systems - Brown (1995) (Correct)
0.2: Scheduling Support Mechanisms for Autonomous, Heterogeneous.. - Chapin (1993) (Correct)
Similar documents based on text: More All
0.1: Efficient Resource Scheduling in Multiprocessors - Chakrabarti (1996) (Correct)
0.1: A Statistically-based Switching Algorithm for ATM Network - Abuelyaman, Zhang (Correct)
0.1: Resource Scheduling for Parallel Database and Scientific .. - Chakrabarti.. (1996) (Correct)
Related documents from co-citation: More All
18: Scheduling to minimize average completion time: offline and on-line algorithms - Hall, Schulz et al. - 1996
15: Connection scheduling in web servers - Crovella, Frangioso et al. - 1999
13: Approximability and nonapproximability results for minimizing total flow time on.. - Kellerer, Tautenhahn et al. - 1996
BibTeX entry: (Update)
Michael Bender, Soumen Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998. http://citeseer.ist.psu.edu/bender98flow.html More
@inproceedings{ bender98flow,
author = "Michael A. Bender and Soumen Chakrabarti and S. Muthukrishnan",
title = "Flow and Stretch Metrics for Scheduling Continuous Job Streams",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1998",
url = "citeseer.ist.psu.edu/bender98flow.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
790 Analysis and simulation of a fair queueing algorithm (context) - Demers, Keshav et al. - 1989
389 Virtual clock: A new traffic control algorithm for packet sw.. (context) - Zhang
265 The Design of the UNIX Operating System (context) - Bach - 1986
204 Sequencing and scheduling: Algorithms and complexity (context) - Lawler, Lenstra et al. - 1993
200 A hierarchical CPU scheduler for multimedia operating system.. - Goyal, Guo et al.
187 Spawn: A distributed computational economy - Waldspurger, Hogg et al. - 1992
171 Scheduling to minimize average completion time: Off-line and.. - Hall, Shmoys et al. - 1996
171 Scheduling to minimize average completion time: offline and .. - Hall, Schulz et al. - 1997
152 Introduction to Sequencing and Scheduling (context) - Baker - 1974
49 Approximability and nonapproximability results for minimizin.. - Kellerer, Tautenhahn et al. - 1996
43 Improved scheduling algorithms for minsum criteria - Chakrabarti, Phillips et al. - 1996
42 lecture notes in computer science (context) - Sgall - 1997
42 Lecture Notes in Computer Science (context) - Pinedo - 1995
41 Approximating total flow time on parallel machines - Leonardi, Raz - 1997
39 Scheduling jobs that arrive over time (context) - Phillips, Stein et al. - 1995
22 Dynamic memory allocation for multiple-query workloads - Mehta, DeWitt - 1993
21 Bounds on multiprocessor timing anomalies (context) - Graham - 1969
19 Optimal time-critical scheduling via resource augmentation - Phillips, Stein et al. - 1997
17 Towards automated performance tuning for complex workloads - Brown, Mehta et al. - 1994
5 Dynamic task allocation in a distributed database system (context) - Carey, Livny et al.
2 and Joel Wein (context) - Karger, Stein - 1997
1 A seli-clocked fair queueing scheme for broadband applicatio.. (context) - Golestani - 1994
1 Approximation Algorithms for NP- Hard Problems (context) - Hall - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.bell-labs.com/project/mobius/): More
Scheduling On-demand Broadcasts: New Metrics and Algorithms - Acharya, Muthukrishnan (1998) (Correct)
Broadcast Disks: Data Management for Asymmetric Communication.. - Acharya (1995) (Correct)
Broadcast Disks: Dissemination-based Data Management for.. - Acharya (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC