A unified theory of interconnection network structure
Banyan networkbaseline networksbidelta networksdelta networksdelta propertyflip networksfunctional propertiesGraph-theoretical characterizationsindirect binary cube networkslabelling schemesmodified data manipulatorsmultistage networkomega networkspacket-switching networkprocessor networksroutingtopology of interconnection networks
The relationship between the topology of interconnection networks and their functional properties is examined. Graph-theoretical characterizations are derived for delta networks, which have a simple routing scheme, and for bidelta networks, which have the delta property in both directions. Delta networks are shown to have a recursive structure. Bidelta networks are shown to have a unique topology. The definition of bidelta network is used to derive in a uniform manner the labelling schemes that define the omega networks, indirect binary cube networks, flip networks, baseline networks, modified data manipulators and two new networks; these schemes are generalized to arbitrary radices. The labelling schemes are used to characterize networks with simple routing. In another paper [Current advances in distributed computing and communications, 91-113 (1987; Zbl 0604.68036)], we characterize the networks with optimal performance/cost ratio. Only the multistage shuffle-exchange networks have both optimal performance/cost ratio and simple routing. This helps explain why few fundamentally different geometries have been proposed.
- Cost-performance tradeoffs for interconnection networks
- On recurrent and recursive interconnection patterns
- scientific article; zbMATH DE number 3976322
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
- Topological properties of interconnection networks
- Access and Alignment of Data in an Array Processor
- Data Manipulating Functions in Parallel Processors and Their Implementations
- scientific article; zbMATH DE number 3976322 (Why is no real title available?)
- Notes on Shuffle/Exchange-Type Switching Networks
- On a Class of Multistage Interconnection Networks
- The Indirect Binary n-Cube Microprocessor Array
- Independent connections: An easy characterization of baseline-equivalent multistage interconnection networks
- A graph theoretical approach to equivalence of multistage interconnection networks
- Cost-performance tradeoffs for interconnection networks
- Methods for message routing in parallel machines
- Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
- Synthesis of structure of regional computer networks under additional conditions
- The structure of PEC networks
- EFFICIENT ROUTING ALGORITHMS FOR GENERALIZED SHUFFLE-EXCHANGE NETWORKS
- scientific article; zbMATH DE number 3976322 (Why is no real title available?)
- scientific article; zbMATH DE number 4057550 (Why is no real title available?)
- scientific article; zbMATH DE number 1334211 (Why is no real title available?)
- A lower bound for sorting networks based on the shuffle permutation
- scientific article; zbMATH DE number 2080259 (Why is no real title available?)
- scientific article; zbMATH DE number 1839577 (Why is no real title available?)
- A multiscale approach to connectivity
- A theory of decomposition into prime factors of layered interconnection networks
- An improved non-repudiation protocol and its security analysis
- The Cacophony of Interconnected Networks
- Topological properties of interconnection networks
- The impact of randomization in smoothing networks
- Highly symmetric expanders
- Information flow and interconnections in computing: extensions and applications of rent's rule
- An analysis of the topological properties of the interlaced bypass torus (iBT) networks
- MLMIN: a multicore processor and parallel computer network topology for multicast
- All-to-all personalized exchange in generalized shuffle-exchange networks
This page was built for publication: A unified theory of interconnection network structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088405)
