Minimizing communication of a recirculating bitonic sorting network

Proceedings of the International Conference on Parallel Processing

Volumn 1, Issue , 1996, Pages 251-254

  Lee, Jae Dong ^a   Batcher, K E ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BITONIC SORTING; EVEN PARITY; LOCAL MEMORY; NETWORK COMMUNICATIONS; TIME COMPLEXITY;

COMPLEX NETWORKS;

EID: 33749946841     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1996.537166     Document Type: Conference Paper

References (7)

1. Akl, Selim G, Paral1l Sorting Algorithms, cademic Press. Eric. 1985.
2. Batcher, K.E., "Sorting networks arid their applications" Spring Joint Computer Conference AFIPS Proc., 1968, Vol. 32, pp 307-314; (also http://nimitz.mcs.kent.edu/-batcher/sort.ps).
3. Knuth, D., The Art of Computer Programming: Sorting and Searching, Vol 3, Addison-Wesley, 1973.
4. Kumar, V., Grama, A., Gupta, A and Karypis, G., Inirodnciion to Parallel Computing . design and analysis of parallel algorithms, The Benj amin/Cummings Publishing Company, Inc., 1994.
5. Lawrie, D., "Access and alignment of data in an array processor", IEEE Transactions on Computers, Vol. C-24, No. 12, pp 1145-1155, Dec. 1975.
6. Lee, Jae-dong, "Minimizing Communication in the Bitonic Sort" Docloral Disserlutron, Dept. of Mathematics and Computer Science, Kent State University, May 1996.
7. Stone, H.S., "Parallel processing with the perfect shuffle, " IEEE Transactions on Computers., Vol C-20, pp 153-161, Feb. 1971.