Hypercubic sorting networks

SIAM Journal on Computing

Volumn 27, Issue 1, 1998, Pages 1-47

  Leighton, Tom ^a   Plaxton, C Greg ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Hypercubic machines; Parallel sorting; Sorting networks

Indexed keywords

EID: 0006636650     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794268406     Document Type: Article

References (20)

1. W. AIELLO, F. T. LEIGHTON, B. MAGGS, AND M. NEWMAN, Fast algorithms for bit-serial routing on a hypercube, Math. Systems Theory, 24 (1991), pp. 253-271.
2. M. AJTAI, J. KOMLÓS, AND E. SZEMERÉDI, Sorting in clog n parallel steps, Combinatorica, 3 (1983), pp. 1-19.
3. M. AJTAI, J. KOMLÓS, AND E. SZEMERÉDI, Halvers and expanders, in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 686-692.
4. K. E. BATCHER, Sorting networks and their applications, in Proceedings of the AFIPS Spring Joint Computer Conference, 32 (1968), pp. 307-314.
5. V. E. BENEŠ, Optimal rearrangeable multistage connecting networks, Bell System Technical Journal, 43 (1964), pp. 1641-1656.
6. H. CHERNOFF, A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
7. R. E. CYPHER, Theoretical aspects of VLSI pin limitations, SIAM J. Comput., 22 (1993), pp. 58-63.
8. R. E. CYPHER AND C. G. PLAXTON, Techniques for Shared Key Sorting, Tech. Report RJ 7347, Computer Science Department, IBM Almaden Research Center, San Jose, CA, 1990.
9. R. E. CYPHER AND C. G. PLAXTON, Deterministic sorting in nearly logarithmic time on the hypercube and related computers, J. Comput. Systems Sci., 47 (1993), pp. 501-548.
10. W. HOEFFDING, On the distribution of the number of successes in independent trials, Ann. Math. Statist., 27 (1956), pp. 713-721.
11. D. E. KNUTH, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973.
12. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, Morgan-Kaufmann, San Mateo, CA, 1991.
13. F. T. LEIGHTON, B. M. MAGGS, A. G. RANADE, AND S. B. RAO, Randomized routing and sorting on fixed-connection networks, J. Algorithms, 17 (1994), pp. 157-205.
14. F. T. LEIGHTON AND C. G. PLAXTON, A (fairly) simple circuit that (usually) sorts, in Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 264-274.
15. M. S. PATERSON, Improved sorting networks with O(log N) depth, Algorithmica, 5 (1990), pp. 75-92.
16. C. G. PLAXTON, A hypercubic sorting network with nearly logarithmic depth, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 405-416.
17. C. G. PLAXTON AND T. SUEL, A lower bound for sorting networks based on the shuffle permutation, Math. Systems Theory, 27 (1994), pp. 491-508.
18. A. G. RANADE, How to emulate shared memory, J. Comput. Systems Sci., 42 (1991), pp. 307-326.
19. J. H. REIF AND L. G. VALIANT, A logarithmic time sort for linear size networks, J. Assoc. Comput. Mach., 34 (1987), pp. 60-76.
20. L. G. VALIANT AND G. J. BREBNER, Universal schemes for parallel communication, in Proceedings of the 13th Annual ACM Symposium on Theory of Computing, ACM, New York, 1981, pp. 263-277.