Fast k-selection algorithms for graphics processing units

@article{Alabi2012FastKA,
  title={Fast k-selection algorithms for graphics processing units},
  author={Tolu Alabi and Jeffrey D. Blanchard and Bradley Gordon and Russel Steinbach},
  journal={ACM Journal of Experimental Algorithmics},
  year={2012},
  volume={17}
}
Finding the <it>k</it>th-largest value in a list of <it>n</it> values is a well-studied problem for which many algorithms have been proposed. A naïve approach is to sort the list and then simply select the <it>k</it>th term in the sorted list. However, when the sorted list is not needed, this method does quite a bit of unnecessary work. Although sorting can be accomplished efficiently when working with a graphics processing unit (GPU), this article proposes two GPU algorithms, <tt>radixSelect… CONTINUE READING

References

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

GGKS: Grinnell GPU k-Selection

  • T. Alabi, J. D. Blanchard, B. Gordan, R. Steinbach
  • Version 1.0.0, http://code.google.com/p/ggks/.
  • 2011
Highly Influential
5 Excerpts

Algorithm 64: Quicksort

  • C.A.R. Hoare
  • Commun. ACM 4, 321–.
  • 1961
Highly Influential
10 Excerpts

Algorithm 65: find

  • C.A.R. Hoare
  • Commun. ACM 4, 321–322.
  • 1961
Highly Influential
10 Excerpts

Thrust: A parallel template library

  • J. Hoberock, N. Bell
  • Version 1.3.0, http://www.meganewtons.com/.
  • 2010
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…