標題: Conditional diagnosability measures for large multiprocessor systems
作者: Lai, PL
Tan, JJM
Chang, CP
Hsu, LH
資訊工程學系
Department of Computer Science
關鍵字: PMC model;diagnosability;t-diagnosable;strongly t-diagnosable;conditional faulty set;conditional diagnosability
公開日期: 1-Feb-2005
摘要: Diagnosability has played an important role in the reliability of an interconnection network. The classical problem of fault diagnosis is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we introduce a new measure of diagnosability, called conditional diagnosability, by restricting that any faulty set cannot contain all the neighbors of any vertex in the graph. Based on this requirement, the conditional diagnosability of the n-dimensional hypercube is shown to be 4(n - 2) + 1, which is about four times as large as the classical diagnosability. Besides, we propose some useful conditions for verifying if a system is t-diagnosable and introduce a new concept, called a strongly t-diagnosable system, under the PMC model. Applying these concepts and conditions, we investigate some t-diagnosable networks which are also strongly t-diagnosable.
URI: http://dx.doi.org/10.1109/TC.2005.19
http://hdl.handle.net/11536/14020
ISSN: 0018-9340
DOI: 10.1109/TC.2005.19
期刊: IEEE TRANSACTIONS ON COMPUTERS
Volume: 54
Issue: 2
起始頁: 165
結束頁: 175
Appears in Collections:Articles


Files in This Item:

  1. 000225715900008.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.