A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
A study of the permutation capability of a binary hypercube under the commonly used dimension-order routing is presented. Two modes of the basic routing algorithm have been explored based on non-skipping or skipping identical bits in source and destination addresses when adjusting a route. All the study was done computationally. It has been found that the skip mode in comparison with the non-skip one provides better permutation capability, its beneficial effect on lowdimensional hypercubes,doi:10.1109/empdp.2003.1183584 dblp:conf/pdp/VeselovskyB03 fatcat:bnabpfqyirfb5hsn22blkjlknu