An evolutionary fault diagnosis algorithm for interconnection networks under the PMC model

Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied. As the number of processors in mul...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing Vol. 79; no. 9; pp. 9964 - 9984
Main Authors: Liang, Jiarong, Guo, Yang, Xie, Yuhao, Liang, Xinyu
Format: Journal Article
Language:English
Published: New York Springer US 01.06.2023
Springer Nature B.V
Subjects:
ISSN:0920-8542, 1573-0484
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied. As the number of processors in multiprocessor systems has increased in recent years, fault diagnosis algorithms based on graph theory cannot meet the current diagnosis requirements of some interconnection networks, such as t -diagnosable systems. In this paper, we use the evolution diagnosis approach to study fault diagnosis in t -diagnosable systems under the PMC model. First, for a t -diagnosable system G with a syndrome σ , we use a simple centralized algorithm to generate its simplified diagnosis graph G f , which contains all the faulty nodes in G . Based on the graph, we prove that the faulty node set in G is the minimum cover set of G f . Next, we prove that the problem of computing the minimum cover set for G f is equivalent to the problem of computing the optimal solution of a zero-one integer program. Using this result, we propose a novel genetic algorithm to solve the problem of the zero-one integer program. The simulation results show that the diagnostic accuracy of our proposed algorithm is equal to or greater than 96% and that the proposed algorithm outperforms its competitors in terms of diagnostic accuracy, number of iterations and running time.
AbstractList Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied. As the number of processors in multiprocessor systems has increased in recent years, fault diagnosis algorithms based on graph theory cannot meet the current diagnosis requirements of some interconnection networks, such as t -diagnosable systems. In this paper, we use the evolution diagnosis approach to study fault diagnosis in t -diagnosable systems under the PMC model. First, for a t -diagnosable system G with a syndrome σ , we use a simple centralized algorithm to generate its simplified diagnosis graph G f , which contains all the faulty nodes in G . Based on the graph, we prove that the faulty node set in G is the minimum cover set of G f . Next, we prove that the problem of computing the minimum cover set for G f is equivalent to the problem of computing the optimal solution of a zero-one integer program. Using this result, we propose a novel genetic algorithm to solve the problem of the zero-one integer program. The simulation results show that the diagnostic accuracy of our proposed algorithm is equal to or greater than 96% and that the proposed algorithm outperforms its competitors in terms of diagnostic accuracy, number of iterations and running time.
Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic algorithms for solving the problem of fault diagnosis in interconnection networks have been widely studied. As the number of processors in multiprocessor systems has increased in recent years, fault diagnosis algorithms based on graph theory cannot meet the current diagnosis requirements of some interconnection networks, such as t-diagnosable systems. In this paper, we use the evolution diagnosis approach to study fault diagnosis in t-diagnosable systems under the PMC model. First, for a t-diagnosable system G with a syndrome σ, we use a simple centralized algorithm to generate its simplified diagnosis graph Gf, which contains all the faulty nodes in G. Based on the graph, we prove that the faulty node set in G is the minimum cover set of Gf. Next, we prove that the problem of computing the minimum cover set for Gf is equivalent to the problem of computing the optimal solution of a zero-one integer program. Using this result, we propose a novel genetic algorithm to solve the problem of the zero-one integer program. The simulation results show that the diagnostic accuracy of our proposed algorithm is equal to or greater than 96% and that the proposed algorithm outperforms its competitors in terms of diagnostic accuracy, number of iterations and running time.
Author Liang, Jiarong
Xie, Yuhao
Guo, Yang
Liang, Xinyu
Author_xml – sequence: 1
  givenname: Jiarong
  surname: Liang
  fullname: Liang, Jiarong
  email: 19980003@gxu.edu.cn
  organization: College of Information Engineering, Nanning University, School of Computer, Electronics and Information, Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University
– sequence: 2
  givenname: Yang
  surname: Guo
  fullname: Guo, Yang
  organization: School of Computer, Electronics and Information, Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University
