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.
Al Rjoub et al. proposed a deterministic parallel sorting algorithm to improve the performance of quick sort REF .
Deterministic Parallel Sorting Algorithm for 2-D Mesh of Connected Computers
Journal of Computer Science
Computer Science