Research ArticleOpen accessPhrase in the titleA Heapify Based Parallel Sorting AlgorithmM. A.A.A. Hija, A. Zabian, S. Qawasmeh, O. H.A.A. HaijaQuick sort is a sorting algorithm whose worst case running time is θ(n2) 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 … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,766 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleDeterministic Parallel Sorting Algorithm for 2-D Mesh of Connected ComputersHamed Al Rjoub, Arwa Zabian, Ahmad OdatSorting 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 … …Journal of Computer Science, Vol. 4, Issue 6 · 30 Jun 2008 · 6,824 accessesView PDFCite
Research ArticleOpen accessIn the abstractDPSA: Deterministic Parallel Search Algorithm in Large DatabaseSami Qawasmeh, Arwa ZabianThe main goal of parallel processing is to reduce the complexity of finding a solution for a problem. In this study, we consider the problem of searching for multiple items at the same time in a large database. We propose a parallel search algorithm that reduces the searching time in comparison to binary search algorithm saving in that the time … …Journal of Computer Science, Vol. 13, Issue 9 · 6 Sep 2017 · 7,190 accessesView PDFCite
Research ArticleOpen accessIn the abstractSorting N-Elements Using Natural Order: A New Adaptive Sorting ApproachShamim Akhter, M. Tanveer HasanProblem statement: Researchers focused their attention on optimally adaptive sorting algorithm and illustrated a need to develop tools for constructing adaptive algorithms for large classes of measures. In adaptive sorting algorithm the run time for n input data smoothly varies from O(n) to O(nlogn), with respect to several measures of disorder. Questions were raised whether any approach or technique would … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,722 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Two-Dimensional Quicksort Algorithm (PTSA)Hamed Al Rjoub, Ahmad Odat, Abdullah AudatIn this research, a Parallel Two-Dimensional Sorting Algorithm (PTSA) is presented that has better performance than the classical Quicksort, to sort a data vector of size n = r (rows) × c(columns). PTSA algorithm divides the input vector into n/r sub-vectors, which represents tow-dimensional vector of Slave Processor Elements (VPE ), the maximum number of VPE for parallel sorting is … …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 6,859 accessesView PDFCite