Sökning: id:"swepub:oai:DiVA.org:mdh-13720" >
Task-Level Probabil...
Task-Level Probabilistic Scheduling Guarantees for Dependable Real-Time Systems : A designer centric approach
-
- Aysan, Hüseyin (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
- Dobrin, Radu (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
- Punnekkat, Sasikumar (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
(creator_code:org_t)
- 2011
- 2011
- Engelska.
-
Ingår i: Proceedings - 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, ISORCW 2011. - 9780769543772 ; , s. 281-287
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Dependable real-time systems typically consist of tasks of mixed-criticality levels with associated fault tolerance (FT) requirements and scheduling them in a fault-tolerant manner to efficiently satisfy these requirements is a challenging problem. From the designers' perspective, the most natural way to specify the task criticalities is by expressing the reliability requirements at task level, without having to deal with low level decisions, such as deciding on which FT method to use, where in the system to implement the FT and the amount of resources to be dedicated to the FT mechanism. Hence, it is extremely important to devise methods for translating the highlevel requirement specifications for each task into the low-level scheduling decisions needed for the FT mechanism to function efficiently and correctly. In this paper, we focus achieving FT by redundancy in the temporal domain, as it is the commonly preferred method in embedded applications to recover from transient and intermittent errors, mainly due to its relatively low cost and ease of implementation. We propose a method which allows the system designer to specify task-level reliability requirements and provides a priori probabilistic scheduling guarantees for real-time tasks with mixed-criticality levels in the context of preemptive fixed-priority scheduling. We illustrate the method on a running example.
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas