Research Article Open Access

Deterministic Parallel Sorting Algorithm for 2-D Mesh of Connected Computers

Hamed Al Rjoub, Arwa Zabian and Ahmad Odat

Abstract

Sorting is one of the most important operations in database systems and its efficiency can influences drastically the overall system performance. To accelerate the performance of database systems, parallelism is applied to the execution of the data administration operations. We propose a new deterministic Parallel Sorting Algorithm (DPSA) that improves the performance of Quick sort in sorting an array of size n. where we use p Processor Elements (PE) that work in parallel to sort a matrix r*c where r is the number of rows r = 3 and c is the number of columns c = n/3. The simulation results show that the performance of the proposed algorithm DPSA out performs Quick sort when it works sequentially.

Journal of Computer Science
Volume 4 No. 6, 2008, 447-453

DOI: https://doi.org/10.3844/jcssp.2008.447.453

Submitted On: 28 July 2008 Published On: 30 June 2008

How to Cite: Rjoub, H. A., Zabian, A. & Odat, A. (2008). Deterministic Parallel Sorting Algorithm for 2-D Mesh of Connected Computers. Journal of Computer Science, 4(6), 447-453. https://doi.org/10.3844/jcssp.2008.447.453

  • 2,741 Views
  • 2,819 Downloads
  • 1 Citations

Download

Keywords

  • Parallel sorting
  • deterministic algorithms
  • Quicksort
  • Parallel Quicksort