The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Maeng과 Malek가 제안한 비교 접근법에 따라 나비 네트워크의 진단 가능성을 고려합니다. Sengupta와 Dahbura는 비교 접근 방식에 따라 진단 가능한 시스템의 특성화에 대해 논의하고 결함이 있는 프로세서를 식별하기 위한 다항식 시간 알고리즘을 설계했습니다. 그러나 일반적인 시스템의 경우 알고리즘적으로 진단 가능성을 판단하는 것은 쉽지 않습니다. 본 논문에서는 나비 네트워크에서 신드롬을 생성하기 위한 두 가지 비교 방식을 제안하고 네트워크의 진단 가능성을 결정합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Toru ARAKI, Yukio SHIBATA, "Diagnosability of Butterfly Networks under the Comparison Approach" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 5, pp. 1152-1160, May 2002, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_5_1152/_p
부
@ARTICLE{e85-a_5_1152,
author={Toru ARAKI, Yukio SHIBATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Diagnosability of Butterfly Networks under the Comparison Approach},
year={2002},
volume={E85-A},
number={5},
pages={1152-1160},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - Diagnosability of Butterfly Networks under the Comparison Approach
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1152
EP - 1160
AU - Toru ARAKI
AU - Yukio SHIBATA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2002
AB - 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.
ER -