Bala Kalyanasundaram, Kirk Pruhs  Home/Search
Context Related
| pitt.edu/~kirk/papers/esa97.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/~kirk/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We use competitive analysis to study how to best use redundancy to achieve faulttolerance in online real-time scheduling. We show that the optimal way to use spatial redundancy depends on a complex interaction of the benefits, execution times, release times, and latest start times of the jobs. We give a randomized online algorithm whose competitive ratio is O(log \Phi log \Delta log 2 n log m log log m ) for transient faults. Here n is the number of jobs, m is the number of processors, \Phi ... (Update)
Similar documents based on text: More All
0.3: Evaluating the Local Ratio Algorithm for Dynamic Storage.. - Pruhs, Wiewiora (2002) (Correct)
0.3: Middleware Support for Multicast-based Data.. - Chrysanthis.. (2001) (Correct)
0.2: Dynamic Spectrum Allocation: The Impotency of Duration.. - Kalyanasundaram, Pruhs (2000) (Correct)
BibTeX entry: (Update)
B. Kalyanasundaram, and K. Pruhs, "Faulttolerant real-time scheduling", Technical Report, CS Dept., University of Pittsburgh, 1994. http://citeseer.ist.psu.edu/kalyanasundaram97faulttolerant.html More
@inproceedings{ kalyanasundaram97faulttolerant,
author = "Bala Kalyanasundaram and Kirk Pruhs",
title = "Fault-Tolerant Real-Time Scheduling",
booktitle = "European Symposium on Algorithms",
pages = "296-307",
year = "1997",
url = "citeseer.ist.psu.edu/kalyanasundaram97faulttolerant.html" }
Citations (may not include all citations):92 Speed is as powerful as clairvoyance - Kalyanasundaram, Pruhs - 1995
73 Online interval scheduling - Lipton, Tomkins - 1994
52 the competitiveness of on-line real-time task scheduling - Baruah, Koren et al. - 1992
34 MOCA: A multiprocessor on-line competitive algorithm for rea.. - Koren, Shasha - 1994
29 Formal techniques in real-time and fault-tolerant systems (context) - Vytopil - 1993
23 line scheduling to maximize task completions - Baruah, Harita et al. - 1994
17 line scheduling of jobs with fixed start and end time (context) - Woeginger - 1994
15 and D. Shasha, "D over :An optimal on-line scheduling algori.. (context) - Koren - 1992
15 Fault-tolerant scheduling - Kalyanasundaram, Pruhs - 1994
13 line scheduling with hard deadlines - Goldman, Parwatikar et al. - 1997
2 Randomized algorithms for real-time scheduling with fault-to.. - Kalyanasundaram, Pruhs - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.pitt.edu/~kirk/papers/index.html): More
An Optimal Deterministic Algorithm for Online b-Matching - Kalyanasundaram, Pruhs (Correct)
Fault-Tolerant Scheduling - Kalyanasundaram, al. (1994) (Correct)
Maximizing Job Completions Online - Kalyanasundaram, Pruhs (1998) (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