A regular interconnection network

C. S. Yang, W. S. Hsieh, D. C. Lou, J. S. Tzeng

研究成果: Article同行評審

摘要

A regular interconnection network for large distributed systems which is indicated as Rn is presented, we call it Rn. This interconnection network is based on a mixed radix number system. The system topology is formed by complete graph product and consists of N = n! points, n(n-1)n!/4 lines and is regular of degree n(n-1)/2. The performance of such network is measured through an analysis of its degree, diameter, connectivity, fault tolerance, routing algorithm and reliability. A number of interesting properties of this network are revealed. Those include its average message distance which is approximately equal to (n-Hn), (Hn is the nth Harmonic number), the number of point disjoint paths (n(n-1)/2), and an attractive routing algorithm that is similar to Boolean hypercube. Finally, we show that it posseses super-λ property. The reliability of Rn can also be readily obtained.

原文English
頁(從 - 到)583-587
頁數5
期刊Microprocessing and Microprogramming
32
發行號1-5
DOIs
出版狀態Published - 1991 8月

All Science Journal Classification (ASJC) codes

  • 工程 (全部)

指紋

深入研究「A regular interconnection network」主題。共同形成了獨特的指紋。

引用此