A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model
IEEE Transactions on Computers
Graph Theory and Interconnection Networks
Graph Theory and Interconnection Networks
Strongly Diagnosable Systems under the Comparison Diagnosis Model
IEEE Transactions on Computers
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model
IEEE Transactions on Parallel and Distributed Systems
The Conditional Diagnosability of Hypercubes under the Comparison Model
ICIE '09 Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01
Diagnosability of star graphs under the comparison diagnosis model
Information Processing Letters
Conditional diagnosability of matching composition networks under the PMC model
IEEE Transactions on Circuits and Systems II: Express Briefs
Conditional diagnosability of alternating group networks
Information Processing Letters
Conditional diagnosability of hypermeshes under the comparison model
Information Processing Letters
Diagnosability of Two-Matching Composition Networks under the MM{}^{\ast} Model
IEEE Transactions on Dependable and Secure Computing
Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications
IEEE Transactions on Dependable and Secure Computing
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
Determining the conditional diagnosability of k-ary n-cubes under the MM* model
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
IEEE Transactions on Parallel and Distributed Systems
Conditional Diagnosability of Augmented Cubes under the PMC Model
IEEE Transactions on Dependable and Secure Computing
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Theoretical Computer Science
The edge-centered surface area of the arrangement graph
Journal of Combinatorial Optimization
Hi-index | 5.23 |
We develop a general and demonstrably widely applicable technique for determining the asymptotic conditional diagnosability of interconnection networks prevalent within parallel computing under the comparison diagnosis model. We apply our technique to replicate (yet extend) existing results for hypercubes and k-ary n-cubes before going on to obtain new results as regards folded hypercubes, pancake graphs and augmented cubes. In particular, we show that the asymptotic conditional diagnosability of: folded hypercubes {FQ"n} is 3n-2, pancake graphs {P"n} is 3n-7, and augmented cubes {AQ"n} is 6n-17. We demonstrate how our technique is independent of structural properties of the interconnection network G in question and essentially only dependent upon the minimal size of the neighbourhood of a path of length 2 in G, the number of neighbours any two distinct vertices of G have in common, and the minimal degree of any vertex in G.