A Randomized Sorting Algorithm on the BSP model

Authors:
Alexandros V. Gerbessiotis;Constantinos J. Siniolakis
Affiliations:
-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 16
Cited 0

A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
Parallel merge sort

SIAM Journal on Computing
Optimal and sublogarithmic time randomized parallel sorting algorithms

SIAM Journal on Computing
Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry

Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
A bridging model for parallel computation

Communications of the ACM
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
Direct bulk-synchronous parallel algorithms

Journal of Parallel and Distributed Computing
Parallel sorting with limited bandwidth

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting and randomized median finding on the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network

Journal of the ACM (JACM)
Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new randomized sorting algorithm on the Bulk-Synchronous Parallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimality. Tighter probabilistic bounds are also established. It uses sample sorting and utilizes recently introduced search algorithms for a class of data structures on the BSP model. Moreover, our methods are within a 1 + o(1) multiplicative factor of the respective sequential methods in terms of speedup for a wide range of the BSP parameters.