Scheduling for Overload in Real-Time Systems

Authors:
Sanjoy K. Baruah;Jayant R. Haritsa
Affiliations:
Univ. of Vermont, Burlington;Indian Institute of Science
Venue:
IEEE Transactions on Computers
Year:
1997

Citing 8
Cited 15

On-line scheduling in the presence of overload

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
ROBUST: a hardware solution to real-time overload

SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Efficient on-line processor scheduling for a class of IRIS (increasing reward with increasing service) real-time tasks

SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
On being optimistic about real-time constraints

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Implications of Classical Scheduling Results for Real-Time Systems

Computer
Best-effort decision-making for real-time scheduling

Best-effort decision-making for real-time scheduling

An Optimal Value-Based Admission Policy and its ReflectiveUse in Real-Time Systems

Real-Time Systems
Patience is a virtue: the effect of slack on competitiveness for admission control

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
On-Line Deadline Scheduling on Multiple Resources

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Firm Real-Time System Scheduling Based on a Novel QoS Constraint

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Patience is a virtue: the effect of slack on competitiveness for admission control

Journal of Scheduling - Special issue: On-line algorithm part I
A Technique for Adaptive Scheduling of Soft Real-Time Tasks

Real-Time Systems
Firm Real-Time System Scheduling Based on a Novel QoS Constraint

IEEE Transactions on Computers
A non-preemptive scheduling algorithm for soft real-time systems

Computers and Electrical Engineering
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay

Theoretical Computer Science
Competitive analysis of online real-time scheduling algorithms under hard energy constraint

Real-Time Systems
Handling overload of target sensitive real-time applications for increased system utility and improved resource usage

Proceedings of the 2011 ACM Symposium on Applied Computing
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

Journal of Experimental Algorithmics (JEA)
Overload provisioning in mixed-criticality cyber-physical systems

ACM Transactions on Embedded Computing Systems (TECS)
Automated analysis of real-time scheduling using graph games

Proceedings of the 16th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	15.00

Visualization

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 efficiently takes advantage of these limits to provide improved overload performance and is asymptotically optimal. We also introduce the concept of overload tolerance, wherein a system's overload performance never falls below its design capacity, and describe how ROBUST may be used to construct overload tolerant systems.