Parallelism of quicksort

Quicksort and its variations remain one of the most popular and effective data sorting algorithms. Sorted data is extremely useful for efficient data search. While technologies are improving, influence of parallelism is rising rapidly and benefit of data sorting algorithm remains the same. Quicksort algorithm has several different parallelism solutions, which have non-trivial realization and efficiency. Furthermore, Quicksort has several different selection of pivot, partitioning and recursion methods, which have different pros and cons. Purpose of this paper is to present recommendations for parallelism of Quicksort. Different solutions are realized and their efficiencies are compared in this paper. Additionally, this paper contains evaluation of various Quicksort variations and their influence to parallel Quicksort