Conditional (t, k)-Diagnosis under the PMC Model

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/51623

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51623

题名:	Conditional (t, k)-Diagnosis under the PMC Model
作者:	Chang,GY
贡献者:	資訊工程學系
关键词:	MULTIPROCESSOR SYSTEMS;DIAGNOSABLE SYSTEMS;NETWORKS
日期:	2011
上传时间:	2012-03-27 18:57:44 (UTC+8)
出版者:	國立中央大學
摘要:	In this paper, assuming that each vertex is neighboring to at least one fault-free vertex, we investigate the (t, k)-diagnosability of a graph G under the PMC model. Lower bounds on the numeric degrees of (t, k)-diagnosability are suggested when G is a general graph or G is a regular graph. In particular, the following results are obtained. Symmetric d-dimensional grids are (N-m/2d, min{m, 2d - 1})-diagnosable, where d >= 2, 1 <= m <= 2d - 1, and N are the number of vertices. Symmetric d-dimensional tori are (N+0.62N(2/3)-2/4, 1)-diagnosable if d = 2, and (N-m/2d, min{m, 4d - 2})-diagnosable if d >= 3, where 1 <= m <= 4d - 2. Hypercubes are (N-2logN+2/logN, 2logN - 2)-iagnosable. Cube-connected cycles are (N-m/3, min{m, 4})-diagnosable, where 1 <= m <= 4; k-ary trees are (N-1/k, 1)-diagnosable.
關聯:	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	491	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing