Fast Parallel Sorting Algorithm Using Subsets and Quick Sort

Öz

— This paper presents fast parallel sorting algorithm which uses division in subsets and quick sort algorithm. The proposed algorithm is evaluated by analytic way and results shows that it will be faster than algorithm in [3] when time for division in subsets of all set is bigger than time for sending/receiving of partial subsets

Anahtar Kelimeler

• -

Kaynakça

1. Knuth D., The art of computer programming, V3. Sorting and Searching, Addison Wesley Publishing Company, 1973.
2. Wilkinson B. and Allen M., Sorting Algorithms, Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers, Prentice-Hall, 1999.
3. Bosakova-Ardenska A., N. Vasilev, I. Fillipov, Fast parallel sorting based on quick sort, TechSys 2013, Journal of the Technical University Sofia, branch Plovdiv, “Fundamental Sciences and Applications”, Vol. 19, 2013, ISSN 1310-8271, pp 35-40.
4. Joseph JaJa, An Introduction to Parallel Algorithms, Addison- Wesley publishing company, 1992.