Skip to main navigation Skip to search Skip to main content

EQUIVALENCE BETWEEN CUBE-CONNECTED CYCLES NETWORKS AND CIRCULAR SHUFFLE NETWORKS.

  • Bijendra N. Jain
  • , Satish K. Tripathi
  • University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

A demonstration is presented of the topological equivalence between two classes of computer architectures that support parallel computation, viz. cube-connected cycles network (CCC) and homogeneous circular shuffle network (HCSN). The latter is based on the perfect shuffle connection. By developing a suitable and common notation for addressing processing elements and specifying interconnections in the two networks, it is shown that the two classes are topologically equivalent. The implications of such an equivalence are described. Known properties and algorithms of HCSN networks, with respect to routing and fault tolerance, thereby become applicable to CCC networks. It is also shown that a large class of algorithms that run on a CCC network can also be implemented, with slight modification, on an HCSN network.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsKai Hwang, Steven M. Jacobs, Earl E. Swartzlander
PublisherIEEE
Pages8-11
Number of pages4
ISBN (Print)0818607246
StatePublished - 1986

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Fingerprint

Dive into the research topics of 'EQUIVALENCE BETWEEN CUBE-CONNECTED CYCLES NETWORKS AND CIRCULAR SHUFFLE NETWORKS.'. Together they form a unique fingerprint.

Cite this