Embedding of linear array and binary tree in cubical ring connected cycles networks

Chungti Liang, Yigang Chen, Wei Tek Tsai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The cubical ring connected cycles (CRCC) network, a modified version of cube connected cycles (CCC) network, preserves all the desirable aspects of CCC, such as fixed node connectivity, modularity, ease of layout, and capability of pipelining and parallelism, and can emulate the topology of a CCC even in the case of multiple failures of processors and links. To enhance the capability of dynamic reconfiguration, the authors study the embedding of linear arrays and complete binary trees in CRCC. The expansion and dilation cost of their embedding method is analyzed. A distributed algorithm for binary tree embedding is presented.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
Editors Anon
PublisherPubl by IEEE
Pages192-195
Number of pages4
Volume1
StatePublished - 1989
Externally publishedYes
EventProceedings of the 1989 International Conference on Parallel Processing - University Park, PA, USA
Duration: Aug 8 1989Aug 12 1989

Other

OtherProceedings of the 1989 International Conference on Parallel Processing
CityUniversity Park, PA, USA
Period8/8/898/12/89

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Embedding of linear array and binary tree in cubical ring connected cycles networks'. Together they form a unique fingerprint.

  • Cite this

    Liang, C., Chen, Y., & Tsai, W. T. (1989). Embedding of linear array and binary tree in cubical ring connected cycles networks. In Anon (Ed.), Proceedings of the International Conference on Parallel Processing (Vol. 1, pp. 192-195). Publ by IEEE.