This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Analysis and Design of Some New Sorting Machines
July 1983 (vol. 32 no. 7)
pp. 677-683
L.E. Winslow, Department of Computer Science, University of Dayton
A classification method for parallel sorting architectures is presented for comparison of existing designs. Some common drawbacks of these parallel sorters are noted: in general, they are limited by their data accessing mechanism, their hardware utilization is low, and their sorting speed is in some sense independent of the number of sorting elements used in the architecture. In this paper we present a detailed design and analysis of distributor based sorters (parallel balanced tree sorters) which can sort lists whose size is proportional to the memory space available and whose speed is proportional to the number of sorting elements used.
Index Terms:
performance analysis algorithm, Computer architectures, distributed system, parallel sorting
Citation:
L.E. Winslow, null Yuan-Chieh Chow, "The Analysis and Design of Some New Sorting Machines," IEEE Transactions on Computers, vol. 32, no. 7, pp. 677-683, July 1983, doi:10.1109/TC.1983.1676299
Usage of this product signifies your acceptance of the Terms of Use.