A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
From MaRDI portal
Publication:1881297
DOI10.1016/j.jpdc.2004.02.002zbMath1101.68391OpenAlexW2072512967MaRDI QIDQ1881297
Publication date: 4 October 2004
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.02.002
Related Items
A diagnosis algorithm by using graph-coloring under the PMC model ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network ⋮ Fault isolation and identification in general biswapped networks under the PMC diagnostic model ⋮ The pessimistic diagnosabilities of some general regular graphs ⋮ Reliability of \((n,k)\)-star network based on \(g\)-extra conditional fault ⋮ The pessimistic diagnosability of alternating group graphs under the PMC model ⋮ A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ A (4n − 9)/3 diagnosis algorithm for generalised cube networks ⋮ The pessimistic diagnosability of three kinds of graphs ⋮ Performance analysis of an evolutionary algorithm for fault detection int-diagnosable multi-processor systems ⋮ A parallel genetic algorithm for identifying faults in large diagnosable systems ⋮ Two-round diagnosability measures for multiprocessor systems
