Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A Large Scale, Homogenous, Fully Distributed Parallel Machine, II
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures
IEEE Transactions on Computers
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
On group graphs and their fault tolerance
IEEE Transactions on Computers
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Optimal Adaptive Fault Diagnosis of Hypercubes
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
A Local Diagnosability Measure for Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors
IEEE Transactions on Computers
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Automation and Remote Control
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
Discrete Applied Mathematics
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
Fault-tolerant meshes and tori embedded in a faulty supercube
WSEAS Transactions on Computers
WSEAS Transactions on Information Science and Applications
On fault-tolerant embedding of meshes and tori in a flexible hypercube with unbounded expansion
WSEAS TRANSACTIONS on SYSTEMS
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
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Fast and efficient submesh determination in faulty tori
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Graph theoretic characterization and reliability of the multiple-clique network
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
The number of spanning trees of the generalized hypercube network
Mathematical and Computer Modelling: An International Journal
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 15.00 |
Fault- tolerant characteristics of a Boolean n cube array of microprocessors are analyzed. Connectivity properties of the network graph are used to show that n processor or link failures are required to isolate a processor. For processor failures the network is shown to be n (one step) diagnosable. A testing algorithm is presented which can diagnose up to n processor failures.