Accession Number : ADA195542

Title :   Performance Analysis of K-Ary N-Cube Interconnection Networks.

Descriptive Note : Memorandum rept.,

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE MICROSYSTEMS RESEARCH CENTER

Personal Author(s) : Dally, William J

PDF Url : ADA195542

Report Date : Nov 1987

Pagination or Media Count : 28

Abstract : 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)

Descriptors :   *COMMUNICATIONS NETWORKS, *PARALLEL PROCESSORS, *COMPUTER COMMUNICATIONS, *SWITCHING CIRCUITS, CIRCUIT INTERCONNECTIONS, COMPUTATIONS, COSTS, DUAL MODE, EXPERIMENTAL DATA, INTEGRATION, MEASUREMENT, MULTIPROCESSORS, NETWORKS, PARALLEL PROCESSING, PERFORMANCE TESTS, SWITCHES, THROUGHPUT, WIRE, ELECTRONIC SWITCHING

Subject Categories : Non-radio Communications
      Computer Hardware
      Computer Systems

Distribution Statement : APPROVED FOR PUBLIC RELEASE