– sequence: 3
  givenname: Yuhao
  surname: Xie
  fullname: Xie, Yuhao
  organization: School of Computer, Electronics and Information, Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University
– sequence: 4
  givenname: Xinyu
  surname: Liang
  fullname: Liang, Xinyu
  organization: School of Computer, Electronics and Information, Guangxi Key Laboratory of Multimedia Communications and Network Technology, Guangxi University
BookMark eNp9kMtKAzEUhoNUsK2-gKuA69Hc5rYsxRtUdKEbNyHNnLRTp0lNMopvb-oIgouuTg78X_Lnm6CRdRYQOqfkkhJSXgVKGSszwnhGcpKLjByhMc3LtIpKjNCY1IxkVS7YCZqEsCGECF7yMXqdWQwfrutj66zyX9iovou4adXKutAGrLqV821cb7FxHrc2gtfOWtB7AFuIn86_BdzbBjyOa8BPD3O8dQ10p-jYqC7A2e-copeb6-f5XbZ4vL2fzxaZ5rSOmTbLpaHCGFqWnNcghBKQWpe0rhug6Ux1qbmARheKKk5UoQtSMdUsoWCm4lN0Mdy78-69hxDlxvXepiclZ3mRV6IoREpVQ0p7F4IHI3Ub1f4T0au2k5TIvUk5mJTJpPwxKUlC2T9059ttknUY4gMUUtiuwP-1OkB9A0xRiUQ
CitedBy_id crossref_primary_10_1109_TC_2025_3543701
Cites_doi 10.1002/cpe.4358
10.1109/PGEC.1967.264748
10.1057/jors.1996.82
10.1109/TLT.2012.22
10.1109/TPDS.2014.2350480
10.1109/TC.2013.128
10.1007/s11227-020-03419-3
10.1109/TC.2013.64
10.1109/TPDS.2021.3093243
10.1016/j.ins.2017.11.047
10.1007/BFb0120886
10.1109/TDSC.2017.2726541
10.1016/j.tcs.2020.10.017
10.1109/ACCESS.2017.2672602
10.21629/JSEE.2018.01.22
10.1109/TC.2015.2506562
10.1109/TC.1978.1674996
10.1109/TC.1984.1676472
10.1109/RELDI.2000.885395
10.1109/CEC.2010.5586002
10.1109/CFIS.2015.7391653
10.1109/CACML55074.2022.00029
10.1109/JCSSE49651.2020.9268416
10.1109/IAC.2018.8780463
10.1109/ICSGEA.2016.64
10.1109/AINA.2018.00102
10.1109/ICACI49185.2020.9177717
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023.
DBID AAYXX
CITATION
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.1007/s11227-023-05054-0
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Computer Science Database (NC LIVE)
ProQuest Engineering Collection
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Computer Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1573-0484
EndPage 9984
ExternalDocumentID 10_1007_s11227_023_05054_0
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61862003
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
123
199
1N0
1SB
2.D
203
28-
29L
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDPE
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADMLS
ADQRH
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
B0M
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EAD
EAP
EAS
EBD
EBLON
EBS
EDO
EIOEI
EJD
EMK
EPL
ESBYG
ESX
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9O
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WH7
WK8
YLTOR
Z45
Z7R
Z7X
Z7Z
Z83
Z88
Z8M
Z8N
Z8R
Z8T
Z8W
Z92
ZMTXR
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
AYFIA
BENPR
BGLVJ
CCPQU
CITATION
HCIFZ
K7-
M7S
PHGZM
PHGZT
PQGLB
PTHSS
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
L6V
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c319t-cfbbf14ff177339e44a4e0487199de14e01c7c34edc6a1a30a6c6082adbe62f83
IEDL.DBID RSV
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000919821400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0920-8542
IngestDate Sun Nov 30 05:05:09 EST 2025
Tue Nov 18 22:01:02 EST 2025
Sat Nov 29 04:27:44 EST 2025
Fri Feb 21 02:43:30 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Fault diagnosis
Zero-one integer program
diagnosable systems
Large-scale network systems
Genetic algorithm
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-cfbbf14ff177339e44a4e0487199de14e01c7c34edc6a1a30a6c6082adbe62f83
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 3256584664
PQPubID 2043774
PageCount 21
ParticipantIDs proquest_journals_3256584664
crossref_citationtrail_10_1007_s11227_023_05054_0
crossref_primary_10_1007_s11227_023_05054_0
springer_journals_10_1007_s11227_023_05054_0
PublicationCentury 2000
PublicationDate 20230600
2023-06-00
20230601
PublicationDateYYYYMMDD 2023-06-01
PublicationDate_xml – month: 6
  year: 2023
  text: 20230600
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationSubtitle An International Journal of High-Performance Computer Design, Analysis, and Use
PublicationTitle The Journal of supercomputing
PublicationTitleAbbrev J Supercomput
PublicationYear 2023
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Yang, Lin, Qin (CR12) 2013; 225
CR19
CR17
Ye, Liang, Lin (CR7) 2016; 65
CR14
Liang, Zhang (CR3) 2017; 5
Xie, Ye, Liang (CR15) 2018; 30
Xuan, Zhao, Miao, Zhang, Liu (CR30) 2017; 53
Wei, Xu (CR6) 2021; 849
Al-sultan, Hussain, Nizami (CR18) 1996; 47
Xuan, Miao, Zhao (CR28) 2016; 38
Yang, Lin (CR13) 2014; 63
Ye, Liang (CR2) 2015; 26
Balas, Ho (CR25) 1980; 12
CR29
CR27
Liang, Zhou, Yun (CR4) 2018; 29
Yang, Li, Li (CR8) 2021; 77
CR26
CR23
CR22
CR21
CR20
Nguen, Hui, Fong (CR24) 2013; 6
Lin, Xu, Chen, Hsieh, Wang (CR10) 2019; 16
Lin, Huang, Xu, Hsieh (CR1) 2021; 33
Zhu, Guo, Wang (CR11) 2014; 63
Meyer, Masson (CR16) 2006; 27
Lv, Fan, Hsu, Lin (CR5) 2018; 433
Preparata, Metze, Chien (CR9) 1967; 16
W Yang (5054_CR13) 2014; 63
E Balas (5054_CR25) 1980; 12
JR Liang (5054_CR3) 2017; 5
JR Liang (5054_CR4) 2018; 29
5054_CR14
FP Preparata (5054_CR9) 1967; 16
5054_CR19
L Lin (5054_CR10) 2019; 16
YL Wei (5054_CR6) 2021; 849
Y Yang (5054_CR8) 2021; 77
5054_CR17
LC Ye (5054_CR7) 2016; 65
LM Lin (5054_CR1) 2021; 33
M Xie (5054_CR15) 2018; 30
H Xuan (5054_CR28) 2016; 38
LC Ye (5054_CR2) 2015; 26
YL Lv (5054_CR5) 2018; 433
W Yang (5054_CR12) 2013; 225
H Xuan (5054_CR30) 2017; 53
5054_CR22
5054_CR23
ML Nguen (5054_CR24) 2013; 6
KS Al-sultan (5054_CR18) 1996; 47
5054_CR20
5054_CR21
Q Zhu (5054_CR11) 2014; 63
G Meyer (5054_CR16) 2006; 27
5054_CR26
5054_CR27
5054_CR29
References_xml – volume: 30
  start-page: 1683
  issue: 6
  year: 2018
  end-page: 1690
  ident: CR15
  article-title: A diagnosis algorithm on hypercube-like networks
  publication-title: Concurr Comput: Pract Experience
  doi: 10.1002/cpe.4358
