Work-efficient routing algorithms for rearrangeable symmetrical networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 7, 1999, Pages 733-741

  Çam, Hasan ^b   Fortes, José A B ^a,c  

^a IEEE   (United States)

^b KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENES NETWORK; PARALLEL ROUTING ALGORITHMS; PERMUTATIONS; REARRANGEABLE SYMMETRICAL NETWORKS;

INTERCONNECTION NETWORKS; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE; SWITCHING NETWORKS; TELECOMMUNICATION TRAFFIC;

PARALLEL ALGORITHMS;

EID: 0033360261     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.780867     Document Type: Article

References (14)

1. N. Linial and M. Tarsi, "Interpolation between Bases and the Shuffle-Exchange Network," Europian J. Combinatorics, vol. 10, pp. 29-39, 1989.
2. A. Waksman, "A Permutation Network," J. ACM, vol. 15, no. 1, pp. 159-163, Jan. 1968.
3. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic Press, 1965.
4. C.P. Kruskal and M. Snir, "A Unified Theory of Interconnection Network Structure," Theoretical Computer Science, vol. 48, pp. 75-94, 1986.
5. K.Y. Lee, "On the Rearrangeability of 2(logN) - 1 Stage Permutation Networks," IEEE Trans. Computers, vol. 34, no. 5, pp. 412-425, May 1985.
6. C. Wu and T. Feng, "On a Class of Multistage Interconnection Networks," IEEE Trans. Computers, vol. 29, pp. 696-702, 1980.
7. K.Y. Lee, "A New Benes Network Control Algorithm," IEEE Trans. Computers, vol. 36, no. 6, pp. 768-772, June 1987.
8. D. Nassimi and S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms," IEEE Trans. Computers, vol. 30, no. 5, pp. 332-340, May 1981.
9. D. Nassimi and S. Sahni, "Parallel Algorithms to Set up the Benes Permutation Network," IEEE Trans. Computers, vol. 31, no. 2, pp. 148-154, Feb. 1982.
10. D.C. Opferman and N.T. Tsao-Wu, "On a Class of Rearrangeable Switching Networks, Part I: Control Algorithm," Bell System Technical J., vol. 50, pp. 1,579-1,600, 1971.
11. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, chapter 30. MIT Press, 1991.
12. T.Y. Feng and S.W. Seo, "A New Routing Algorithm for a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 43, no. 11, pp. 1,270-1,280, Nov. 1994.
13. H. Çam, "Design and Permutation Routing Algorithms of Rearrangeable Networks," PhD thesis, Purdue Univ., May 1992.
14. H. Çam and J.A.B. Fortes, "Frames: A Simple Characterization of Permutations Realized by Frequently Used Networks," IEEE Trans. Computers, vol. 44, no. 5, pp. 695-697, May 1995.