Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks

DOI10.1109/TC.2007.70739MaRDI QIDQ4564221zbMATH OpenFDO

Authors Hakan Aydin

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• scientific article; zbMATH DE number 2220141
• Fault-tolerant real-time scheduling
• Fault-tolerant real-time scheduling
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Fault-tolerant scheduling in homogeneous real-time systems
• scientific article; zbMATH DE number 62143
• Feasibility analysis of real-time periodic tasks with offsets

Cited in

(3)

• scientific article; zbMATH DE number 2220141 (Why is no real title available?)
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Energy efficient fault-tolerant earliest deadline first scheduling for hard real-time systems

This page was built for publication: Exact Fault-Sensitive Feasibility Analysis of Real-Time Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564221)