Abstract
When a computing system operates with Multiple-Instruction Multiple Data streams (MIMD), the overall system reliability is defined as the probability that one path, at least, exists between each pair of system nodes. In this paper the reliability models of MIMD systems are classified as combinatorial, state-transition, links-enumeration and spanning tree models. These models are analysed in such a unified manner that seven network configurations are considered. These configurations are: star, tree, ring, dual-bus hypercube, normal hypercube, multiple global buses and near-neighbour mesh. Hence the corresponding structured Algol-like algorithms are given. The reliability evaluation of every interconnection is presented, taking into account the configuration size. Moreover, a comparison of models and configurations is emphasised to help rank them for MIMD operational conditions.
Sign-in/Register to access full text options 
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.
