By Topic

Fault-tolerant real-time scheduling under execution time constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. Naedele ; Comput. Eng. & Networks Lab., Swiss Federal Inst. of Technol., Zurich, Switzerland

The primary/backup with deallocation approach of S. Ghosh et al. (1997) is a strategy for the fault-tolerant online scheduling of hard realtime tasks. In this scheme, tasks are either rejected within a short time after the request or guaranteed to be executed even in case of a processor failure. In this paper several heuristics for the guarantee algorithm are investigated. For the first time different processor selection strategies for guarantee algorithms with execution time constraints are compared. In addition, the concept of a decision deadline is introduced which then leads to an extension of the primary and backup checking routines. The thus modified checking routines are shown to achieve a lower rejection ratio for right task deadlines and constrained scheduler execution times than the modification making use of task slack suggested S. Ghosh et al. (1997)

Published in:

Real-Time Computing Systems and Applications, 1999. RTCSA '99. Sixth International Conference on

Date of Conference: