An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
The congestion of n-cube layout on a rectangular grid
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
MPPOI '98 Proceedings of the The Fifth International Conference on Massively Parallel Processing Using Optical Interconnections
Routing and wavelength assignment for hypercube in array-based WDM optical networks
Journal of Parallel and Distributed Computing
Balanced Dimension-Order Routing for k-ary n-cubes
ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops
A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
IEEE Transactions on Computers
rHALB: a new load-balanced routing algorithm for k-ary n-cube networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Routing and wavelength assignment for 3-ary n-cube in array-based optical network
Information Processing Letters
Hi-index | 5.23 |
Multi-ary n-cubes are a class of communication patterns that are employed by a number of typical parallel algorithms. This paper addresses the implementation of parallel algorithms with bidirectional and unidirectional ternary n-cube communication patterns on a mesh WDM optical network. For each of these two communication patterns, a routing and wavelength assignment scheme is described, and the number of wavelengths required is shown to attain the minimum, which guarantees the optimality of the proposed scheme.