Quick sort is a sorting algorithm whose worst case running time is θ(n² ) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place and had better performance than classical sequential quick sort in running time. Approach: The algorithm consisted of several stages, in first stage; it splits input data into two partitions, next stages it did the same partitioning for prior stage which had been spitted until 2 m partitions was reached equal to the number of available processors, finally it used heap sort to sort respectively ordered of non internally sorted partitions in parallel. Results: Results showed the speed of algorithm about double speed of classical Quick sort for a large input size. The number of comparisons needed was reduced significantly. Conclusion: In this stu
%0 Journal Article
%1 3696115420081101
%A hija, Mwaffaq A. Abu Al
%A Zabian, Arwa
%A Qawasmeh, Sami
%A haija, Omer H. Abu Al
%D 2008
%J Journal of Computer Science
%K 2010 kde parallel seminar sortingalgorithm
%N 11
%P 897 - 902
%T A Heapify Based Parallel Sorting Algorithm.
%U http://search.ebscohost.com/login.aspx?direct=true&db=iih&AN=36961154&site=ehost-live
%V 4
%X Quick sort is a sorting algorithm whose worst case running time is θ(n² ) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place and had better performance than classical sequential quick sort in running time. Approach: The algorithm consisted of several stages, in first stage; it splits input data into two partitions, next stages it did the same partitioning for prior stage which had been spitted until 2 m partitions was reached equal to the number of available processors, finally it used heap sort to sort respectively ordered of non internally sorted partitions in parallel. Results: Results showed the speed of algorithm about double speed of classical Quick sort for a large input size. The number of comparisons needed was reduced significantly. Conclusion: In this stu
@article{3696115420081101,
abstract = {Quick sort is a sorting algorithm whose worst case running time is θ(n² ) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place and had better performance than classical sequential quick sort in running time. Approach: The algorithm consisted of several stages, in first stage; it splits input data into two partitions, next stages it did the same partitioning for prior stage which had been spitted until 2 m partitions was reached equal to the number of available processors, finally it used heap sort to sort respectively ordered of non internally sorted partitions in parallel. Results: Results showed the speed of algorithm about double speed of classical Quick sort for a large input size. The number of comparisons needed was reduced significantly. Conclusion: In this stu},
added-at = {2010-04-25T15:11:54.000+0200},
author = {hija, Mwaffaq A. Abu Al and Zabian, Arwa and Qawasmeh, Sami and haija, Omer H. Abu Al},
biburl = {https://www.bibsonomy.org/bibtex/2086602515f03db05f754ad6315dbbf68/kw},
interhash = {2e9ca13da4d5c64140043ec31c224130},
intrahash = {086602515f03db05f754ad6315dbbf68},
issn = {15493636},
journal = {Journal of Computer Science},
keywords = {2010 kde parallel seminar sortingalgorithm},
number = 11,
pages = {897 - 902},
timestamp = {2010-04-25T15:11:54.000+0200},
title = {A Heapify Based Parallel Sorting Algorithm.},
url = {http://search.ebscohost.com/login.aspx?direct=true&db=iih&AN=36961154&site=ehost-live},
volume = 4,
year = 2008
}