Fault Diagnosis in a Boolean n Cube Array of Microprocessors
From MaRDI portal
Publication:3912739
DOI10.1109/TC.1981.1675844zbMath0461.94023OpenAlexW2055402279MaRDI QIDQ3912739
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
Related Items
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model, Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks, Unnamed Item, Reliability properties of the hypercube network, The number of spanning trees of the generalized Boolean \(n\)-cube network, On the maximal connected component of hypercube with faulty vertices, A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor, Random and conditional \((t,k)\)-diagnosis of hypercubes, Diagnosability for two families of composition networks, Structural diagnosability of hypercubes under the PMC and MM* models, Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube, Diagnosability of Two-Matching Composition Networks, A new measure for locally \(t\)-diagnosable under PMC model, Reliabilities for two kinds of graphs with smaller diameters, Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model, Hybrid fault diagnosis capability analysis of regular graphs, Graph theoretic characterization and reliability of the multiple-clique network, Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model, On the properties of arbitrary hypercubes, Distributed subcube identification algorithms for reliable hypercubes, Edge disjoint paths in hypercubes and folded hypercubes with conditional faults, Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions, Topological properties of the directional hypercube, The covering radius of doubled 2-designs in \(2O_ k\), 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, On the maximal connected component of hypercube with faulty vertices (II), On conditional diagnosability of the folded hypercubes, Diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model, An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links, Bounded edge-connectivity and edge-persistence of Cartesian product of graphs, The number of spanning trees of the generalized hypercube network, On the maximal connected component of a hypercube with faulty vertices III, \(R_g\) conditional diagnosability: a novel generalized measure of system-level diagnosis, Conditional diagnosability of DCCLC graphs under the comparison model, Unnamed Item, The number of spanning trees of the regular networks, Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs, A new structure for a vertex to be locally \(t\)-diagnosable in large multiprocessor systems, Pancake graphs: structural properties and conditional diagnosability, Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
