Product-shuffle networks: Toward reconciling shuffles and butterflies

DOI10.1016/0166-218X(92)90152-ZzbMath0770.94011MaRDI QIDQ1199448

Arnold L. Rosenberg

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

crossproduct of the Bruijn networksinterconnection networks of parallel processors in integrated circuitry

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ An approach to emulating separable graphs ⋮ Feedback vertex sets in mesh-based networks ⋮ Metric dimension of directed graphs ⋮ DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS ⋮ UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS ⋮ A finite automata approach to modeling the cross product of interconnection networks. ⋮ EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• Gray codes, fast Fourier transforms and hypercubes
• Binary Ring Sequences
• Optimal embeddings of butterfly-like graphs in the hypercube
• A unified framework for off-line permutation routing in parallel networks
• Group Action Graphs and Parallel Architectures
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Efficient Embeddings of Trees in Hypercubes
• Optimal emulations by butterfly-like networks
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Product-shuffle networks: Toward reconciling shuffles and butterflies