DocumentCode
2203938
Title
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation
Author
Li, Yamin ; Peng, Shietung ; Chu, Wanming
Author_Institution
Dept. of Comput. Sci., Hosei Univ., Tokyo, Japan
fYear
2010
fDate
June 29 2010-July 1 2010
Firstpage
147
Lastpage
154
Abstract
In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN can be used as a candidate for the interconnection of supercomputers of the next generation. The RDN is generated by recursively applying dual-construction on a base network. Given a regular and symmetric graph of size n and node-degree d, the dual-construction generates a regular and symmetric graph of size 2n2 and node-degree d+1. The RDN has many interesting properties including small node-degree and short diameter. Our results show that collective communication can be done efficiently in RDN.
Keywords
multiprocessor interconnection networks; network theory (graphs); parallel processing; RDN; collective communication; high-performance parallel computer system; interconnection network; recursive dual-net; routing algorithm; symmetric graph; Broadcasting; Clustering algorithms; Complexity theory; Computers; Multiprocessor interconnection; Routing; Switches; Interconnection networks; collective communication; routing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location
Bradford
Print_ISBN
978-1-4244-7547-6
Type
conf
DOI
10.1109/CIT.2010.64
Filename
5578447
Link To Document