چكيده لاتين :
This study describes a new parallel sorting algorithm PPS based on the techniques of partitioning and redistribution, where the sorting process is split into two stages: partitioning and independent local work. In parallel partitioned sort, first we partition local data using range partitioning. Then local sort is carried out. The main benefit of parallel partitioned sort is that no merging is needed for the final result because the results
produced by the local sort are already the final results
