On Scheduling Tasks with a Quick Recovery from Failure

DOI10.1109/TC.1986.1676787zbMath0606.68028OpenAlexW1841932260MaRDI QIDQ3745267

Kang G. Shin, C. M. Krishna

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

dynamic programming algorithmhard deadlinesprocessor failurescritical tasksfault-tolerant and real-time multiprocessorsnotification timesprimary and contingency schedulesprimary and ghost clones

Mathematics Subject Classification ID

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

Related Items (2)

Fault-tolerant scheduling in homogeneous real-time systems ⋮ Rate-monotonic scheduling for hard-real-time systems

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