– ident: CR22
– volume: 16
  start-page: 848
  issue: 6
  year: 1967
  end-page: 854
  ident: CR9
  article-title: On the connection assignment problem of diagnosable systems
  publication-title: IEEE Trans Comput
  doi: 10.1109/PGEC.1967.264748
– volume: 47
  start-page: 702
  issue: 5
  year: 1996
  end-page: 709
  ident: CR18
  article-title: A genetic algorithm for the set covering problem
  publication-title: J Oper Res Soc
  doi: 10.1057/jors.1996.82
– ident: CR14
– volume: 6
  start-page: 46
  issue: 1
  year: 2013
  end-page: 59
  ident: CR24
  article-title: Large-scal multiobjective static test generation for web-based testing with integer programming
  publication-title: IEEE Trans Learn Technol
  doi: 10.1109/TLT.2012.22
– volume: 38
  start-page: 640
  issue: 4
  year: 2016
  end-page: 647
  ident: CR28
  article-title: System-level fault diagnosis based on bat algorithm
  publication-title: Comput Eng Sci
– volume: 53
  start-page: 226
  issue: 3
  year: 2017
  end-page: 230
  ident: CR30
  article-title: MWOFD algorithm based on PMC model
  publication-title: Comput Eng Appl
– volume: 26
  start-page: 2459
  issue: 9
  year: 2015
  end-page: 2464
  ident: CR2
  article-title: Five-round adaptive diagnosis in Hamiltonian networks
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2014.2350480
– ident: CR29
– volume: 63
  start-page: 2540
  issue: 10
  year: 2014
  end-page: 2548
  ident: CR13
  article-title: Reliability evaluation of BC networks in terms of extra vertex- and edge-connectivity
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.2013.128
– volume: 77
  start-page: 3885
  issue: 4
  year: 2021
  end-page: 3898
  ident: CR8
  article-title: Structure fault tolerance of balanced hypercubes
  publication-title: J Supercomput
  doi: 10.1007/s11227-020-03419-3
