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

Fingerprint

Binary trees
Parallel algorithms
Topology
Costs

ASJC Scopus subject areas

  • Hardware and Architecture

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.

Embedding of linear array and binary tree in cubical ring connected cycles networks. / Liang, Chungti; Chen, Yigang; Tsai, Wei Tek.

Proceedings of the International Conference on Parallel Processing. ed. / Anon. Vol. 1 Publ by IEEE, 1989. p. 192-195.

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

Liang, C, Chen, Y & Tsai, WT 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, Publ by IEEE, pp. 192-195, Proceedings of the 1989 International Conference on Parallel Processing, University Park, PA, USA, 8/8/89.
Liang C, Chen Y, Tsai WT. Embedding of linear array and binary tree in cubical ring connected cycles networks. In Anon, editor, Proceedings of the International Conference on Parallel Processing. Vol. 1. Publ by IEEE. 1989. p. 192-195
Liang, Chungti ; Chen, Yigang ; Tsai, Wei Tek. / Embedding of linear array and binary tree in cubical ring connected cycles networks. Proceedings of the International Conference on Parallel Processing. editor / Anon. Vol. 1 Publ by IEEE, 1989. pp. 192-195
@inproceedings{765c481744da4259b8170c0cbdfc2f57,
title = "Embedding of linear array and binary tree in cubical ring connected cycles networks",
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.",
author = "Chungti Liang and Yigang Chen and Tsai, {Wei Tek}",
year = "1989",
language = "English (US)",
volume = "1",
pages = "192--195",
editor = "Anon",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Liang, Chungti

AU - Chen, Yigang

AU - Tsai, Wei Tek

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024876444&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024876444&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024876444

VL - 1

SP - 192

EP - 195

BT - Proceedings of the International Conference on Parallel Processing

A2 - Anon, null

PB - Publ by IEEE

ER -