The Analysis and Design of Some New Sorting Machines

Authors:
L. E. Winslow; Yuan-Chieh Chow
Affiliations:
Department of Computer Science, University of Dayton;-
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 6
Cited 0

Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Bounds to Complexities of Networks for Sorting and for Switching

Journal of the ACM (JACM)
The rebound sorter: an efficient sort engine for large files

VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
A Design of a Fast Cellular Associative Memory for Ordered Retrieval

IEEE Transactions on Computers
Sorting networks and their applications

AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Parallel sorting machines: their speed and efficiency

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference

Quantified Score

Hi-index	14.98

Visualization

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.