– volume: 63
  start-page: 1847
  issue: 7
  year: 2014
  end-page: 1851
  ident: CR11
  article-title: Relating diagnosability, strong diagnosability and conditional diagnosability of strong networks
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.2013.64
– ident: CR27
– ident: CR23
– volume: 33
  start-page: 415
  issue: 2
  year: 2021
  end-page: 428
  ident: CR1
  article-title: A pessimistic fault diagnosability of large-scale connected networks via extra connectivity
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2021.3093243
– volume: 433
  start-page: 115
  year: 2018
  end-page: 124
  ident: CR5
  article-title: Structure connectivity and substructure connectivity of -ary -cube networks
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2017.11.047
– ident: CR21
– ident: CR19
– volume: 12
  start-page: 37
  issue: 1
  year: 1980
  end-page: 60
  ident: CR25
  article-title: Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study
  publication-title: Math Program
  doi: 10.1007/BFb0120886
– volume: 16
  start-page: 1068
  issue: 6
  year: 2019
  end-page: 1097
  ident: CR10
  article-title: Relating extra connectivity and extra conditional diagnosability in regular networks
  publication-title: IEEE Trans Dependable Secure Comput
  doi: 10.1109/TDSC.2017.2726541
– ident: CR17
– volume: 849
  start-page: 163
  year: 2021
  end-page: 172
  ident: CR6
  article-title: Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
  publication-title: Theoret Comput Sci
  doi: 10.1016/j.tcs.2020.10.017
– volume: 225
  start-page: 366
  issue: 12
  year: 2013
  end-page: 371
  ident: CR12
  article-title: On the -diagnosability of BC networks
  publication-title: Appl Math Comput
– volume: 5
  start-page: 5340
  issue: 1
  year: 2017
  end-page: 5346
  ident: CR3
  article-title: The -diagnosability of hypercube networks under PMC and comparison models
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2017.2672602
– volume: 29
  start-page: 216
  issue: 1
  year: 2018
  end-page: 222
  ident: CR4
  article-title: A new t/k-diagnosis algorithm for n-dimensional hypercube network under the comparison model
  publication-title: J Syst Eng Electron
  doi: 10.21629/JSEE.2018.01.22
