You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Maximizing the Fault Tolerance Capability of Fixed Priority Schedules

Fulltext:


Authors:

Radu Dobrin, Sasikumar Punnekkat, Hüseyin Aysan

Research group:

Dependable Software Engineering

Publication Type:

Conference/Workshop Paper

Venue:

14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Abstract

Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix of hard and soft tasks with varying criticality as well as associated fault tolerance requirements. Additionally, the relative criticality of tasks could undergo changes during the evolution of the system. Time redundancy techniques are often preferred in many embedded applications and, hence, it is extremely important to devise appropriate methodologies for scheduling real-time tasks under error assumptions.In this paper, we propose a methodology to provide a priori guarantees in fixed priority scheduling (FPS) such that the system will be able to tolerate one error per every critical task instance. We do so by using Integer Linear Programming (ILP) to derive task attributes that guarantee re-execution of every critical task instance before its deadline, while keeping the associated costs minimized. We illustrate the effectiveness of our approach, in comparison with fault tolerant (FT) adaptations of the well-known rate monotonic (RM), by simulations.

Bibtex

@inproceedings{Dobrin1265,
author = {Radu Dobrin and Sasikumar Punnekkat and H{\"u}seyin Aysan},
title = {Maximizing the Fault Tolerance Capability of Fixed Priority Schedules},
month = {August},
year = {2008},
booktitle = {14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications},
url = {http://www.es.mdu.se/publications/1265-}
}