Proceedings ArticleDOI
Deterministic sorting and randomized median finding on the BSP model
Alexandros V. Gerbessiotis,Constantinos J. Siniolakis +1 more
- pp 223-232
TLDR
This work sort n general keys by using a partitioning scheme that achieves the requirements of efficiency and insensitivity against data skew and gives a precise worst-case estimation of the maximum imbalance which might occur.Abstract:
We present new BSP algorithms for deterministic sorting and rmdomized median finding. We sort n general keys by using a partitioning scheme that achieves the requirements of efficiency (one-optimality) and insensitivity against data skew (the accuracy of the splitting keys depends solely on the step distance, which can be adapted to meet the worstcase requirements of our application). Although we employ sampling in order to realize efficiency, we can give a precise worst-case estimation of the maximum imbalance which might occur. We also investigate optimal randomized BSP algorithms for the problem of finding the median of n elements that require, with high-probability, 3rz/(2p) + o(n/p) number of comparisons, for a wide range of values of n and p. Experimental results for the two algorithms are also presentedread more
Citations
More filters
Proceedings ArticleDOI
Fundamental parallel algorithms for private-cache chip multiprocessors
TL;DR: This paper presents two sorting algorithms, a distribution sort and a mergesort, and studies sorting lower bounds in a computational model, which is called the parallel external-memory (PEM) model, that formalizes the essential properties of the algorithms for private-cache CMPs.
Journal ArticleDOI
A Randomized Parallel Sorting Algorithm with an Experimental Study
TL;DR: A novel variation on sample sort which uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead, and its performance is invariant over the set of input distributions unlike previous efficient algorithms.
Journal ArticleDOI
Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
TL;DR: The Nondeterminator is an asymptotically efficient serial algorithm for detecting determinacy races in series-parallel directed acyclic graphs and exhibits a slowdown of less than 12 compared with the serial execution time of the original optimized code, which the authors contend is an acceptable slowdown for debugging purposes.
Proceedings ArticleDOI
Load balanced parallel radix sort
Andrew Sohn,Yuetsu Kodama +1 more
TL;DR: Experimental results indicate that balanced radix sort can sort OSG integers in 20 seconds and 128M doubles in 15 seconds on a 64-processor SPZWN while yielding over 40-fold speedup.
Journal ArticleDOI
Portable and efficient parallel computing using the BSP model
TL;DR: The design and implementation of the Green BSP Library, a small library of functions that implement the BSP model, and of several applications that were written for this library are described and the performance of the library and application programs on several parallel architectures are discussed.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
A bridging model for parallel computation
TL;DR: The bulk-synchronous parallel (BSP) model is introduced as a candidate for this role, and results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.
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.