A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems

DOI10.1007/s00607-021-01026-5zbMath1494.68030OpenAlexW3211599143MaRDI QIDQ2132061

Lalatendu Behera

Publication date: 27 April 2022

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-021-01026-5

zbMATH Keywords

real-time systemsfault-tolerancemixed-criticality systemstime-triggered scheduleTT-merge algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Measuring the performance of schedulability tests
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Hard Real-Time Computing Systems
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
• Scheduling Real-Time Mixed-Criticality Jobs
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems