Algorithms for testing fault-tolerance of sequenced jobs

DOI10.1007/S10951-009-0126-8MaRDI QIDQ1041352zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Mathilde Hurand, Jiří Sgall

Publication date 2 December 2009

Published in Journal of Scheduling (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10951-009-0126-8

zbMATH Keywords

algorithmsfault-tolerancereal-time systemsscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Fault-Tolerant Scheduling
• Fault-tolerant real-time scheduling
• Fault-tolerant real-time scheduling
• Fault-tolerant scheduling (extended abstract)
• Optimal fault-tolerant computing on multiprocessor systems

Cites work

• A scheduling heuristics for distributed real-time embedded systems tolerant to processor and communication media failures
• Fault-tolerant real-time scheduling

This page was built for publication: Algorithms for testing fault-tolerance of sequenced jobs

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