This Article 
 Bibliographic References 
 Add to: 
Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags
February 1988 (vol. 37 no. 2)
pp. 251-256
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

[1] V. Benes,Mathematical Theory of Connecting Networks. New York: Academic, 1965.
[2] L. Cannon, "A cellular computer to implement the Kalman filter algorithm," Ph.D. dissertation, Montana State Univ., Bozeman, 1969.
[3] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms," inProc 17th Annu. Allerton Conf. Commun., Contr., Comput., Oct. 1979, pp. 27-36.
[4] P. M. Flanders, "A unified approach to a class of data movements on an array processor,"IEEE Trans. Comput., vol. C-31, pp. 809-819, Sept. 1982.
[5] I. N. Herstein,Topics in Algebra. Lexington MA: Xerox College, 1964.
[6] T. Huang, "On shuffle-exchange type interconnection networks for multiprocessor systems," Ph.D. dissertation, Univ. Maryland, 1985.
[7] S.-T. Huang and S. K. Tripathi, "Finite state model and compatibility theory: New analysis tools for permutation networks,"IEEE Trans. Comput., vol. C-35, no. 7, pp. 591-601, July 1986.
[8] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[9] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used for permutations,"IEEE Trans. Comput., vol. C-27, pp. 637-647, July 1978.
[10] J. Lenfant and S. Tahe, "Permuting data with the omega network,"Acta Informatica, vol. 21, pp. 629-641, 1985.
[11] D. Nassimi and S. Sahni, "An optimal routing algorithm for meshconnected parallel computer,"J. ACM, vol. 27, pp. 6-29, Jan. 1980.
[12] D. Nassimi and S. Sahni, "A self-routing Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C-30, pp. 332- 340, May 1981.
[13] M. C. Pease, "The indirect binaryn-cub microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[14] H. J. Siegel, "The theory underlying the partitioning of permutation networks,"IEEE Trans. Comput., vol. C-29, pp. 791-801, Sept. 1980.
[15] D. Steinberg, "Invariant properties of the shuffle-exchange and a simplified cost-effective version of the omega network,"IEEE Trans. Comput., vol. C-32, pp. 444-450, May 1983.
[16] H. S. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C-20, pp. 153-161, Feb. 1971.
[17] C. Wu and T. Feng, "Universality of the shuffle-exchange network,"IEEE Trans. Comput., vol. C-30, pp. 324-331, May 1981.
[18] P. C. Yew and D. H. Lawrie, "An easily controlled network for frequently used permutations,"IEEE Trans. Comput., vol. C-30, pp. 296-298, Apr. 1981.

Index Terms:
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. 2, pp. 251-256, Feb. 1988, doi:10.1109/12.2159
Usage of this product signifies your acceptance of the Terms of Use.