Abstract
The increasing interest in the combined evaluation of performance and reliability of fault-tolerant computing systems requires new approaches in modelling and analysis. Based on decomposition principles allowing for the separate analysis of a system's performance and availability behavior, an algorithm for the stationary analysis of fault-tolerant queueing networks has been developed. The sample system under study is a fault-tolerant multiprocessor capable of operating on different levels of degradation. N tasks are cycling between the multiprocessor and its environment. The algorithm developed is well suited for exploring vast parameter spaces in the early design phases of degradable systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
