Conditional diagnosability measures for large multiprocessor systems

檔案

日期

2005-02-01

類型

期刊名稱

IEEE TRANSACTIONS ON COMPUTERS

卷期與頁次

第 54 卷第 2 期,頁 165–175

ISSN

0018-9340

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lai, P., Tan, J., Chang, C., & Hsu, L. (2005). Conditional diagnosability measures for large multiprocessor systems. IEEE TRANSACTIONS ON COMPUTERS, 54(2), 165–175. https://doi.org/10.1109/TC.2005.19

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/14020