• Corpus ID: 59697017

Design, analysis, and implementation of parallel external sorting algorithms

@inproceedings{Friedland1981DesignAA,
  title={Design, analysis, and implementation of parallel external sorting algorithms},
  author={Dina Friedland},
  year={1981}
}
In recent years, parallel sorting has been an active field of research. However, parallel sorting algorithms developed up to date cannot be used to sort a large file, because they are internal sorting algorithms. Moreover, it is not possible to implement the fastest among these algorithms with current technology. This thesis investigates the topic of parallel external sorting. Several new algorithms are presented and analyzed, using a comprehensive cost model that includes computation… 
A taxonomy of parallel sorting
TLDR
This paper analyzes the evolution of research on parallel sorting, from the earliest sorting networks to the shared memory algorithms and the VLSI sorters, and proposes a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms.
Parallel External Sorting
Tuning a parallel database algorithm on a shared‐memory multiprocessor
TLDR
Volcano's parallel external sorting algorithm and a sequence of enhancements to improve its performance are presented, and very good absolute performance is obtained, 84 seconds for 100 MB of data, as well as near‐linear speedup with sixteen CPUs and disks.
An evaluation of sorting algorithms for common-bus local networks
TLDR
This paper evaluates four alternate methods of performing external sort in common-bus local networks by observing its behavior at different network speeds, file sizes, network sizes, page sizes, I/O times, and interrupt and synchronization times.
Communication conscious radix sort
TLDR
A reorganization of Radix sort is proposed that leads to a highly local version of the algorithm at a very low cost and achieves a good load balance which makes it insensitive to skewed data distributions.
Parallel algorithms for the execution of relational database operations
TLDR
This paper presents and analyzes algorithms for parallel processing of relational database operations in a general multiprocessor framework, and introduces an analysis methodology which incorporates I/O, CPU, and message costs and which can be adjusted to fit different multiproprocessor architectures.
Parallel External Sorting
TLDR
Apart from the design and implementation of efficient algorithms, the research community is still developed new techniques aiming at more efficient processing, one such technique is the exploitation of multiple resources to reduce the processing costs.
Alphasort: A cache-sensitive parallel external sort
TLDR
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads and argues that modern architectures require algorithm designers to re-examine their use of the memory hierarchy.
Sorting Large Files on a Backend Multiprocessor
TLDR
The results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three- and five-microprocessor configurations, provide a very cost-effective sort of large files.
Minimizing the input/output bottleneck
TLDR
This thesis gives the first known algorithms for sorting efficiently in single Uniform Memory Hierarchy, and shows how to achieved optimal I/O performance of VLSI implementations of lattice computations by transferring less information, and gives matching upper and lower bounds.
...
1
2
3
...