– volume: 65
  start-page: 2884
  issue: 9
  year: 2016
  end-page: 2888
  ident: CR7
  article-title: A fast pessimistic diagnosis algorithm for hypercube-like networks under the comparison model
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.2015.2506562
– ident: CR26
– ident: CR20
– volume: 27
  start-page: 1059
  issue: 11
  year: 2006
  end-page: 1063
  ident: CR16
  article-title: An efficient fault diagnosis algorithm for symmetric multiple processor architecture
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.1978.1674996
– ident: 5054_CR14
  doi: 10.1109/TC.1984.1676472
– ident: 5054_CR17
  doi: 10.1109/RELDI.2000.885395
– volume: 6
  start-page: 46
  issue: 1
  year: 2013
  ident: 5054_CR24
  publication-title: IEEE Trans Learn Technol
  doi: 10.1109/TLT.2012.22
– ident: 5054_CR29
  doi: 10.1109/CEC.2010.5586002
– ident: 5054_CR26
  doi: 10.1109/CFIS.2015.7391653
– volume: 47
  start-page: 702
  issue: 5
  year: 1996
  ident: 5054_CR18
  publication-title: J Oper Res Soc
  doi: 10.1057/jors.1996.82
– volume: 38
  start-page: 640
  issue: 4
  year: 2016
  ident: 5054_CR28
  publication-title: Comput Eng Sci
– volume: 225
  start-page: 366
  issue: 12
  year: 2013
  ident: 5054_CR12
  publication-title: Appl Math Comput
– volume: 77
  start-page: 3885
  issue: 4
  year: 2021
  ident: 5054_CR8
  publication-title: J Supercomput
  doi: 10.1007/s11227-020-03419-3
– ident: 5054_CR23
  doi: 10.1109/CACML55074.2022.00029
– ident: 5054_CR19
  doi: 10.1109/JCSSE49651.2020.9268416
– volume: 53
  start-page: 226
  issue: 3
  year: 2017
  ident: 5054_CR30
  publication-title: Comput Eng Appl
– ident: 5054_CR22
  doi: 10.1109/IAC.2018.8780463
– volume: 433
  start-page: 115
  year: 2018
  ident: 5054_CR5
  publication-title: Inf Sci
  doi: 10.1016/j.ins.2017.11.047
– ident: 5054_CR20
  doi: 10.1109/ICSGEA.2016.64
– volume: 16
  start-page: 1068
  issue: 6
  year: 2019
  ident: 5054_CR10
  publication-title: IEEE Trans Dependable Secure Comput
  doi: 10.1109/TDSC.2017.2726541
– volume: 29
  start-page: 216
  issue: 1
  year: 2018
  ident: 5054_CR4
  publication-title: J Syst Eng Electron
  doi: 10.21629/JSEE.2018.01.22
– volume: 849
  start-page: 163
  year: 2021
  ident: 5054_CR6
  publication-title: Theoret Comput Sci
  doi: 10.1016/j.tcs.2020.10.017
– volume: 63
  start-page: 1847
  issue: 7
  year: 2014
  ident: 5054_CR11
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.2013.64
– volume: 33
  start-page: 415
  issue: 2
  year: 2021
  ident: 5054_CR1
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2021.3093243
– volume: 12
  start-page: 37
  issue: 1
  year: 1980
  ident: 5054_CR25
  publication-title: Math Program
  doi: 10.1007/BFb0120886
– volume: 16
  start-page: 848
  issue: 6
  year: 1967
  ident: 5054_CR9
  publication-title: IEEE Trans Comput
  doi: 10.1109/PGEC.1967.264748
– ident: 5054_CR21
  doi: 10.1109/AINA.2018.00102
– volume: 30
  start-page: 1683
  issue: 6
  year: 2018
  ident: 5054_CR15
  publication-title: Concurr Comput: Pract Experience
  doi: 10.1002/cpe.4358
– ident: 5054_CR27
  doi: 10.1109/ICACI49185.2020.9177717
– volume: 65
  start-page: 2884
  issue: 9
  year: 2016
  ident: 5054_CR7
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.2015.2506562
– volume: 63
  start-page: 2540
  issue: 10
  year: 2014
  ident: 5054_CR13
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.2013.128
– volume: 27
  start-page: 1059
  issue: 11
  year: 2006
  ident: 5054_CR16
  publication-title: IEEE Trans Comput
  doi: 10.1109/TC.1978.1674996
