Scheduling for Overload in Real-Time Systems

Baruah, Sanjoy K and Haritsa, Jayant R (1997) Scheduling for Overload in Real-Time Systems. In: IEEE Transactions on Computers, 46 (9). pp. 1034-1039.

Preview

PDF overload.pdf Download (72kB)

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.

Item Type:	Journal Article
Publication:	IEEE Transactions on Computers
Publisher:	IEEE
Additional Information:	©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Real-time systems;Uniprocessor scheduling;Overload tolerance;Performance evaluation;Processor utilization
Department/Centre:	Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:14
URI:	http://eprints.iisc.ac.in/id/eprint/1103

Actions (login required)

View Item