The Community for Technology Leaders
Green Image
The self-routing technique using control tags on multiple-pass perfect-shuffle networks is generalized. In particular, they show that bit-permute-complement permutations can be realized and unscrambled in (2n-1) passes or less, where n=log/sub 2/N, N being the number of terminals on either side. They also show that most of the frequently used permutations are in the intersection of omega-realiz
unscrambling; set intersections; computational complexity; permutation networks; multiprocessor interconnection networks; control tags; self-routing technique; multiple-pass perfect-shuffle networks; bit-permute-complement permutations; inverse-omega-realizing sets; computational complexity; multiprocessor interconnection networks; set theory.
S.-T. Huang, S.K. Tripathi, "Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags", IEEE Transactions on Computers, vol. 37, no. , pp. 251-256, February 1988, doi:10.1109/12.2159
99 ms
(Ver 3.3 (11022016))