Performance Analysis of K-ary N-cube Interconnection Networks
Author | : W. J. Dally |
Publisher | : |
Total Pages | : 28 |
Release | : 1987 |
ISBN-10 | : OCLC:123328197 |
ISBN-13 | : |
Rating | : 4/5 ( Downloads) |
Download or read book Performance Analysis of K-ary N-cube Interconnection Networks written by W. J. Dally and published by . This book was released on 1987 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt: VLSI communication networks are wire limited. The cost of network is not a function of the number of switches require, but rather a function of the wiring density required to construct the network. This paper analyzes communications networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks with constant bisection are derived that agree closely with experimental measurements. It is shown that low-dimensional networks (e.g., tori) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width. Keywords: Communication networks; Interconnection networks; Concurrent computing; Message passing multiprocessors; Parallel processing; Very large scale integration. (jhd).