Diagnosability of Butterfly Networks under the Comparison Approach
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.5 pp.1152-1160
- Publication Date
- 2002/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
