Skip Navigation

The Computer Journal 1999 42(2):129-141; doi:10.1093/comjnl/42.2.129
© 1999 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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lin, M.-S.
Right arrow Articles by Horng, M.-S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes

Min-Sheng LinA1, Deng-Jyi ChenA2 and Maw-Sheng HorngA3

A1 Department of Information Management, Tamsui Oxford University College, Tamsui, Taipei, Taiwan 25103, Republic of China A2 Institute of Computer Science and Information Engineering, National Chiao-Tung University, Hsin Chu, Taiwan 30050, Republic of China A3 Department of Mathematics Education, National Taipei Teacher College, Taipei, Taiwan 10659, Republic of China

The reliability of a distributed computing system depends on the reliability of its communication links and nodes and on the distribution of its resources, such as programs and data files. Many algorithms have been proposed for computing the reliability of distributed computing systems, but they have been applied mostly to distributed computing systems with perfect nodes. However, in real problems, nodes as well as links may fail. This paper proposes two new algorithms for computing the reliability of a distributed computing system with imperfect nodes. Algorithm I is based on a symbolic approach that includes two passes of computation. Algorithm II employs a general factoring technique on both nodes and edges. Comparisons with existing methods show the usefulness of the proposed algorithms for computing the reliability of large distributed computing systems.

Received 12 July, 1994. Revised 3 December, 1998.


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.