Diagnosability of Butterfly Networks under the Comparison Approach

スポンサーリンク

概要

• 論文の詳細を見る

• We consider diagnosability of butterfly networks under the comparison approach proposed by Maeng and Malek. Sengupta and Dahbura discussed characterization of diagnosable systems under the comparison approach, and designed a polynomial time algorithm to identify the faulty processors. However, for a general system, it is not algorithmically easy to determine its diagnosability. This paper proposes two comparison schemes for generating syndromes on butterfly networks, and determine the diagnosability of the network.

• 社団法人電子情報通信学会の論文
• 2002-05-01

著者

• Shibata Y

  The Author Is With The Department Of Computer Science Faculty Of Engineering Gunma University

• Araki Toru

  The Author Is With Satellite Venture Business Laboratory Gunma University

• SHIBATA Yukio

  The author is with the Department of Computer Science, Faculty of Engineering, Gunma University

• Shibata Yukio

  The Author Is With The Department Of Computer Science Faculty Of Engineering Gunma University

関連論文

• Diagnosability of Butterfly Networks under the Comparison Approach

スポンサーリンク