kd-Clos: New no-blocking permutation network

	kd-Clos: New no-blocking permutation network
	Ming, M; Li, D; Fu, B
	2003
发表期刊	ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS
ISSN	0302-9743
卷号	2834 页码:152-156
摘要	In this paper a new no-blocking network named kd-Clos (k-dimension Clos network) is proposed. For different size of the network, we can select different k, the hardware cost is much lower than Clos networks. The routing algorithm for permutation on kd-Clos network is also proposed and the time complexity of the algorithm is O(log(3)N) which is same as previous works on Clos network.
收录类别	SCI
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Hardware & Architecture ; Computer Science, Software Engineering ; Computer Science, Theory & Methods
WOS记录号	WOS:000187420700018
出版者	SPRINGER-VERLAG BERLIN
引用统计
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/13617
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Ming, M
作者单位	Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Ming, M,Li, D,Fu, B. kd-Clos: New no-blocking permutation network[J]. ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS,2003,2834:152-156.
APA	Ming, M,Li, D,&Fu, B.(2003).kd-Clos: New no-blocking permutation network.ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS,2834,152-156.
MLA	Ming, M,et al."kd-Clos: New no-blocking permutation network".ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS 2834(2003):152-156.