Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 12 | Page No.: 2341-2343
DOI: 10.3923/jas.2008.2341.2343
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

New Parallel Sorting Algorithm Based on Partitioning and Redistribution

Pushpa Rani and Sudesh Rani

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.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

Pushpa Rani and Sudesh Rani, 2008. New Parallel Sorting Algorithm Based on Partitioning and Redistribution. Journal of Applied Sciences, 8: 2341-2343.

DOI: 10.3923/jas.2008.2341.2343






Curve Bottom