Monotone routing in multirate rearrangeable Clos networks

Xiao-Dong Hu; Xiao-Hua Jia; Ding-Zhu Du; Frank K. Hwang

doi:10.1006/jpdc.2001.1755

Monotone routing in multirate rearrangeable Clos networks

Xiao-Dong Hu
, Xiao-Hua Jia
, Ding-Zhu Du
, Frank K. Hwang

Department of Computer Science

Research output: Journal Publications and Reviews › Comment/debate

9 Citations (Scopus)

Abstract

In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. © 2001 Academic Press.

Original language	English
Pages (from-to)	1382-1388
Journal	Journal of Parallel and Distributed Computing
Volume	61
Issue number	9
DOIs	https://doi.org/10.1006/jpdc.2001.1755
Publication status	Published - 2001

Access Output

10.1006/jpdc.2001.1755

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{07b168aa4b3c4a9da0cfd9877d87dfc0,

title = "Monotone routing in multirate rearrangeable Clos networks",

abstract = "In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. {\textcopyright} 2001 Academic Press.",

author = "Xiao-Dong Hu and Xiao-Hua Jia and Ding-Zhu Du and Hwang, \{Frank K.\}",

year = "2001",

doi = "10.1006/jpdc.2001.1755",

language = "English",

volume = "61",

pages = "1382--1388",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "9",

}

TY - JOUR

T1 - Monotone routing in multirate rearrangeable Clos networks

AU - Hu, Xiao-Dong

AU - Jia, Xiao-Hua

AU - Du, Ding-Zhu

AU - Hwang, Frank K.

PY - 2001

Y1 - 2001

N2 - In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. © 2001 Academic Press.

AB - In this paper, we study monotone routing in the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches, we show that monotone routing is better than the previous methods. © 2001 Academic Press.

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

UR - https://www.scopus.com/pages/publications/0035185229#tab=impact

U2 - 10.1006/jpdc.2001.1755

DO - 10.1006/jpdc.2001.1755

M3 - Comment/debate

SN - 0743-7315

VL - 61

SP - 1382

EP - 1388

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 9

ER -

Monotone routing in multirate rearrangeable Clos networks

Abstract

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this