Abstract

When a computing system operates with multipleinstruction multiple-data (MIMD) streams, the overall system reliability is defined as the probability that at least, one path exists between each pair of the system nodes. In this paper the reliability models of MIMD systems are classified as 1. (1) a combinatorial model; 2. (2) a state transition model; 3. (3) a link enumeration model; and 4. (4) a spanning-tree model. These models are analyzed 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-neighbor 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 emphasized to help in ranking them for MIMD operational conditions.

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 call

Disclaimer: 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.