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

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1987
Accession Number
ADA195542

Entities

People

  • Bill Dally

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Artificial Intelligence
  • Aspect Ratio
  • Bandwidth
  • Collisions
  • Communication Channels
  • Communication Networks
  • Computer Science
  • Computers
  • Equations
  • Grain Size
  • Hot Spots
  • Network Topology
  • Networks
  • Parallel Computing
  • Parallel Processing
  • Simulators
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.