– volume: 5
  start-page: 5340
  issue: 1
  year: 2017
  ident: 5054_CR3
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2017.2672602
– volume: 26
  start-page: 2459
  issue: 9
  year: 2015
  ident: 5054_CR2
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2014.2350480
SSID ssj0004373
Score 2.3233292
Snippet Fault diagnosis of interconnection networks is vital to ensuring the reliability and maintenance of multiprocessor systems. Based on graph theory, diagnostic...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 9964
SubjectTerms Accuracy
Compilers
Computation
Computer Science
Evolutionary algorithms
Fault diagnosis
Genetic algorithms
Graph theory
Integer programming
Interpreters
Multiprocessing
Networks
Optimization
Processor Architectures
Programming Languages
SummonAdditionalLinks – databaseName: Engineering Database
  dbid: M7S
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFA86PXhxfuJ0Sg7eNLi0adOeZAyHF8dAheGlpPnQwexm2w38703S1KLgLt4KTR6l7728l_f1A-BSejgNfE4RxUogIjhDLCAMCcGJuUCHgarAJuhoFE0m8dgF3ApXVlmfifagFnNuYuQ3vrbNxliG5HbxgQxqlMmuOgiNTbBlpiRgW7r32PRF-lWGOdZXpCggnmuaqVrnsOdRpC0WMlhuBPV-GqbG2_yVILV2Z9j-7xfvgV3nccJ-JSL7YENmB6BdozlAp9yH4KWfQblyksjyT6jYclZCUdXiTQvIZq-afPn2DrWjC82ciZybMhnbGQGzqp68gKYrLYfar4TjhwG0SDtH4Hl49zS4Rw55AXGtkiXiKk0VJkphSn0_loQwIrWuUxzHQmL9jDnlPpGChwwzv8dCHmpngolUhp6K_GPQyuaZPAEworHniYDFQaTX94I05AGhKRc0NVjXUQfg-rcn3I0lN-gYs6QZqGxYlWhWJZZVSa8Drr73LKqhHGtXd2v-JE5Bi6RhTgdc1xxuXv9N7XQ9tTOw41mhMnGaLmiV-VKeg22-KqdFfmHF8wtsj-qY
  priority: 102
  providerName: ProQuest
