DocumentCode
1403292
Title
Optimal parallel routing in star networks
Author
Chen, Chi-Chang ; Chen, Jianer
Author_Institution
Dept. of Comput. Sci., Tatung Inst. of Technol., Taipei, Taiwan
Volume
46
Issue
12
fYear
1997
fDate
12/1/1997 12:00:00 AM
Firstpage
1293
Lastpage
1303
Abstract
Star networks have recently been proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star networks. Our result improves previous results for the problem
Keywords
multiprocessor interconnection networks; network routing; parallel architectures; graph container; interconnecting processors; optimal parallel routing; parallel computer; parallel routing; partition matching; shortest path; star networks; Computer networks; Concurrent computing; Containers; Fault tolerance; Hypercubes; Intelligent networks; Multiprocessor interconnection networks; Partitioning algorithms; Routing; Tin;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.641930
Filename
641930
Link To Document