Journal of Applied Sciences1812-56541812-5662Asian Network for Scientific Information10.3923/jas.2008.2341.2343RaniPushpaRaniSudesh122008812This 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.]]>Alok, A. and C.G. Plaxton,1994Dusseau, A.C., D.E. Culler, K.E. Schauser and R.P. Martin,1996Hoare, C.A.R.,1962Iyer, B.R. and D.M. Dias,1990Murshed, M.M. and R.P. Brent,2000Mishra, P. and M.H. Eich,1992Mohan, C., H. Pirahesh, W.G. Tang and Y. Wang,1994Selim, G.A.,1990Surajit, C. and S. Kyuseok,1996Wolf, J.L., D.M. Dias and P.S. Yu,1993