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

Petr Dobiáš | Zendy; Emmanuel Casseau | Zendy; Oliver Sinnen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Petr Dobiáš,

Emmanuel Casseau,

Oliver Sinnen

Publication year - 2018

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/3207719.3207724

Subject(s) - computer science , backup , scheduling (production processes) , dynamic priority scheduling , distributed computing , fixed priority pre emptive scheduling , fault tolerance , fair share scheduling , earliest deadline first scheduling , two level scheduling , rate monotonic scheduling , parallel computing , embedded system , operating system , schedule , engineering , operations management

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 chosen method makes 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 show that the use of restricted scheduling windows reduces the algorithm complexity by up to 15%.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research