Bala Kalyanasundaram, Kirk Pruhs  Home/Search
Context Related
| pitt.edu/~kirk/papers/focs.ps 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: pitt.edu/~kalyan/alg (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider several well known nonclairvoyant scheduling problems, including the problem of minimizing the average response time, and best-effort firm real-time scheduling. It is known that there are no deterministic online algorithms for these problems with bounded (or even polylogarithmic in the number of jobs) competitive ratios. We show that moderately increasing the speed of the processor used by the nonclairvoyant scheduler effectively gives this scheduler the power of clairvoyance.... (Update)
Similar documents based on text: More All
0.5: Minimizing Flow Time Nonclairvoyantly - Kalyanasundaram, Pruhs (1997) (Correct)
0.5: Fault-Tolerant Scheduling - Kalyanasundaram, al. (1994) (Correct)
0.4: With Extra Bandwidth and Time for Adjustment TCP is.. - Edmonds, Datta, Dymond (Correct)
BibTeX entry: (Update)
B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In Proceedings of the 36th Symposium on Foundations of Computer Science, pages 214--221, October 1995. http://citeseer.ist.psu.edu/kalyanasundaram95speed.html More
@inproceedings{ kalyanasundaram95speed,
author = "Bala Kalyanasundaram and Kirk Pruhs",
title = "Speed is as Powerful as Clairvoyance",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "214-221",
year = "1995",
url = "citeseer.ist.psu.edu/kalyanasundaram95speed.html" }
Citations (may not include all citations):488 Amortized efficiency of list update and paging rules (context) - Sleator, Tarjan - 1985
334 Operating System Concepts (context) - Galvin, Silverschatz - 1994
66 Beyond competitive analysis - Koutsoupias, Papadimitriou - 1994
52 the competitiveness of on-line realtime task scheduling - Baruah, Koren et al. - 1992
46 line scheduling in the presence of overload (context) - Baruah, Koren et al. - 1991
34 MOCA: a multiprocessor on-line competitive algorithm for rea.. - Koren, Shasha - 1994
24 Nonclairvoyant scheduling - Motwani, Phillips et al. - 1993
23 line scheduling to maximize task completions - Baruah, Haritsa et al. - 1994
18 A new measure for the study of on-line algorithms (context) - Ben-David, Borodin - 1994
17 line scheduling of jobs with fixed start and end time (context) - Woeginger - 1994
10 A statistical adversary for on-line algorithms (context) - Raghavan - 1992
8 Faulttolerant real-time scheduling - Kalyanasundaram, Pruhs - 1994
8 The k-server dual and loose competitiveness for paging - Young - 1994
7 Competitive analysis of the round robin algorithm (context) - Matsumoto - 1992
7 The online transportation problem - Kalyanasundaram, Pruhs - 1995
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
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