Scheduling saves in fault-tolerant computations

DOI10.1007/BF01210593zbMath0790.68017OpenAlexW2032329806MaRDI QIDQ1323350

Leopold Flatto, Alexander Kreinin, Edward G. jun. Coffman

Publication date: 2 June 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01210593

zbMATH Keywords

schedulingfault-tolerant computationsfailure laws

Mathematics Subject Classification ID

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

Cites Work

• On the Optimum Checkpoint Selection Problem
• Optimal strategies for scheduling checkpoints and preventive maintenance
• Reliability of Systems with Limited Repairs
• Scheduling Checks and Saves

This page was built for publication: Scheduling saves in fault-tolerant computations