Book ChapterDOI
Parallel Sorting Algorithms
Reads0
Chats0
TLDR
The chapter presents a unified treatment of various parallel sorting algorithms by bringing out clearly the relation between the architecture of parallel computers and the structure of algorithms.Abstract:
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms. Parallel algorithms for sorting are of a recent origin and came into existence over the past decade. The chapter presents a unified treatment of various parallel sorting algorithms by bringing out clearly the relation between the architecture of parallel computers and the structure of algorithms. In the design of parallel algorithms in general, and of parallel sorting algorithms in particular, two models have been widely used: (1) models based on fixed interconnection networks such as the same or single instruction on multiple data (SIMD) machine mesh-connected network and (2) models based on a global memory, which is shared by various processors. The special-purpose network-sorting algorithms are described. Algorithms for SIMD machines are given.read more
Citations
More filters
Proceedings ArticleDOI
Designing efficient sorting algorithms for manycore GPUs
TL;DR: The design of high-performance parallel radix sort and merge sort routines for manycore GPUs, taking advantage of the full programmability offered by CUDA, are described, which are the fastest GPU sort and the fastest comparison-based sort reported in the literature.
DissertationDOI
Efficient Algorithms for Sorting and Synchronization
TL;DR: This thesis presents efficient algorithms for internal and external parallel sorting and remote data update and examines a number of related algorithms for text compression, differencing and incremental backup.
Proceedings ArticleDOI
A comparison of sorting algorithms for the connection machine CM-2
Guy E. Blelloch,Charles E. Leiserson,Bruce M. Maggs,C. Greg Plaxton,Stephen J. Smith,Marco Zagha +5 more
TL;DR: A fast sorting algorithm for the Connection Machine Supercomputer model CM-2 is developed and it is shown that any U(lg n)-depth family of sorting networks can be used to sort n numbers in U( lg n) time in the bounded-degree fixed interconnection network domain.
Journal ArticleDOI
A survey of adaptive sorting algorithms
TL;DR: This survey presents the basic notions and concepts of adaptive sorting, the demonstration that several algorithms currently in use are adaptive, and the development of new algorithms, similar to currently used algorithms that perform competitively on random sequences and are significantly faster on nearly sorted sequences.
Journal ArticleDOI
Parallel sorting by regular sampling
Hanmao Shi,Jonathan Schaeffer +1 more
TL;DR: The algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer from, by using a regular sampling of the data to ensure good pivot selection and is shown to be asymptotically optimal.
References
More filters
Proceedings ArticleDOI
Sorting networks and their applications
TL;DR: 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 computing operations are done concurrently.
Journal ArticleDOI
Some Computer Organizations and Their Effectiveness
TL;DR: A hierarchical model of computer organizations is developed, based on a tree model using request/service type resources as nodes, which indicates that saturation develops when the fraction of task time spent locked out approaches 1/n, where n is the number of processors.
Journal ArticleDOI
Parallel Processing with the Perfect Shuffle
TL;DR: Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Journal ArticleDOI
The cube-connected cycles: a versatile network for parallel computation
TL;DR: This work describes in detail how to program the cube-connected cycles for efficiently solving a large class of problems that include Fast Fourier transform, sorting, permutations, and derived algorithms.
Proceedings ArticleDOI
Parallelism in random access machines
Steven Fortune,James C. Wyllie +1 more
TL;DR: A model of computation based on random access machines operating in parallel and sharing a common memory is presented and can accept in polynomial time exactly the sets accepted by nondeterministic exponential time bounded Turing machines.