Computationally efficient and numerically stable reliability bounds for repairable fault-tolerant systems
DOI10.1109/12.990125zbMATH Open1391.90203OpenAlexW2163435281MaRDI QIDQ4571304FDOQ4571304
Authors: Juan A. Carrasco 
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/19941
Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12)
Cited In (5)
- Reliability of fault-tolerant systems with parallel task processing
- Fast simulation of unavailability of a repairable system with a bounded relative error of estimate
- Efficient implementations of the randomization method with control of the relative error
- Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage
- Computing bounds on steady state availability of repairable computer systems
This page was built for publication: Computationally efficient and numerically stable reliability bounds for repairable fault-tolerant systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571304)
