Parallel Processing of Sorting and Searching Algorithms Comparative Study


  •  Saad AL-Azzam    
  •  Mohammad Qatawneh    

Abstract

Recently, supercomputers structure and its software optimization have been popular subjects. Much of the software recently consumes a long period of time both to sort and search datasets, and thus optimizing these algorithms becomes a priority. In order to discover the most efficient sorting and searching algorithms for parallel processing units, one can compare CPU runtime as a performance index. In this paper, Quick, Bubble, and Merge sort algorithms have been chosen for comparison, as well as sequential and binary as search algorithms. Each one of the sort and search algorithms was tested in worst, average and best case scenarios. And each scenario was applied using multiple techniques (sequential, multithread, and parallel processing) on a various number of processors to spot differences and calculate speed up factor.

The proposed solution aims to optimize the performance of a supercomputer focusing one-time efficiency; all tests were conducted by The IMAN1 supercomputer which is Jordan's first and fastest supercomputer.



This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1913-1844
  • Issn(Onlne): 1913-1852
  • Started: 2007
  • Frequency: monthly

Journal Metrics

(The data was calculated based on Google Scholar Citations)

Google-based Impact Factor (2018): 6.49

h-index (January 2018): 30

i10-index (January 2018): 163

h5-index (January 2018): 19

h5-median(January 2018): 25

Contact