A high performance interconnection network for multiprocessor systems

DOI10.1016/0167-8191(93)90092-YMaRDI QIDQ688186zbMATH OpenFDO

Authors Hong Shen

Publication date 28 November 1993

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90092-Y

zbMATH Keywords

costdegreediameterinterconnection networkperformancerecursive expansionsize

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Review text

This paper presents a high performance interconnection network, \({\mathcal P}^ \Sigma_ r\)-network, constructed by the recursive expansion (RE) method on the basis of the Petersen graph. The network contains \(10^{r+1}\) nodes and has degree 6, diameter \(4r+2\) and cost \(24r+12\) (product of the degree and diameter) for \(0\leq r\leq 10\). The cost of the network is considerably lower than the torus and hypercube and is comparable with the CCC of the same size. The diameter is lower than the torus and CCC and is comparable with the hypercube. In addition to low cost, the \({\mathcal P}^ \Sigma_ r\)-network also possesses other properties such as high scalability, regular topology and efficient message routing.

Recommendations

• Construction of large‐size interconnection networks with high performance
• A practical interconnection network \(\text{RP}(k)\) and its routing algorithms
• scientific article; zbMATH DE number 1983293
• Topological properties of the recursive Petersen architecture
• scientific article; zbMATH DE number 841652

Cited in

(13)

• Topological properties of the recursive Petersen architecture
• scientific article; zbMATH DE number 1004352 (Why is no real title available?)
• The structure of PEC networks
• On the interconnected networks based on ringed crossed-cube Petersen
• Low Diameter Interconnections for Routing in High-Performance Parallel Systems
• A High Performance Computing Platform Based on a Fibre-Channel Token-Routing Switch-Network
• A Symmetric Tree Structure Interconnection Network and its Message Traffic
• scientific article; zbMATH DE number 1487620 (Why is no real title available?)
• Construction of large‐size interconnection networks with high performance
• Topology and routing algorithms of double-loops connected Petersen graph networks
• The search for an optimal multiprocessor interconnection network
• Dense Gaussian networks: Suitable topologies for on-chip multiprocessors
• A practical interconnection network \(\text{RP}(k)\) and its routing algorithms

This page was built for publication: A high performance interconnection network for multiprocessor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688186)