On rearrangeability of multirate Clos networks

CSpace > 应用数学研究所

	On rearrangeability of multirate Clos networks
	Lin, GH ; Du, DZ ; Hu, XD; Xue, GL
	1999-04-29
发表期刊	SIAM JOURNAL ON COMPUTING
ISSN	0097-5397
卷号	28 期号:4 页码:1225-1231
摘要	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.
关键词	rearrangeability multirate Clos networks minimization of the number of center switches
语种	英语
WOS研究方向	Computer Science ; Mathematics
WOS类目	Computer Science, Theory & Methods ; Mathematics, Applied
WOS记录号	WOS:000079990400006
出版者	SIAM PUBLICATIONS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14601
专题	应用数学研究所
通讯作者	Lin, GH
作者单位	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
推荐引用方式 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.