Correct and Almost Complete Diagnosis of Processor Grids
IEEE Transactions on Computers
Fault-diagnosis of grid structures
Theoretical Computer Science - Dependable computing
Diagnosability of regular systems
Journal of Algorithms
| Hi-index | 0.00 |
GivenasetNofninterconnectedprocessors,someofwhichmaybe faulty,theSystem-LevelDiagnosisaimsatidentifyingthefaultyprocessorsby analyzingtheoutcomesoftheavailableinterprocessortests.Executionofa testrequiresthattheinvolvedunitsbeconnected.Regularorquasiregular interconnectionschemesdeservespecialattention,duetotheirwidespreaduse inparallelarchitectures.Themostcommonapproachtothediagnosisofregular systemshasbeenprobabilistic,thusleadingtoresultswhosecorrectnesscan onlybeevaluatedprobabilistically.Inthispaper,anewdeterministic algorithmisintroduced,whichidentifiesasetFoffaultyprocessorsanda setKofnon-faultyprocessors,withF+K=T,whichthediagnosisalgorithmitselfassertsfor everyspecificdiagnosisexperiment,togetherwiththediagnosis.Resultsof extensivesimulationstudiesarereported,fromwhichitisseenthatthe diagnosiscanbeexpectedtobecompleteoralmostcompletewheneverthenumber offaultsisnomorethanT,andthatthedegreeofcompletenessremainsquite satisfactoryaslongasthenumberoffaultsisbelown/3.Itisalsoseenthat thediagnosisisalmostcertainlycorrectaslongasthenumberoffaultsis belown/2.