A fault-tolerant scheduling problem

DOI10.1109/TSE.1986.6312999zbMath0611.90056OpenAlexW1991708881MaRDI QIDQ3751355

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

real-time systemsdeadlinespolynomial timesoftware reliabilityfault-tolerant computer systemstwo modes of processing

Mathematics Subject Classification ID

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

Related Items (3)

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

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