Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses

By Trahan J.L.   Bourgeois A.G.   Pan Y.   Vaidyanathan R.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 9, 2000-09 ,pp. : 1125-1136

Academic Press

Access to resources Recommend Favorite

A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network

By Rahman M.M. Hafizur   Horiguchi Susumu  

International Journal of High Performance Computing and Networking, Vol. 4, Iss. 3-4, 2006-08 ,pp. : 174-187

Inderscience Publishers

Access to resources Recommend Favorite

Some permutation routing algorithms for low-dimensional hypercubes

By Hwang F.K.   Yao Y.C.   Dasgupta B.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 111-124

Elsevier

Access to resources Recommend Favorite

Routing on networks of optical crossbars

By Heide F.M.a.d.   Schroder K.   Schwarze F.  

Theoretical Computer Science, Vol. 196, Iss. 1, 1998-04 ,pp. : 181-200

Elsevier

Access to resources Recommend Favorite

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths

By Gu Q.P.   Tamaki H.  

Journal of Parallel and Distributed Computing, Vol. 44, Iss. 2, 1997-08 ,pp. : 147-152

Academic Press

Access to resources Recommend Favorite