Parallel bucket sorting on graphics processing units based on convex optimization

References

• Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. 3rd ed. Cambridge, MA: MIT press; 2009.
   Google Scholar
• Knuth DE. The art of computer programming. 2nd ed. Vol. 3, Sorting and searching. Boston, MA: Addison-Wesley; 1998.
   Google Scholar
• Sedgewick R. Algorithms. 2nd ed. Reading, MA: Addison-Wesley; 1988.
   Google Scholar
• Akl SG. Parallel sorting algorithms. Orlando: Academic Press, Inc.; 1990.
   Google Scholar
• Sintorn E, Assarson U. Fast parallel GPU-sorting using a hybrid algorithm. J. Parallel Distr. Com. 2008;68:1381–1388.
   Web of Science ®Google Scholar
• Satish N, Harris M, Garland M. Designing efficient sorting algorithms for manycore GPUs. In: Proc. of IEEE Intl Parallel and Distributed Processing Symposium 2009 (IPDPS 2009), 2009.
   Google Scholar
• NVIDIA Tesla datasheets. 2012 [31 August, 2012]; Available from: http://www.nvidia.com/object/tesla-supercomputing-solutions.html
   Google Scholar
• Cederman D, Tsigas P. GPU-Quicksort: A practical quicksort algorithm for graphics processors. ACM J. Exp. Algorithmics. 2009;14:1.4.1–1.4.24.
   Google Scholar
• Merrill D, Grimshaw AA. High performance and scalable radix sorting: a case study of implementing dynamic parallelism for GPU computing. Parallel Process. Lett. 2011;21:245–272.
   Google Scholar
• Leischner N, Osipov V, Sanders P. 2010. GPU samplesort. In IEEE International Parallel and Distributed Processing Symposium. Atlanta: IEEE. doi:10.1109/IPDPS.2010.5470444
   Google Scholar
• Ye X, Fan D, Lin W. High performance comparison-based sorting algorithm on many-core GPUs. In IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE Computer Society; 2010.
   Google Scholar
• Press AH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical recipes in C: the art of scientific computing. New York: Cambridge University Press; 2002.
   Google Scholar
• Blum M, Floyd RW, Watt V, Rive RL, Tarjan RE. Time bounds for selection. J. Comput. Syst. Sci. 1973;7:448–461.
   Google Scholar
• Beliakov G. Parallel calculation of the median and order statistics on GPUs with application to robust regression. Technical report, 2011. arxiv:1104.2732.
   Google Scholar
• Beliakov G, Johnstone M, Nahavandi S. Computing of high breakdown regression estimators without sorting on graphics processing units. Computing. 2012;94:433–447.
   Web of Science ®Google Scholar
• Sengupta S, Harris M, Zhang Y, Owens JD. Scan primitives for GPU computing. Graph. Hardware. 2007;97–106.
   Google Scholar
• Le Grand S. Broad-phase collision detection with cuda. In: Nguyen H, editor. GPU Gems 3. Addison-Wesley Professional; 2007. p. 697–721.
   Google Scholar
• Govindaraju NK, Gray J, Kumar R. GPUTera-Sort: High performance graphics coprocessor sorting for large database management. In Proc. 2006 ACM SIGMOD Intl Conf. on Management of Data; 2006. p. 325-336.
   Google Scholar
• Hoberock J, Bel N. Thrust. 2012. http://thrust.github.com/.
   Google Scholar
• NVIDIA CUDA Zone. 2012 [accessed 1 june, 2012]; Available from: http://www.nvidia.com/object/cuda_home_new.html
   Google Scholar
• Dehne F, Zaboli H. Deterministic sample sort for gpus. 2010; arXiv:1002.4464v1.
   Google Scholar
• Peters H, Schulz-Hildebrandt O, Luttenberger N. Fast in-place, comparison-based sorting with CUDA: a study with bitonic sort. Concurr. Comput.: Pract. Exper. 2011;23:681–693.
   Web of Science ®Google Scholar
• Arnold BC, Balakrishnan N, Nagaraja HN. A first course in order statistics. New York: Wiley; 1992.
   Google Scholar
• Beliakov G. Fast computation of trimmed means. J. Stat. Software. 2011;39:1–6.
   PubMedGoogle Scholar
• Beliakov G, Kelarev A, Yearwood J. Derivative-free optimization and neural networks for robust regression. Optimization. 2012;61:1467–1490.
   Web of Science ®Google Scholar
• David HA, Nagaraja HN. Order statistics. 3rd ed. Hoboken, NJ: Wiley; 2003.
   Google Scholar
• Schumaker LL. On shape preserving quadratic spline interpolation. SIAM J. Numer. Anal. 1983;20:854–864.
   Web of Science ®Google Scholar
• Beliakov G, Li G. Improving the speed and stability of the k-nearest neighbors method. Pattern Recogn. Lett. 2012;33:1296–1301.
   Web of Science ®Google Scholar
• Jackson D. Note on the median of a set of numbers. B. Am. Math. Soc. 1921;27:160–164.
   Google Scholar
• Bullen PS. Handbook of means and their inequalities. Dordrecht: Kluwer; 2003.
   Google Scholar
• Gini C, Medie Le. Unione tipografico-editorial torinese: Milan (Russian translation, Srednie Velichiny, Statistica, Moscow, 1970). 1958.
   Google Scholar
• Yager R, Rybalov A. Understanding the median as a fusion operator. Int. J. General Syst. 1997;26:239–263.
   Web of Science ®Google Scholar
• Calvo T, Mesiar R, Yager R. Quantitative weights and aggregation. IEEE T. Fuzzy Syst. 2004;12:62–69.
   Web of Science ®Google Scholar
• Calvo T, Beliakov G. Aggregation functions based on penalties. Fuzzy Set. Syst. 2010;161:1420–1436.
   Web of Science ®Google Scholar
• Kelley JE. The cutting-plane method for solving convex programs. J. SIAM. 1960;8:703–712.
   Web of Science ®Google Scholar
• Demyanov VF, Rubinov AM. Constructive nonsmooth analysis. Frankfurt am Main: Peter Lang; 1995.
   Google Scholar
• Clarke FH. Optimization and nonsmooth analysis. New York: John Wiley; 1983.
   Google Scholar
• NVIDIA 2012 [accessed 1 june, 2010]; Available from: http://developer.download.nvidia.com/compute/cuda/1_1/website/data-parallel_algorithms.html.
   Google Scholar