The Indirect Binary n-Cube Microprocessor Array

From MaRDI portal
Revision as of 09:09, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4132159

DOI10.1109/TC.1977.1674863zbMath0359.94057OpenAlexW2132733020MaRDI QIDQ4132159

M. C. III Pease

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 (26)

A neural sorting network with O(1) time complexityA unified theory of interconnection network structureGeneralizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranksReliability properties of the hypercube networkHow robust is the n-cube?Parallel solution of block tridiagonal linear systemsThe number of spanning trees of the generalized Boolean \(n\)-cube networkIndependent connections: An easy characterization of baseline-equivalent multistage interconnection networksA graph theoretical approach to equivalence of multistage interconnection networksUniversality of iterated networksTime-optimal simulations of networks by universal parallel computersA local-sparing design methodology for fault-tolerant multiprocessorsHigh density graphs for processor interconnectionDistributed algorithms for maximum cliquesA reliable and fault-tolerant interconnection networkHypercube permutations routable under all dimension orderingsParallel stereocorrelation on a reconfigurable multi-ring network.A theory of decomposition into prime factors of layered interconnection networksPermutation-exchange graphs that emulate the binary cubePermutations on the block PRAMMapping finite element graphs on hypercubesThe number of spanning trees of the generalized hypercube networkUnnamed ItemFault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networksEfficient graph automorphism by vertex partitioningVulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness







This page was built for publication: The Indirect Binary n-Cube Microprocessor Array