On Scheduling Tasks with a Quick Recovery from Failure

DOI10.1109/TC.1986.1676787MaRDI QIDQ3745267zbMATH OpenOpenAlexFDO

Authors C. M. Krishna, Kang G. Shin

Publication date 1986

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

Full work available at URL https://doi.org/10.1109/tc.1986.1676787

zbMATH Keywords

critical tasksdynamic programming algorithmfault-tolerant and real-time multiprocessorshard deadlinesnotification timesprimary and contingency schedulesprimary and ghost clonesprocessor failures

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling real-time tasks for dependability
• Fault-tolerant scheduling in homogeneous real-time systems
• Scheduling algorithms with fault detection and location capabilities for real-time multiprocessor systems
• Scheduling multiprocessor tasks in presence of correlated failures.
• Deadline scheduling of multiprocessor tasks

Cited in

(8)

• Scheduling algorithms with fault detection and location capabilities for real-time multiprocessor systems
• Rate-monotonic scheduling for hard-real-time systems
• Real-time task reallocation in fault-tolerant distributed computer systems
• Efficient overloading techniques for primary-backup scheduling in real-time systems
• Real-time scheduling algorithm for safety-critical systems on faulty multicore environments
• Scheduling real-time tasks for dependability
• scientific article; zbMATH DE number 1784923 (Why is no real title available?)
• Fault-tolerant scheduling in homogeneous real-time systems

This page was built for publication: On Scheduling Tasks with a Quick Recovery from Failure

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