On rearrangeability of multirate Clos networks

Guo Hui Lin; Ding Zhu Du; Xiao Dong Hu; Guoliang Xue

doi:10.1137/S0097539796313921

On rearrangeability of multirate Clos networks

Guo Hui Lin, Ding Zhu Du, Xiao Dong Hu, Guoliang Xue

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

13 Scopus citations

Abstract

Chung and Ross conjectured that the multirate three-stage Clos network is rearrangeable in the general discrete bandwidth case. In the present work, this conjecture is proven in several cases. In particular, it is shown that the conjecture is true not only in the discrete bandwidth case but also in arbitrary case.

Original language	English (US)
Pages (from-to)	1225-1231
Number of pages	7
Journal	SIAM Journal on Computing
Volume	28
Issue number	4
DOIs	https://doi.org/10.1137/S0097539796313921
State	Published - 1999
Externally published	Yes

ASJC Scopus subject areas

Computer Science(all)
Mathematics(all)

Access to Document

10.1137/S0097539796313921

Cite this

@article{13be8845cee847efa44fdf3da98364a7,

title = "On rearrangeability of multirate Clos networks",

abstract = "Chung and Ross conjectured that the multirate three-stage Clos network is rearrangeable in the general discrete bandwidth case. In the present work, this conjecture is proven in several cases. In particular, it is shown that the conjecture is true not only in the discrete bandwidth case but also in arbitrary case.",

author = "Lin, {Guo Hui} and Du, {Ding Zhu} and Hu, {Xiao Dong} and Guoliang Xue",

year = "1999",

doi = "10.1137/S0097539796313921",

language = "English (US)",

volume = "28",

pages = "1225--1231",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - On rearrangeability of multirate Clos networks

AU - Lin, Guo Hui

AU - Du, Ding Zhu

AU - Hu, Xiao Dong

AU - Xue, Guoliang

PY - 1999

Y1 - 1999

N2 - Chung and Ross conjectured that the multirate three-stage Clos network is rearrangeable in the general discrete bandwidth case. In the present work, this conjecture is proven in several cases. In particular, it is shown that the conjecture is true not only in the discrete bandwidth case but also in arbitrary case.

AB - Chung and Ross conjectured that the multirate three-stage Clos network is rearrangeable in the general discrete bandwidth case. In the present work, this conjecture is proven in several cases. In particular, it is shown that the conjecture is true not only in the discrete bandwidth case but also in arbitrary case.

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

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

U2 - 10.1137/S0097539796313921

DO - 10.1137/S0097539796313921

M3 - Article

AN - SCOPUS:0032640959

VL - 28

SP - 1225

EP - 1231

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 4

ER -

On rearrangeability of multirate Clos networks

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this