Measuring Parallel Performance of Sorting Algorithms

Saher Manaseer and Ahmad K. Al Hwaitat

Modern Applied Science, 2018, vol. 12, issue 10, 23

Abstract: The performance evaluation of sorting algorithm play a major role in understanding the behavior which has great benefit in most of the field of sciences, knowing the difference between parallel and sequential performance will help the researchers to choose the best algorithm bucket and bubble sort to use and implement. In this research we study the performance of two sorting algorithm and evaluate the difference in performance in aspect of speed up and efficiency, the two algorithms has been tested on IMAN1 super computer with different evaluate input size and different number of processors. The results showed that he performance of runtime for the bubble and bucket sorting algorithms has been effectively reduced by the parallel computing over the large data size and the number of processor of 64 get the lowest running time, and the parallel performance was better than other methods.

Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/0/0/36853/36908 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/0/36853 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:12:y:2018:i:10:p:23

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().