A fault-tolerant scheduling problem

DOI10.1109/TSE.1986.6312999MaRDI QIDQ3751355zbMATH OpenOpenAlexFDO

Authors Arthur L. Liestman, R. H. Campbell

Publication date 1986

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1986.6312999

zbMATH Keywords

deadlinesfault-tolerant computer systemspolynomial timereal-time systemssoftware reliabilitytwo modes of processing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling with deadlines and loss functions
• Fault-Tolerant Scheduling
• Optimal Fault-Secure Scheduling
• Fault-tolerant scheduling (extended abstract)
• scientific article; zbMATH DE number 30973

Cited in

(5)

• Scheduling imprecise computation tasks with \(0/1\)-constraint
• Optimal Fault-Secure Scheduling
• Fault-tolerant scheduling in homogeneous real-time systems
• Fault-Tolerant Scheduling
• Job replication on multiserver systems

This page was built for publication: A fault-tolerant scheduling problem

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