Efficient general in-place parallel sorting scheme

Journal of Supercomputing

Volumn 14, Issue 1, 1999, Pages 5-17

  Zheng, S Q ^a   Calidas, Balaji ^b   Zhang, Yanjun ^c  

^a The University of Texas at Dallas   (United States)

^b LOUISIANA STATE UNIVERSITY   (United States)

^c Southern Methodist University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PERFORMANCE;

PARALLEL ARCHITECTURE; PARALLEL SORTING SCHEME; SCALABILITY; SUPERCOMPUTING;

SORTING;

EID: 0032593427     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008173729055     Document Type: Article

References (17)

1. H. R. Arabnia and S. M. Bhandarkar, Parallel Stereocorrelation on a Reconfigurable Multi-Ring Network, The Journal of Supercomputing, 10, pp. 243-269, 1996.
2. M. D. Atkinson, J. R. Sack, N. Santoro, and T. Strothotte, Min-max Heaps and Generalized Priority-Queues, Communications of ACM, 29, pp. 996-1000, 1986.
3. G. E. Blelloch, C. E. Leiserson, B. M. Maggs, C. G. Plaxton, S. J. Smith, and M. Zagha, A Comparison of Sorting Algorithms for the Connection Machine CM-2, to appear in Communication of ACM.
4. G. M. Amdahl, Validity of Single-Processor Approach to Achieving Large-Scale Computing Capability, Proc. AFIPS Conference, pp. 483-485, 1967.
5. X. Guan and M. A. Langston, Time-Space Optimal Parallel Sorting and Merging, IEEE Transactions on Computers, 40, pp. 596-602, 1991.
6. J. Gustafson, Reevaluating Amdahl's Law, Communication of ACM, 31, pp. 532-533, 1988.
7. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-Hill, 1993.
8. J. Jang and V. K. Prasanna, An Optimal Sorting Algorithm on Reconfigurable Mesh, Proc. 6th Int. Parallel Processing Symposium, pp. 130-137, 1992.
9. D. E. Knuth, The Art of Computer Programming, Vol. 3, Addison Wesley, 1973.
10. H. Li and M. Maresca, Polymorphic-Torus Network, IEEE Transactions on Computers, 38, pp. 1345-1351, 1989.
11. R. Lin, S. Olariu, J. Schwing, and J. Zhang, Sorting in O(1) Time on a Reconfigurable Mesh of Size n × n, Parallel Computing: From Theory to Sound Practice, Proceedings of EWPC'92, pp. 16-27, 1992.
12. R. Miller, V. K. Prasanna-Kumar, D. Reisis, and Q. F. Stout, Meshes with Reconfigurable Buses, Proceedings of the International Conference on Parallel Processing, Vol. 1, pp. 205-208, 1988.
13. M. Nigam and Sahni, Sorting n Numbers on n × n Mesh with Buses, Technical Report #92-5, University of Florida, Gainsville, 1992.
14. S. Olariu and J. Schwing, A New Deterministic Sampling Scheme with Applications to Broadcast Efficient Sorting on the Reconfigurable Mesh, Journal of Parallel and Distributed Computing, to appear.
15. S. Olariu, J. Schwing, and J. Zhang, Applications of Reconfigurable Meshes to Constant-Time Computations, Parallel Computing, 19, pp. 229-237, 1993.
16. X. H. Sun and L. M. Ni, Scalable Problems and Memory-Bounded Speedup, Journal of Parallel and Distributed Computing, 19, pp. 27-37, 1993.
17. Y. Zhang and S. Q. Zheng, Design and Analysis of a Systolic Sorting Architecture, Proceedings of 7th Symposium on Parallel and Distributed Processing, pp. 652-659, 1995.