Fault Diagnosis in a Boolean n Cube Array of Microprocessors

DOI10.1109/TC.1981.1675844MaRDI QIDQ3912739zbMATH OpenOpenAlexFDO

Authors James R. Armstrong, F. Gail Gray

Publication date 1981

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1981.1675844

zbMATH Keywords

diagnosabilityfault tolerance

Mathematics Subject Classification ID

Theory of operating systems (68N25) Fault detection; testing in circuits and networks (94C12)

Recommendations

• On diagnosability of large multiprocessor networks
• On diagnosability of large multiprocessor networks
• scientific article; zbMATH DE number 1617285
• On sequential diagnosis of multiprocessor systems
• A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network

Cited in

(51)

• Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs
• Reliability properties of the hypercube network
• The number of spanning trees of the generalized Boolean \(n\)-cube network
• A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
• On the properties of arbitrary hypercubes
• Distributed subcube identification algorithms for reliable hypercubes
• Stirling networks: A versatile combinatorial topology for multiprocessor systems
• Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs
• The covering radius of Hadamard codes in odd graphs
• An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
• Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
• Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
• Random and conditional \((t,k)\)-diagnosis of hypercubes
• Hybrid fault diagnosis capability analysis of regular graphs
• Edge disjoint paths in hypercubes and folded hypercubes with conditional faults
• The number of spanning trees of the generalized hypercube network
• A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems
• Pancake graphs: structural properties and conditional diagnosability
• Diagnosability for two families of composition networks
• Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
• \(R_g\) conditional diagnosability: a novel generalized measure of system-level diagnosis
• Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model
• Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
• On conditional diagnosability of the folded hypercubes
• A new measure for locally t-diagnosable under PMC model
• Reliabilities for two kinds of graphs with smaller diameters
• Conditional diagnosability of DCCLC graphs under the comparison model
• On the maximal connected component of a hypercube with faulty vertices III
• Diagnosability of Two-Matching Composition Networks
• Fault detection in multiprocessor systems and array processors
• On the maximal connected component of hypercube with faulty vertices (II)
• The number of spanning trees of the regular networks
• On the maximal connected component of hypercube with faulty vertices
• Conditional fault diagnosis of hierarchical hypercubes
• scientific article; zbMATH DE number 1444282 (Why is no real title available?)
• Diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model
• Fault Diagnosis and Repair of Cutpoint Cellular Arrays
• scientific article; zbMATH DE number 2230273 (Why is no real title available?)
• On diagnosability of large multiprocessor networks
• The covering radius of doubled 2-designs in \(2O_ k\)
• Structural diagnosability of hypercubes under the PMC and MM* models
• Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
• The non-inclusion diagnosability of hypercubes under the PMC model
• Topological properties of the directional hypercube
• The h-step limited star connectivity of hypercubes
• The 4-set tree connectivity of folded hypercube
• Star and h-step-limited star connectivity of exchanged hypercubes
• Sharp bounds and characterizations for cut-component numbers of graphs
• Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
• Graph theoretic characterization and reliability of the multiple-clique network
• Bounded edge-connectivity and edge-persistence of Cartesian product of graphs

This page was built for publication: Fault Diagnosis in a Boolean n Cube Array of Microprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3912739)