A unified theory of interconnection network structure

DOI10.1016/0304-3975(86)90084-8MaRDI QIDQ1088405zbMATH OpenOpenAlexFDO

Authors Clyde Kruskal, Marc Snir

Publication date 1986

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

Full work available at URL https://doi.org/10.1016/0304-3975(86)90084-8

zbMATH Keywords

Banyan networkbaseline networksbidelta networksdelta networksdelta propertyflip networksfunctional propertiesGraph-theoretical characterizationsindirect binary cube networkslabelling schemesmodified data manipulatorsmultistage networkomega networkspacket-switching networkprocessor networksroutingtopology of interconnection networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99) Applications of graph theory to circuits and networks (94C15)

Recommendations

• 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

Cites work

• 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

Cited in

(25)

• 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)