Parallel Sorting in a Ring Network of Processors

IEEE Transactions on Computers

Volumn 38, Issue 3, 1989, Pages 458-464

  Hong, Yang Chang ^a   Payne, Thomas H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Heapsort; parallel sorting; ring network; selection sorting; treesort

Indexed keywords

COMPUTER OPERATING SYSTEMS--PROGRAM PROCESSORS; COMPUTER PROGRAMMING--ALGORITHMS; DATA STORAGE, DIGITAL;

CARRY-LOOK-AHEAD TECHNIQUES; MEMORY ACCESSES; PARALLEL SORTING; RING NETWORK; SORTING ALGORITHMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0024629324     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.21133     Document Type: Article

References (5)

1. P.N. Armstrong, U.S. Patent 4 131 947, Dec. 26, 1978.
2. D. Bitton, D.J. Dewitt, D.K. Hsaio, and I. Menom, “A taxonomy of parallel sorting,” ACM Comput. Surveys, vol. 16, pp. 287–318, Sept. 1984.
3. D.E. Knuth, The Art of Computer Programming, Sorting and Searching, Vol. 3. Reading, MA: Addison-Wesley, 1973.
4. Y. Tanaka, Y. Nozaka, and A. Masuyama, “Pipeline searching and sorting modules as components of dataflow database computer,” in Proc. Int. Fed. Inform. Processing, Oct. 1980, pp. 427–432.
5. J.W.J. Williams, “Heapsort,” Commun. ACM, vol. 7, pp. 347–348, 1964.