The Analysis and Design of Some New Sorting Machines
- 1 July 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (7) , 677-683
- https://doi.org/10.1109/tc.1983.1676299
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Parallel sorting machinesPublished by Association for Computing Machinery (ACM) ,1981
- A Design of a Fast Cellular Associative Memory for Ordered RetrievalIEEE Transactions on Computers, 1978
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- Samplesort: A Sampling Approach to Minimal Storage Tree SortingJournal of the ACM, 1970