Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks

DOI10.1016/0304-3975(89)90061-3zbMath0667.94026OpenAlexW1989960973MaRDI QIDQ1117906

Jean-Michel Fourneau, Jean-Claude Bermond

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90061-3

zbMATH Keywords

multistage interconnection networksBanyan networksBaseline networkgraph characterization of networksindependent connectionsinterconnection schemePIPID permutation

Mathematics Subject Classification ID

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

Related Items (1)

A graph theoretical approach to equivalence of multistage interconnection networks

Cites Work

• Unnamed Item
• A unified theory of interconnection network structure
• A graph theoretical approach to equivalence of multistage interconnection networks
• Permuting data with the Omega network
• Notes on Shuffle/Exchange-Type Switching Networks
• On a Class of Multistage Interconnection Networks
• Access and Alignment of Data in an Array Processor
• The Indirect Binary n-Cube Microprocessor Array
• Data Manipulating Functions in Parallel Processors and Their Implementations

This page was built for publication: Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks