A fault-tolerant scheduling problem

DOI10.1109/TSE.1986.6312999zbMATH Open0611.90056OpenAlexW1991708881MaRDI QIDQ3751355FDOQ3751355

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

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

zbMATH Keywords

real-time systemspolynomial timesoftware reliabilitydeadlinesfault-tolerant computer systemstwo modes of processing

Mathematics Subject Classification ID

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

Cited In (5)

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

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)