KMS Of Academy of mathematics and systems sciences, CAS
On rearrangeability of multirate Clos networks | |
Lin, GH; Du, DZ; Hu, XD; Xue, GL | |
1999-04-29 | |
Source Publication | SIAM JOURNAL ON COMPUTING |
ISSN | 0097-5397 |
Volume | 28Issue:4Pages:1225-1231 |
Abstract | Chung and Ross [SIAM J. Comput., 20 (1991), pp. 726-736] conjectured that the multirate three-stage Clos network C(n, 2n ? 1, r) is rearrangeable in the general discrete bandwidth case; i.e., each connection has a weight chosen from a given finite set {p(1), p(2),..., p(k)} where 1 greater than or equal to p(1) > p(2) > ... > p(k) > 0 and p(i) is an integer multiple of p(k), denoted by p(k) \ p(i), for 1 less than or equal to i less than or equal to k ? 1. In this paper, we prove that multirate three-stage Clos network C(n; 2n ? 1; r) is rearrangeable when each connection has a weight chosen from a given finite set {p(1), p(2),..., p(k)} where 1 greater than or equal to p(1) > p(2) > ... > p(h) > 1/2 greater than or equal to p(h+1) > ... > p(k) > 0 and p(h+2) \ p(h+1), p(h+3) \ p(h+2),..., pk \ p(k?1). We also prove that C(n, 2n ? 1, r) is two-rate rearrangeable and C(n, [7n/3], r) is three-rate rearrangeable. |
Keyword | rearrangeability multirate Clos networks minimization of the number of center switches |
Language | 英语 |
WOS Research Area | Computer Science ; Mathematics |
WOS Subject | Computer Science, Theory & Methods ; Mathematics, Applied |
WOS ID | WOS:000079990400006 |
Publisher | SIAM PUBLICATIONS |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/14601 |
Collection | 中国科学院数学与系统科学研究院 |
Affiliation | 1.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China 2.Univ Minnesota, Dept Comp Sci, Minneapolis, MN 55455 USA 3.Univ Vermont, Dept Comp Sci & Elect Engn, Burlington, VT 05405 USA |
Recommended Citation GB/T 7714 | Lin, GH,Du, DZ,Hu, XD,et al. On rearrangeability of multirate Clos networks[J]. SIAM JOURNAL ON COMPUTING,1999,28(4):1225-1231. |
APA | Lin, GH,Du, DZ,Hu, XD,&Xue, GL.(1999).On rearrangeability of multirate Clos networks.SIAM JOURNAL ON COMPUTING,28(4),1225-1231. |
MLA | Lin, GH,et al."On rearrangeability of multirate Clos networks".SIAM JOURNAL ON COMPUTING 28.4(1999):1225-1231. |
Files in This Item: | ||||||
There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment