Adaptive Binary Sorting Schemes and Associated Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 5, Issue 6, 1994, Pages 561-572

  Oruç, A Yavuz ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b PRC Inc ^*  (United States)

Author keywords

Adaptive sorting; binary sorter; concentrator; permutation network; sorting network

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; ASSOCIATIVE PROCESSING; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; CRITICAL PATH ANALYSIS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS;

ADAPTIVE BINARY SORTING SCHEMES; ASSOCIATED INTERCONNECTION NETWORKS; CONCENTRATORS; PERMUTATION NETWORKS; SORTING NETWORKS;

SORTING;

EID: 0028452672     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.285603     Document Type: Article

References (26)

1. M. Ajtai, J. Komlos, and E. Szemeredi, “Sorting in c log n parallel steps,” Combinatorica, vol. 3, pp. 1–19, Jan. 1983.
2. N. Alon, “Eigenvalues and expanders,” Combinatorica, vol. 6, pp. 83–96, 1986.
3. K. E. Batcher, “Sorting networks and their applications,” in Proc. AFIPS Spring Joint Conference, 1968, pp. 307–314.
4. V. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
6. T. H. Cormen, “Concentrator switches for routing messages in parallel computers,” M.S. thesis, Massachusetts Inst. of Technol., 1986.
7. B. Douglass and A. Yavuz Oruç, “Self-routing and route balancing in connection networks,” Tech. Rep. UMIACS-TR-90-32, CS-TR-2421, Inst. for Advanced Comput. Studies, Univ. of Maryland, College Park, MD, 1990.
8. M. Dowd, Y. Perl, L. Rudolph, and M. Saks, “The balanced sorting network,” in Proc. 2nd Ann. ACM Symp. Principles of Distrib. Computing, 1983, pp. 161–172.
9. M. Dowd, Y. Perl, L. Rudolph, and M. Saks, “The periodic balanced sorting network,” J. ACM, vol. 36, pp. 738–757, Oct. 1989.
10. O. Gabber and Z. Galil, “Explicit constructions of linear sized superconcentrators,” J. Comput. Syst. Sci., vol. 22, pp. 407–420, 1981.
11. C. Y. Jan and A. Yavuz Oruç, “Fast self-routing permutation switching on an asympotically minimum cost network,” Tech. Rep. UMIACS-TR-91-127, CS-TR-2753, Inst. for Advanced Comput. Studies, Univ. of Maryland, College Park, MD, 1991.
12. D. E. Knuth, The Art of Computer Programming: Sorting and Searching, Vol. 3. Reading, MA: Addison-Wesley, 1973.
13. D. Koppelman and A. Yavuz Oruç, “A self-routing permutation network,” J. Parallel Distrib. Computing, vol. 6, pp. 140–151, Aug. 1990.
14. T. Leighton, “Tight bounds on the complexity of parallel sorting,” IEEE Trans. Comput., vol. C-34, no. 4, pp. 344-354, Apr. 1985.
15. M. Lu and A. Yavuz Oruç, “Efficient networks for realizing point-to-point assignments in parallel processors,” Tech. Rep. UMIACS-TR 92-63, CS-TR-2910, Inst. for Advanced Comput. Studies, Univ. of Maryland, College Park, MD, 1992.
16. G.A. Margulis, “Explicit constructions of concentrators,” Problems Inform. Transmission, vol. 9, no. 4, pp. 325–332, 1973.
17. Muller and Preparata, “Bounds to complexities of networks for sorting and switching.” J. ACM, vol. 22, pp. 195–201, Jan. 1975.
18. D. Nassimi and S. Sahni, “Parallel algorithms to set up the Benes network,” IEEE Trans. Comput., vol. C-31, pp. 148–154, Feb. 1982.
19. I. Parberry, “Current progress on efficient sorting networks,” Tech. Rep. CS-89-30, Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, 1989.
20. M. S. Paterson, “Improved sorting networks with O(lg n) depth,” Algorithmica, vol. 5, 75–92, 1990.
21. M. S. Pinsker, “On the complexity of a concentrator,” in Proc. 7th Int. Teletraffic Congress, 1973, pp. 318/1-318/4.
22. N. Pippenger, “Superconcentrators,” SIAM J. Computing, vol. 6, pp. 298–304, 1977.
23. D. Richards, “Parallel sorting: A bibliography,” ACM SIGACT News, vol. 18, pp. 28–48, Summer 1986.
24. L. Rudolph, “A robust sorting network,” IEEE Trans. Comput., vol. C-34, no. 4, pp. 326–335, Apr. 1985.
25. D. C. Van Voorhis, “An economical construction for sorting networks,” in Proc. AFIPS Nat. Comput. Conf, vol. 43, pp. 921–926, 1974.
26. I. Wegener, The Complexity of Boolean Functions. Chichester, UK: Wiley, 1987.