Studying the Performance of Vector-Based Quicksort Algorithm
- 27 Downloads
The performance of parallel algorithms is often inconsistent with their preliminary theoretical analyses. Indeed, the difference is increasing between the ability to theoretically predict the performance of a parallel algorithm and the results measured in practice. This is mainly due to the accelerated development of advanced parallel architectures, whereas there is still no agreed model for parallel computation, which has implications for the design of parallel algorithms.
In this study, we examined the practical performance of Cormen’s Quicksort parallel algorithm. We determined the performance of the algorithm with different parallel programming approaches and examine the capacity of theoretical performance analyses of the algorithm for predicting the actual performance.
KeywordsPython Quicksort Performance modeling
- 2.Cormen, T.H.: Chapter 9: Parallel computing in a Python-based computer science course. In: Prasad, S.K., et al. (eds.) Topics in Parallel and Distributed Computing: Introducing Concurrency in Undergraduate Courses. Morgan Kaufmann (2015)Google Scholar
- 3.Blelloch, G.E.: Scan primitives and parallel vector models. Ph.D. dissertation, Massachusetts Institute of Technology (1988)Google Scholar
- 4.Blelloch, G.E.: Vector Models for Data-Parallel Computing. The MIT Press, Cambridge (1990)Google Scholar
- 5.Numba. http://numba.pydata.org/
- 6.Numpy. http://www.numpy.org/
- 7.Scipy. http://www.scipy.org/
- 8.Matplotlib. http://matplotlib.org/
- 9.Anaconda Accelerate. https://docs.continuum.io/accelerate/
- 10.Anaconda Python. https://www.continuum.io/downloads