Skip Navigation

The Computer Journal 1988 31(4):304-312; doi:10.1093/comjnl/31.4.304
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zaki, M.
Right arrow Articles by Elboraey, M. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Analysis of Reliability Models for Interconnecting MIMD Systems

M. Zaki and M. M. Elboraey

Computers Engineering Department, Faculty of Engineering, University of Al-Azhar, Nasr City, Cairo, Egypt

Received 1 April 1986; revised 1 December 1986

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.