CSpace
On rearrangeability of multirate Clos networks
Lin, GH; Du, DZ; Hu, XD; Xue, GL
1999-04-29
Source PublicationSIAM JOURNAL ON COMPUTING
ISSN0097-5397
Volume28Issue:4Pages:1225-1231
AbstractChung 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.
Keywordrearrangeability multirate Clos networks minimization of the number of center switches
Language英语
WOS Research AreaComputer Science ; Mathematics
WOS SubjectComputer Science, Theory & Methods ; Mathematics, Applied
WOS IDWOS:000079990400006
PublisherSIAM PUBLICATIONS
Citation statistics
Cited Times:10[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/14601
Collection中国科学院数学与系统科学研究院
Affiliation1.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.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Lin, GH]'s Articles
[Du, DZ]'s Articles
[Hu, XD]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lin, GH]'s Articles
[Du, DZ]'s Articles
[Hu, XD]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lin, GH]'s Articles
[Du, DZ]'s Articles
[Hu, XD]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.