Sanjoy K. Baruah, Jayant R. Haritsa  Home/Search
Context Related
| dsl.serc.iisc.ernet.in/pub/eputoc.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: dsl.serc.iisc.erne...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: No on-line scheduling algorithm operating in an uniprocessor environment can guarantee to obtain a useful processor utilization greater than 0:25 under conditions of overload. This result holds in the general case where the deadlines of the input tasks can be arbitrarily "tight". We address here the issue of improving overload performance in environments where there is a limit on the tightness of task deadlines. In particular, we present a new scheduling algorithm, ROBUST, that... (Update)
Context of citations to this paper: More
...equal. The best currently known randomized upper bounds are equivalent to the deterministic results. utilization of a single processor [6], and Kalyanasundaram and Pruhs consider more general benefits associated with each job s completion [12] The advantage of increased slack...
...The algorithm ensures that overload situations are handled eciently with respect to the values of the dynamic tasks. 3] 2] [8], and [7] discuss overload handling based on earliest deadline rst scheduling. 1] presents scheduling scheme calculating priorities...
Cited by: More
Enhancing Time Triggered Scheduling with Value Based.. - Carlson, Lennvall.. (2003) (Correct)
Resource Management With Dynamic Scheduling In Parallel And.. - Manimaran (Correct)
On-line Admission Control and Packet Scheduling with.. - Garay, Naor, Yener, Zhao (2002) (Correct)
Similar documents (at the sentence level):
67.7%: Scheduling for Overload - In Real-Time Systems (Correct)
10.4%: ROBUST: A Hardware Solution to Real-Time Overload - Baruah, Haritsa (1993) (Correct)
Active bibliography (related documents): More All
0.4: On-Line Scheduling to Maximize Task Completions - Baruah, Haritsa, Sharma (1994) (Correct)
0.2: Overload Tolerance for Single-Processor Workloads. - Baruah (1998) (Correct)
0.2: Fast, Best-Effort Real-Time Scheduling Algorithms - Li, Ravindran (2004) (Correct)
Similar documents based on text: More All
0.6: Approximate Analysis of Real-Time Database Systems - Haritsa (1994) (Correct)
0.0: Project Technical Report for Sponsored Project HITA/ESE/JRH/001.. - Haritsa (1998) (Correct)
0.0: On Modeling Real-time Task Systems - Chen, Mok, Baruah (1996) (Correct)
Related documents from co-citation: More All
4: deadline scheduling in overload conditions (context) - Buttazzo, Spuri et al. - 1995
4: the Competitiveness of On-Line Real-Time Task Scheduling - Baruah, Koren et al. - 1991
3: Fundamental design problems of distributed systems for the hard real-time enviro.. (context) - Mok - 1983
BibTeX entry: (Update)
S. K. Baruah and J. R. Harista. Scheduling for overload in real-time systems. IEEE Transactions on Computers, 46(9):1034--1039, 1997. http://citeseer.ist.psu.edu/baruah97scheduling.html More
@article{ baruah97scheduling,
author = "Sanjoy K. Baruah and Jayant R. Hartisa",
title = "Scheduling for Overload in Real-Time Systems",
journal = "IEEE Transactions on Computers",
volume = "46",
number = "9",
pages = "1034-1039",
year = "1997",
url = "citeseer.ist.psu.edu/baruah97scheduling.html" }
Citations (may not include all citations):4212 Computers and intractability: A guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
1582 Scheduling Algorithms for Multiprogramming in a Hard RealTim.. - Liu, Layland - 1973
160 Fundamental Design Problems of Distributed Systems for the H.. (context) - Mok - 1983
127 Control robotics : the procedural control of physical proces.. (context) - Dertouzos - 1974
108 A Time-Driven Scheduling Model for Real-Time Operating Syste.. - Jensen, Carey et al. - 1985
105 Implications of classical scheduling results for real-time s.. - Stankovic, Spuri et al. - 1995
101 On Being Optimistic about Real-Time Constraints (context) - Haritsa, Carey et al. - 1990
98 Best-effort decision making for real-time scheduling (context) - Locke - 1986
82 Earliest-Deadline Scheduling for Real-Time Database Systems - Haritsa, Carey et al. - 1991
52 the competitiveness of on-line real-time task scheduling - Baruah, Koren et al. - 1991
50 over : An optimal on-line scheduling algorithm for overloade.. (context) - Koren, Shasha - 1992
46 line scheduling in the presence of overload (context) - Baruah, Koren et al. - 1991
43 The Integration of Deadline and Criticalness in Hard Real-Ti.. (context) - Biyabani, Stankovic et al. - 1988
23 line scheduling to maximize task completions - Baruah, Haritsa et al. - 1994
6 ROBUST: A Hardware Solution to Real-Time Overload - Baruah, Haritsa - 1993
5 Efficient On-Line Processor Scheduling for a Class of IRIS R.. (context) - Dey, Kurose et al. - 1993
1 Scheduling Survey In Hard Real-Time Systems Tutorial (context) - Cheng, Stankovic et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://dsl.serc.iisc.ernet.in/publications.html): More
Efficient Fair Disk Schedulers - Pradhan, Haritsa (Correct)
OSHADHI : A Biodiversity Information System - Vidya, Haritsa (1995) (Correct)
Commit Processing in Distributed Real-Time Database.. - Gupta, Haritsa.. (1996) (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