A Fast Parallel Algorithm for Routing in Permutation Networks

IEEE Transactions on Computers

Volumn C-30, Issue 2, 1981, Pages 93-100

  Lev, Gavriela Freund ^a   Valiant, Leslie G ^a   Pippenger, Nicholas ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PERMUTATION NETWORKS;

COMPUTER PROGRAMMING;

EID: 0019531866     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1981.6312171     Document Type: Article

References (22)

1. S. Andresen, 'The looping algorithm extended to base 2t rearrangeable switching networks,” IEEE Trans. Commun., vol. COM-25, pp. 1057-1063, 1977.
2. S. Andresen and S. R. Harrison, “Toward a general class of time-division-multiplexed connecting networks,” IEEE Trans. Commun., vol. COM-20, pp. 836-846, 1972.
3. D. Angluin and L. G. Valiant, “Fast probabilistic algorithms for Hamiltonian circuits and matchings,” J. Comput. Syst. Sci., vol. 18, pp. 155-193, 1979.
4. K. E. Batcher, “Sorting networks and their applications,” in AFIPS Spring Joint Comput. Conf., vol. 32, 1968, pp. 307-314.
5. V. E. Benes, “On rearrangeable three-stage connecting networks,” Bell Syst. Tech. J., vol. 41, pp. 1481-1492, 1962.
6. V. E. Benes, “Optimal rearrangeable multistage connecting networks,” Bell Syst. Tech. J., vol. 43, pp. 1641-1656, 1964.
7. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
8. A. Borodin, “On relating time and space to size and depth,” SIAM J. Comput., vol. 6, pp. 733-744, 1977.
9. H. N. Gabow, “Using Euler partitions to edge color bipartite multigraphs,” Int. J. Comput. Inform. Sci., vol. 5, pp. 345-355, 1976.
10. H. N. Gabow and O. Kariv, “Algorithms for edge coloring bipartite graphs and multigraphs,” to be published.
11. D. S. Hirschberg, “Fast parallel sorting algorithms,” Commun. Ass. Comput. Mach., vol. 21, pp. 657-661, 1978.
12. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, “Computing connected components on parallel computers,” Commun. Ass. Comput. Mach., vol. 22, pp. 461-464, 1979.
13. G. Lev, Ph.D. dissertation, Comput. Sci. Dep., Univ. of Edinburgh, Edinburgh, Scotland, to be published.
14. M. J. Marcus, “Space-time equivalents in connecting networks,” in IEEE Int. Conf. Commun., 1970, vol. 35, pp. 25-31.
15. D. S. Parker, “Studies in conjugation: Huffman tree construction, nonlinear recurrences, and permutation networks,” Ph.D. dissertation, Dep. Comput. Sci., Univ. of Illinois, Urbana, 1978.
16. N. Pippenger, “On rearrangeable and non-blocking switching networks,” J. Comput. Syst. Sci., vol. 17, pp. 145-162, 1978.
17. N. Pippenger, “On simultaneous resource bounds,” in IEEE Symp. Found. Comput. Sci., 1979, vol. 20, pp. 307-311.
18. F. P. Preparata, “New parallel-sorting schemes,” IEEE Trans. Comput., vol. C-27, pp. 669-673, 1978.
19. F. P. Preparata and J. Vuillemin, “The cube-connected-cycles: A versatile network for parallel computation,” in IEEE Symp. Found. Comput. Sci., vol. 20, 1979, pp. 140-147.
20. E. Reghbati (Arjomandi) and D. G. Corneil, “Parallel computations in graph theory,” SIAM J. Comput., vol. 7, pp. 230-237, 1978.
21. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, pp. 153-161, 1971.
22. A. Waksman, “A permutation network,” J. Ass. Comput. Mach., vol. 15, pp. 159-163, 1968.