Synthesis of Flexible Fault-Tolerant Schedules with Preemption for Mixed Soft and Hard Real-Time Systems

Research output: Research - peer-reviewArticle in proceedings – Annual report year: 2008

  • Author: Izosimov, Viacheslav

  • Author: Pop, Paul

  • Author: Eles, Petru

    Linköping University

  • Author: Peng, Zebo

    Linköping University

View graph of relations

In this paper we present an approach for scheduling with preemption for fault-tolerant embedded systems composed of soft and hard real-time processes. We are interested to maximize the overall utility for average, most likely to happen, scenarios and to guarantee the deadlines for the hard processes in the worst case scenarios. In many applications, the worst-case execution times of processes can be much longer than their average execution times. Thus, designs for the worst-case can be overly pessimistic, i.e., result in low overall utility. We propose preemption of process executions as a method to generate flexible schedules that maximize the overall utility for the average case while guarantee timing constraints in the worst case. Our scheduling algorithms determine off-line when to preempt and when to resurrect processes. The experimental results show the superiority of our new scheduling approach compared to approaches without preemption.
Original languageEnglish
Title of host publication11th Euromicro Conference on Digital System Design
Publication date2008
ISBN (Print)9780769532776
StatePublished - 2008
EventEuromicro Conference on Digital System Design - Parma, Italy
Duration: 1 Jan 2008 → …
Conference number: 11th


ConferenceEuromicro Conference on Digital System Design
CityParma, Italy
Period01/01/2008 → …

Bibliographical note

Copyright note for papers published by the IEEE Computer Society: Copyright 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.

CitationsWeb of Science® Times Cited: 0
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

Download statistics

No data available

ID: 4592572