The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
From MaRDI portal
Publication:3824243
DOI10.1109/12.21149zbMath0671.94028OpenAlexW2046805643MaRDI QIDQ3824243
Maheswara R. Samatham, Dhiraj K. Pradhan
Publication date: 1989
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.21149
Related Items
Broadcasting in butterfly and deBruijn networks ⋮ A better upper bound on the bisection width of de Bruijn networks ⋮ Optimal strategies in the average consensus problem ⋮ Topological properties of the recursive Petersen architecture ⋮ A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs ⋮ Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three ⋮ Decomposition of de bruijn graphs ⋮ Bus interconnection networks ⋮ Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems ⋮ The shuffle exchange network has a Hamiltonian path ⋮ Covering 2-paths uniformly ⋮ Broadcasting in butterfly and debruijn networks ⋮ Uniform homomorphisms of de Bruijn and Kautz networks ⋮ Bisecting de Bruijn and Kautz graphs ⋮ SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK ⋮ Unnamed Item ⋮ Interconnection Networks and Their Eigenvalues ⋮ The shuffle exchange network has a Hamiltonian path ⋮ Multidimensional linear congruential graphs ⋮ Shortest routing in trivalent Cayley graph network ⋮ Trivalent Cayley graphs for interconnection networks ⋮ Hamilton cycles in Trivalent Cayley graphs ⋮ A note on recursive properties of the de Bruijn, Kautz and FFT digraphs ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ Product-shuffle networks: Toward reconciling shuffles and butterflies ⋮ DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ An analysis of the topological properties of the interlaced bypass torus (iBT) networks ⋮ Distributed sensor networks -- a review of recent research. ⋮ Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks ⋮ The independence number for de Bruijn networks and Kautz networks ⋮ Exposing graph uniformities via algebraic specification ⋮ UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS ⋮ OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS ⋮ Recognizing DNA graphs is difficult.
