Unidirectional cube connected cycles

S. Bhattacharya; Y. H. Choi; W. T. Tsai

Unidirectional cube connected cycles

S. Bhattacharya^*
, Y. H. Choi
, W. T. Tsai

^*Corresponding author for this work

University of Minnesota Twin Cities

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Cube connected cycles (CCC), a popular and layout-efficient alternative to the hyper-cube, uses duplex dimensional links. The paper proposes a variant of the CCC interconnection using simplex dimensional links. Usage of simplex links (instead of duplex) is shown to have design advantages. Cost-performance comparison of the proposed 'Directional cube connected cycles' (DCCC) structure with bidirectional CCC is shown. DCCC layout is compared with CCC layout and a routing algorithm for DCCC is proposed. A method for porting CCC algorithms to DCCC is provided, and the extent of slowdown is evaluated. DCCC can embed a loop with unit dilation and unit expansion.

Original language	English
Pages (from-to)	191-195
Number of pages	5
Journal	IEE Proceedings E: Computers and Digital Techniques
Volume	140
Issue number	4
State	Published - Jul 1993
Externally published	Yes

Cite this

@article{38c1ebdce1764d369c2de657bfc1891c,

title = "Unidirectional cube connected cycles",

abstract = "Cube connected cycles (CCC), a popular and layout-efficient alternative to the hyper-cube, uses duplex dimensional links. The paper proposes a variant of the CCC interconnection using simplex dimensional links. Usage of simplex links (instead of duplex) is shown to have design advantages. Cost-performance comparison of the proposed 'Directional cube connected cycles' (DCCC) structure with bidirectional CCC is shown. DCCC layout is compared with CCC layout and a routing algorithm for DCCC is proposed. A method for porting CCC algorithms to DCCC is provided, and the extent of slowdown is evaluated. DCCC can embed a loop with unit dilation and unit expansion.",

author = "S. Bhattacharya and Choi, \{Y. H.\} and Tsai, \{W. T.\}",

year = "1993",

month = jul,

language = "英语",

volume = "140",

pages = "191--195",

journal = "IEE Proceedings E: Computers and Digital Techniques",

issn = "0143-7062",

publisher = "Institution of Electrical Engineers (IEE)",

number = "4",

}

TY - JOUR

T1 - Unidirectional cube connected cycles

AU - Bhattacharya, S.

AU - Choi, Y. H.

AU - Tsai, W. T.

PY - 1993/7

Y1 - 1993/7

N2 - Cube connected cycles (CCC), a popular and layout-efficient alternative to the hyper-cube, uses duplex dimensional links. The paper proposes a variant of the CCC interconnection using simplex dimensional links. Usage of simplex links (instead of duplex) is shown to have design advantages. Cost-performance comparison of the proposed 'Directional cube connected cycles' (DCCC) structure with bidirectional CCC is shown. DCCC layout is compared with CCC layout and a routing algorithm for DCCC is proposed. A method for porting CCC algorithms to DCCC is provided, and the extent of slowdown is evaluated. DCCC can embed a loop with unit dilation and unit expansion.

AB - Cube connected cycles (CCC), a popular and layout-efficient alternative to the hyper-cube, uses duplex dimensional links. The paper proposes a variant of the CCC interconnection using simplex dimensional links. Usage of simplex links (instead of duplex) is shown to have design advantages. Cost-performance comparison of the proposed 'Directional cube connected cycles' (DCCC) structure with bidirectional CCC is shown. DCCC layout is compared with CCC layout and a routing algorithm for DCCC is proposed. A method for porting CCC algorithms to DCCC is provided, and the extent of slowdown is evaluated. DCCC can embed a loop with unit dilation and unit expansion.

UR - https://www.scopus.com/pages/publications/0027627108

M3 - 文章

AN - SCOPUS:0027627108

SN - 0143-7062

VL - 140

SP - 191

EP - 195

JO - IEE Proceedings E: Computers and Digital Techniques

JF - IEE Proceedings E: Computers and Digital Techniques

IS - 4

ER -

Unidirectional cube connected cycles

Abstract

Other files and links

Fingerprint

Cite this