Value-Based Scheduling of Distributed Fault-Tolerant Real-Time Systems with Soft and Hard Timing Constraints
2010 (English)In: 2010 8th IEEE Workshop on Embedded Systems for Real-Time Multimedia, ESTIMedia'10, IEEE , 2010Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE , 2010.
IdentifiersURN: urn:nbn:se:kth:diva-179484DOI: 10.1109/ESTMED.2010.5666982ScopusID: 2-s2.0-78651380298OAI: oai:DiVA.org:kth-179484DiVA: diva2:883473
8th IEEE Workshop on Embedded Systems for Real-Time Multimedia, Scottsdale, AZ, USA.
QC 201601202015-12-172015-12-172016-01-20Bibliographically approved