The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

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

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 networksA better upper bound on the bisection width of de Bruijn networksOptimal strategies in the average consensus problemTopological properties of the recursive Petersen architectureA new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphsCartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least threeDecomposition of de bruijn graphsBus interconnection networksHypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systemsThe shuffle exchange network has a Hamiltonian pathCovering 2-paths uniformlyBroadcasting in butterfly and debruijn networksUniform homomorphisms of de Bruijn and Kautz networksBisecting de Bruijn and Kautz graphsSHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORKUnnamed ItemInterconnection Networks and Their EigenvaluesThe shuffle exchange network has a Hamiltonian pathMultidimensional linear congruential graphsShortest routing in trivalent Cayley graph networkTrivalent Cayley graphs for interconnection networksHamilton cycles in Trivalent Cayley graphsA note on recursive properties of the de Bruijn, Kautz and FFT digraphsStirling networks: A versatile combinatorial topology for multiprocessor systemsProduct-shuffle networks: Toward reconciling shuffles and butterfliesDESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONSON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHSAn analysis of the topological properties of the interlaced bypass torus (iBT) networksDistributed sensor networks -- a review of recent research.Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networksThe independence number for de Bruijn networks and Kautz networksExposing graph uniformities via algebraic specificationUNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKSOPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKSRecognizing DNA graphs is difficult.