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
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
The Analysis and Design of Some New Sorting Machines
IEEE Transactions on Computers
The VLSI Complexity of Sorting
IEEE Transactions on Computers
A database machine based on the data distribution approach
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
| Hi-index | 0.01 |
A unified approach for analyzing and classifying parallel sorting machines is discussed. The approach accounts for a number of important factors that have significant impacts on the measure of the size and complexities of parallel sorters. These factors include the sorter architectures, sequential/parallel input, single/multiple passes, and the base of the comparitors. An efficiency measure is also introduced to describe the optimality and other general characteristics of the sorters. Finally, a new sorter with the time complexity of O(c*logbN), where b is an arbitrary base, is proposed. Its efficiency is independent of the number of processors, the size of the list, and the maximum value in the list.