Scheduling real-time tasks for dependability

DOI10.1057/PALGRAVE.JORS.2600413MaRDI QIDQ4347408zbMATH OpenOpenAlexFDO

Authors

Publication date 7 August 1997

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600413

zbMATH Keywords

deadlinesprocessor failuresreal-time systemworst case

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Fault-tolerant scheduling in homogeneous real-time systems
• On Scheduling Tasks with a Quick Recovery from Failure
• Scheduling algorithms with fault detection and location capabilities for real-time multiprocessor systems
• scientific article; zbMATH DE number 4199942
• A new algorithm for scheduling periodic, real-time tasks

Cited in

(8)

• Scheduling algorithms with fault detection and location capabilities for real-time multiprocessor systems
• Reliability and performance optimization of pipelined real-time systems
• On Scheduling Tasks with a Quick Recovery from Failure
• Algorithms and mechanisms for procuring services with uncertain durations using redundancy
• scientific article; zbMATH DE number 2038779 (Why is no real title available?)
• A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures
• Fault-tolerant scheduling in homogeneous real-time systems
• Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architectures

This page was built for publication: Scheduling real-time tasks for dependability

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