VLSI Mesh Routing Systems

Abstract

For message-passing concurrent computers with very few nodes, it is practical to use a full interconnection scheme between nodes A full interconnection of channels quickly becomes impractical as the number of nodes increases since each node of an N node machine must have N - 1 connections. A configuration used for larger message passing multicomputers such as the Caltech Cosmic Cube [Seitz 85] and its commercial descendants is that of a binary n-cube (or hypercube) to connect N = 2" nodes. Each node has n = log2N connections, and a message never has to travel through more than n channels to reach its destination.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1987
Accession Number
ADA451791

Entities

People

  • Charles M. Flaig

Organizations

  • California Institute of Technology

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Availability
  • Classification
  • Computers
  • Contracts
  • Information Operations
  • Instructions
  • Monitoring
  • Security
  • Standards

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Parallel and Distributed Computing.