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.
 Publication:

NASA STI/Recon Technical Report N
 Pub Date:
 October 1982
 Bibcode:
 1982STIN...8326000M
 Keywords:

 Computer Programs;
 Distributed Processing;
 Graphic Arts;
 Large Scale Integration;
 Packet Switching;
 Systems Engineering;
 Topology;
 Cost Analysis;
 Input/Output Routines;
 Manipulators;
 Parallel Processing (Computers);
 Robustness (Mathematics);
 Tradeoffs;
 Electronics and Electrical Engineering