Optimal parallel routing in star networks Academic Article

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. 1997 IEEE.

authors

• Chen, Jianer

published proceedings

• IEEE TRANSACTIONS ON COMPUTERS

author list (cited authors)

• Chen, C. C., & Chen, J.

citation count

• 28

complete list of authors

• Chen, CC||Chen, J

publication date

• January 1997

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Computers  Journal

keywords

• Graph Container
• Network Routing
• Parallel Routing
• Partition Matching
• Shortest Path
• Star Network

Digital Object Identifier (DOI)

• 10.1109/12.641930

start page

• 1293

end page

• 1303

volume

• 46

issue

• 12

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2F12.641930