A uniform network for VLSI massively parallel computers

✍ Scribed by Kazuhiko Iwasaki; Christian Iseli; Yuji Sato

• Publisher: John Wiley and Sons
• Year: 1993
• Tongue: English
• Weight: 756 KB
• Volume: 24
• Category: Article
• ISSN: 0882-1666
• DOI: 10.1002/scj.4690240903

✦ Synopsis

Abstract

Symmetrical Network Topologies (SNT's) for VLSI massively parallel computers are proposed. VLSI massively parallel computers can be expected to integrate more than dozens of processing elements. It is desired that the network in such a VLSI system is regular.

SNT consists of a two‐dimensional end‐around mesh with supplementary symmetrical branch connections, and therefore, it satisfies the condition of regularity. In this paper it is shown that the SNT's have desirable characteristics with regard to diameter and average distance. That is, the SNTs have smaller diameters and average distance compared to the hypercubes with the same number of nodes. For example, for 4096 nodes, the degree, diameter and average distance of a hypercube are 12, 12 and 6.001, respectively. The degree, diameter and average distance of the SNT can be 8, 8 and 5.324, respectively. It is shown also that SNTs are maximally connected graphs resulting in a fault‐tolerant network. Results show that SNT's are well suited for the VSLI implementation of massively parallel computers.