A Comparison of Cube Type and Data Manipulator Type Network,

Abstract

The interconnection of a large number of processors and other devices to form a parallel/distributed computing system is a research area receiving a great deal of attention. One method is to use a multistage network. This paper compares two classes of multistage networks by examining two representative networks: the Generalized Cube and the Augmented Data Manipulator. The two topologies are compared using a graph theoretic approach. By interpreting the graphical representations of the networks in different ways, different implementations result. The costs of the various implementations are compared taking very large scale integration considerations into account. Finally, the robustness of the different networks is measured and contrasted. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1982
Accession Number
ADA125010

Entities

People

  • Howard Jay Siegal
  • Robert J. Mcmillen

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Classification
  • Computers
  • Computing System Architectures
  • Control
  • Data Processing
  • Distributed Computing
  • Electrical Engineering
  • Engineering
  • Fault Tolerance
  • Graph Theory
  • Image Processing
  • Large Scale Integration
  • Packet Switching
  • Parallel Computing
  • Parallel Processing
  • Topology
  • Very Large Scale Integration

Readers

  • Computer Networking
  • Robotics and Automation.
  • Systems Analysis and Design