Deterministic Sorting and Randomized Median Finding on the BSP Model

@inproceedings{Gerbessiotis1996DeterministicSA,
  title={Deterministic Sorting and Randomized Median Finding on the BSP Model},
  author={Alexandros V. Gerbessiotis and Constantinos J. Siniolakis},
  booktitle={SPAA},
  year={1996}
}
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… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 64 CITATIONS

Randomized selection in n+C+o(n) comparisons

VIEW 5 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS

Concurrent Heaps on the BSP Model

Constantinos J. SiniolakisPRG
  • 1996
VIEW 6 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

A Study of Integer Sorting on Multicores

  • Parallel Processing Letters
  • 2018
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND

Extending the BSP model for multi-core and out-of-core computing: MBSP

  • Parallel Computing
  • 2015
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND

A randomized sorting algorithm on the BSP model

  • Discrete Math., Alg. and Appl.
  • 2014
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS

FILTER CITATIONS BY YEAR

1995
2019

CITATION STATISTICS

  • 5 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Expected Time Bounds for Selection

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

The Art of Computer Programming. Vol- ume III: Sorting and Searching

D. E. Knuth
  • 1973
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Time Bounds for Selection

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL