Issue No. 12 - December (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.641930
<p><b>Abstract</b>—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.</p>
Network routing, star network, parallel routing, partition matching, graph container, shortest path.
Jianer Chen, Chi-Chang Chen, "Optimal Parallel Routing in Star Networks", IEEE Transactions on Computers, vol. 46, no. , pp. 1293-1303, December 1997, doi:10.1109/12.641930