Value-Based Scheduling of Distributed Fault-Tolerant Real-Time Systems with Soft and Hard Timing Constraints
8th IEEE Workshop on Embedded Systems for Real-Time Multimedia, Scottsdale, AZ, USA, October 28-29, 2010.
ABSTRACT
We present an approach for scheduling of fault tolerant embedded applications composed of soft and hard real time processes running on distributed embedded systems. The hard processes are critical and must always complete on time. A soft process can complete after its deadline and its completion time is associated with a value function that characterizes its contribution to the quality-of-service of the application. We propose a quasi-static scheduling algorithm to generate a tree of fault-tolerant distributed schedules that maximize the application's quality value and guarantee hard deadlines.
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.
[IEP10] Viacheslav Izosimov, Petru Eles, Zebo Peng, "Value-Based Scheduling of Distributed Fault-Tolerant Real-Time Systems with Soft and Hard Timing Constraints", 8th IEEE Workshop on Embedded Systems for Real-Time Multimedia, Scottsdale, AZ, USA, October 28-29, 2010. |
