The Indirect Binary n-Cube Microprocessor Array
From MaRDI portal
Publication:4132159
DOI10.1109/TC.1977.1674863zbMath0359.94057OpenAlexW2132733020MaRDI QIDQ4132159
Publication date: 1977
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1977.1674863
Related Items
A neural sorting network with O(1) time complexity, A unified theory of interconnection network structure, Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks, Reliability properties of the hypercube network, How robust is the n-cube?, Parallel solution of block tridiagonal linear systems, The number of spanning trees of the generalized Boolean \(n\)-cube network, Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks, A graph theoretical approach to equivalence of multistage interconnection networks, Universality of iterated networks, Time-optimal simulations of networks by universal parallel computers, A local-sparing design methodology for fault-tolerant multiprocessors, High density graphs for processor interconnection, Distributed algorithms for maximum cliques, A reliable and fault-tolerant interconnection network, Hypercube permutations routable under all dimension orderings, Parallel stereocorrelation on a reconfigurable multi-ring network., A theory of decomposition into prime factors of layered interconnection networks, Permutation-exchange graphs that emulate the binary cube, Permutations on the block PRAM, Mapping finite element graphs on hypercubes, The number of spanning trees of the generalized hypercube network, Unnamed Item, Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks, Efficient graph automorphism by vertex partitioning, Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