Title An evolutionary fault diagnosis algorithm for interconnection networks under the PMC model
URI https://link.springer.com/article/10.1007/s11227-023-05054-0
https://www.proquest.com/docview/3256584664
Volume 79
WOSCitedRecordID wos000919821400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 0920-8542
  databaseCode: P5Z
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 0920-8542
  databaseCode: M7S
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 0920-8542
  databaseCode: BENPR
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Computer Science Database (NC LIVE)
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 0920-8542
  databaseCode: K7-
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 0920-8542
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFD54e_DFuzgvIw--aWBpk6Z9nLIhiGNsKmMvJU1SHcwqbR347016sSgq6EspNA3l5JyeLzmXD-BUOyRiruSYk1hhqqTAglGBlZLUbqA9FpdkE3ww8CeTYFgVhWV1tnsdkiz-1E2xG3Ecjo2PwZZ9jWKzUV817s63hA2j8X1TDemWceXAbIx8Rp2qVOb7OT67owZjfgmLFt6mv_m_79yCjQpdom6pDtuwpJMd2KyZG1BlyLsw7SZILyqtE-kbisXrPEeqzLubZUjMH57TWf74hAyoRbanRCptSkxRBYGSMnc8Q7YCLUUGQ6LhzSUqWHX24K7fu728whXLApbG_HIs4yiKCY1jwrnrBppSQbWxa06CQGli7onk0qVaSU8Q4XaEJz0DHISKtOfEvrsPK8lzog8A-TxwHMVEwHwzvsMiTzLKI6l4ZHmt_RaQWtihrFqQWyaMedg0T7bCC43wwkJ4YacFZx_vvJQNOH4dfVyvYVgZYxa6BtZZnOXRFpzXa9Y8_nm2w78NP4J1p1h2e0ZzDCt5-qpPYE0u8lmWtmH1ojcYjtqwfM1x2-aYjs11yKbtQn3fAS5r5Lc
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Lb9MwGP9UxiR2oYyH1lGYD-M0LOpH4uSAUFWYVnWreuikiUtwbIdN6tIuyYb6T_E3YuexaEj0tgO3SHEsOf59D_t7_AAODSWxx5TAgiQac60klh6XWGvF3QHa95KKbEJMp8HFRTjrwO-mFsalVTY6sVTUeqncHfknZm2zM5Y-_7K6wY41ykVXGwqNChYTs_5lj2z55_FXu78fKD3-Nh-d4JpVACsLtwKrJI4TwpOECMFYaDiX3FgcCxKG2hD7TJRQjButfEkkG0hf-dZQSh0bnyYBs_M-gaecBcLJ1UTgtg6TVRHt0B7JAo_TukinKtUjlApsLSR23HEcDx4awta7_SsgW9q54-7_9odewPPao0bDSgR2oWPSl9Bt2CpQrbxewfdhisxdLWkyW6NE3i4KpKtcw6scycVPu5zi8hpZRx65PhqZcmlAZeUHSqt8-Ry5qrsMWb8Zzc5GqGQSeg3nj7LCN7CVLlOzBygQIaXak6EX2PEDL_aVx0WstIgdl3fQA9Jsc6TqtuuO_WMRtQ2jHTQiC42ohEY06MHR_TerqunIxtH9Bg9RrYDyqAVDDz42iGpf_3u2_c2zHcCzk_nZaXQ6nk7ewg4tAe3upPqwVWS35h1sq7viKs_el6KB4MdjI-0P7GZIlA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA6iIr44rzidmgffNGxJ06Z9HNOhqGPgheFLSXPRwexG1w389ya9WBUVxLdCk1BOziHfac53PgCOFcGR6wiGGNYSUSk44i7lSEpBbQLtuToXm2C9nj8YBP0PLP6s2r28ksw5DbZLU5w2J1I3K-IbJoQhc94gq8RGkUnal6gtpLf5-u1DxYx08jvmwCRJvktJQZv5fo3PR1OFN79ckWYnT7f2_29eB2sF6oTt3E02wIKKN0GtVHSARYBvgcd2DNW88EaevELNZ6MUyrwebziFfPQ0Tobp8ws0YBfaXhOJsKUyGTsCxnlN-RRaZloCDbaE_ZsOzNR2tsF99_yuc4EK9QUkTFimSOgo0phqjRlznEBRyqky8c5wEEiFzTMWTDhUSeFxzJ0W94RnAAWXkfKI9p0dsBiPY7ULoM8CQqTLA9c341tu5AmXskhIFlm9a78OcGn4UBStya1Cxiismipb44XGeGFmvLBVByfvcyZ5Y45fRzfK_QyLIJ2GjoF7Fn95tA5Oy_2rXv-82t7fhh-Blf5ZN7y-7F3tg1WSeYD9jdMAi2kyUwdgWczT4TQ5zHz3DYTM7B0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+evolutionary+fault+diagnosis+algorithm+for+interconnection+networks+under+the+PMC+model&rft.jtitle=The+Journal+of+supercomputing&rft.au=Liang%2C+Jiarong&rft.au=Guo%2C+Yang&rft.au=Xie%2C+Yuhao&rft.au=Liang%2C+Xinyu&rft.date=2023-06-01&rft.pub=Springer+US&rft.issn=0920-8542&rft.eissn=1573-0484&rft.volume=79&rft.issue=9&rft.spage=9964&rft.epage=9984&rft_id=info:doi/10.1007%2Fs11227-023-05054-0&rft.externalDocID=10_1007_s11227_023_05054_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0920-8542&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0920-8542&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0920-8542&client=summon