MRTC publications

Maximizing the Fault Tolerance Capability of Fixed Priority Schedules

Full text:
Authors:	Radu Dobrin, Sasikumar Punnekkat, Hüseyin Aysan
Source:	14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, KaoHsiung, Taiwan

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 entry

@inproceedings{Dobrin_1494:2008, author = {Radu Dobrin and Sasikumar Punnekkat and H{\"u}seyin Aysan}, title = {Maximizing the Fault Tolerance Capability of Fixed Priority Schedules}, booktitle = {14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications}, month = {August}, year = {2008}, url = {http://www.mrtc.mdh.se/index.php?choice=publications&id=1494}, }

Mälardalen University |
Box 883 |
721 23 Västerås/Eskilstuna |
021-101300, 016-153600 |
webmaster |
Latest update: 2012.08.24