A taxonomy of parallel sorting

@article{Bitton1984ATO,
  title={A taxonomy of parallel sorting},
  author={Dina Bitton and David J. DeWitt and David K. Hsiao and Jai Menon},
  journal={ACM Comput. Surv.},
  year={1984},
  volume={16},
  pages={287-318}
}
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms. We analyze the evolution of research on parallel sorting, from the earliest sorting networks to the shared memory algorithms and the VLSI sorters. In the context of sorting networks, we describe two fundamental parallel merging schemes the odd-even and the bitonic merge. Sorting algorithms have been derived from these merging algorithms for parallel computers where… 
Performance Comparison of Parallel Sorting Algorithms on Homogeneous Cluster of Workstations
TLDR
Three parallel sorting algorithms have been implemented and compared in terms of their overall execution time and the time complexity for each parallel sorting algorithm will be mentioned and analyzed.
Sorting in parallel database systems
  • D. Taniar, J. Rahayu
  • Computer Science
    Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region
  • 2000
TLDR
The authors present a taxonomy for parallel sorting in parallel database systems, which covers five sorting methods: namely parallel merge-all sort, parallel binary-mergesort, parallel redistribution binary-Merge sort, Parallel redistribution merge- all sort, and parallel partitioned sort.
Parallel Sorting in a Ring Network of Processors
TLDR
An analysis is presented that shows how to improve performance by overlapping comparisons with memory accesses and how to achieve performance improvement by applying carry-look-ahead techniques to comparison.
Parallel database sorting
A Scalable Parallel Sorting Algorithm Using Exact Splitting
TLDR
This paper presents the first parallel sorting algorithm to combine all herein before mentioned properties, while laying the foundations to overcome scalability problems for sorting data on the next generation of massively parallel systems.
A load-balanced parallel sorting algorithm for shared-nothing architectures
TLDR
This paper presents a load-balanced parallel sorting algorithm for shared-nothing architectures, a multiple-input multiple-output algorithm with four stages, based on a generalization of Batcher's odd-even merge, which guarantees its performance, as long as n is greater thanp3, which is the case of interest for sorting large relations.
Optimizing parallel bitonic sort
TLDR
A bitonic sort algorithm which minimizes the number of communication steps and optimizes the local computation is developed, which is faster than previous implementations, as experimental results collected on a 64 node Meiko CS-2 show.
Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency
Optimal Parallel Merging and Sorting Without Memory Conflicts
TLDR
The proposed approach for merging leads to a parallel sorting algorithm that sorts a vector of length N in O(log2 k + N/k) log N) time, which is optimal, for k ¿ N/log2 N, in view of the ¿(N) and N log N lower bounds on merging and sorting, respectively.
A Novel Sorting Array Processor
  • S. Lam
  • Computer Science
    CONPAR
  • 1992
TLDR
A number of highly parallelizable sorting algorithms are realized by match the data flow with the interconnection topology, taking the modularity of these algorithms into account, and the array implementation of small sorting modules can be optimised, and nearly optimal sorters can be constructed for large data sequences by cascading severalsmall sorting modules together.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 57 REFERENCES
Design, analysis, and implementation of parallel external sorting algorithms
TLDR
A modified merge-sort is proposed to use as a method for eliminating duplicate records in a large file and a combinatorial model is developed to provide an accurate estimate for the cost of the duplicate elimination operation (both in the serial and the parallel cases).
New Parallel-Sorting Schemes
  • F. Preparata
  • Computer Science
    IEEE Transactions on Computers
  • 1978
TLDR
A family of parallel-sorting algorithms for a multiprocessor system that is enumeration sortings and includes the use of parallel merging to implement count acquisition, matching the performance of Hirschberg's algoithm, which, however, is not free of fetch conflicts.
Routing, merging and sorting on parallel models of computation
TLDR
It is shown that log log n - log log r is asymptotically optimal for rn processors to merge two sorted lists of n elements and is able to achieve such an efficient sort via Valiant's parallel merging algorithm.
The Parallel Enumeration Sorting Scheme for VLSI
TLDR
A new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting is designed, suitable for VLSI implementation.
Parallel Record-Sorting Methods for Hardware Realization.
TLDR
Three sorting methods are demonstrated for implementing a fast hardware sorter in DBC that utilizes multiple processors with large-capacity block-oriented access memories in a parallel fashion and employs block- oriented access memories (such as magnetic bubbles and charge-coupled devices).
The cube-connected-cycles: A versatile network for parallel computation
TLDR
This work describes in detail how to program the cube-connected-cycles for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms, and the CCC can also be used as a general purpose parallel processor.
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
An algorithm is presented to merge two subfiles of size n/2 each, stored in the left and the right halves of a linearly connected processor array, in 3n/2 route steps and log n compare-exchange
The universality of various types of SIMD machine interconnection networks
TLDR
This work analyzes Batcher's bitonic sorting method and gives O((log2N)2) algorithms, where N is the number of processing elements, for the Perfect Shuffle, PM21, WPM21, and Cube networks to simulate arbitrary interconnections.
Sorting networks and their applications
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several
Optimal Sorting Algorithms for Parallel Computers
TLDR
The problem of sorting a sequence of n elements on a parallel computer with k processors is considered and each achieves an asymptotic speed-up ratio of k with respect to the best sequential algorithm, which is optimal in the number of processors used.
...
1
2
3
4
5
...