CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Fault-Tolerant and Real-Time Scheduling for Mixed-Criticality Systems

Risat Mahmud Pathan (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Real-Time Systems: The International Journal of Time-Critical Computing (accepted for publication) (0922-6443). Vol. 50 (2014), 4, p. 509-547.
[Artikel, refereegranskad vetenskaplig]

The design and analysis of real-time scheduling algorithms for safety-critical systems is a challenging problem due to the temporal dependencies among different design constraints. This paper considers scheduling sporadic tasks with three interrelated design constraints: (i) meeting the hard deadlines of application tasks, (ii) providing fault tolerance by executing backups, and (iii) respecting the criticality of each task to facilitate system's certification. First, a new approach to model mixed-criticality systems from the perspective of fault tolerance is proposed. Second, a uniprocessor fixed-priority scheduling algorithm, called fault-tolerant mixed-criticality (FTMC) scheduling, is designed for the proposed model. The FTMC algorithm executes backups to recover from task errors caused by hardware or software faults. Third, a sufficient schedulability test is derived, when satisfied for a (mixed-criticality) task set, guarantees that all deadlines are met even if backups are executed to recover from errors. Finally, evaluations illustrate the effectiveness of the proposed test.

Nyckelord: Run-time support; Real-time scheduling; Fixed-priority scheduling; Mixed-criticality systems; Fault-tolerance

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-04-15. Senast ändrad 2016-07-19.
CPL Pubid: 196746


Läs direkt!

Länk till annan sajt (kan kräva inloggning)