Skip to Main content Skip to Navigation

Restricted Scheduling Windows for Dynamic Fault-Tolerant Primary/Backup Approach-Based Scheduling on Embedded Systems

Abstract : This paper is aimed at studying fault-tolerant design of the realtime multi-processor systems and is in particular concerned with the dynamic mapping and scheduling of tasks on embedded systems. The effort is concentrated on scheduling strategy having reduced complexity and guaranteeing that, when a task is input into the system and accepted, then it is correctly executed prior to the task deadline. The chosenmethodmakes use of the primary/backup approach and this paper describes its refinement based on reduction of windows within which the primary and the backup copies can be scheduled. The results showthat the use of restricted scheduling windows reduces the algorithm complexity by up to 15%.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01942185
Contributor : Emmanuel Casseau <>
Submitted on : Monday, December 3, 2018 - 4:38:04 AM
Last modification on : Tuesday, February 25, 2020 - 8:08:10 AM
Document(s) archivé(s) le : Monday, March 4, 2019 - 1:01:20 PM

File

SCOPES_2018_v_Hal.pdf
Files produced by the author(s)

Identifiers

Citation

Petr Dobias, Emmanuel Casseau, Oliver Sinnen. Restricted Scheduling Windows for Dynamic Fault-Tolerant Primary/Backup Approach-Based Scheduling on Embedded Systems. SCOPES '18 - 21th International Workshop on Software and Compilers for Embedded Systems, May 2018, Sankt Goar, Germany. pp.27-30, ⟨10.1145/3207719.3207724⟩. ⟨hal-01942185⟩

Share

Metrics

Record views

284

Files downloads

333