A taxonomy of parallel sorting
DeWitt, David J.
Hsiao, David K.
MetadataShow full item record
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 processors communicate through interconnection networks such as the perfect shuffle, the mesh and a number of other sparse networks. After describing the network sorting algorithms, we show that, with a shared memory model of parallel computation, faster algorithms have been derived from parallel enumeration sorting schemes, where keys are first ranked and then rearranged according to their rank.
Showing items related by title, author, creator and subject.
Smith, Douglas R. (Monterey, California. Naval Postgraduate School, 1982-11-12); NPS-52-82-011A new method is presented for the deductive synthesis of computer programs. The method takes as given a formal specification of a user's problem. The specification is allowed to be incomplete in that some or all of the ...
Isaac, Tobin; Burstedde, Carsten; Wilcox, Lucas C.; Ghattas, Omar (2014-11-18);The forest-of-octrees approach to parallel adaptive mesh re nement and coarsening (AMR) has recently been demonstrated in the context of a number of large-scale PDE-based applications. E cient reference software has been ...
Musselman, Roger D. (Monterey, California. Naval Postgraduate School, 2007-09);Algorithms are an essential part of Operations Research (OR) methodology. Therefore, the efficiency of the algorithms must be a consideration. However, traditional approaches to assessing algorithm efficiency do not ...