THE PARALLEL SORTING BY DIVIDE-POINT LOCATING ALOGRITHM

The parallel sorting by divide point locating （PSDL） algorithm is proposed and analyzed in this paper. In the algorithm, input data are averagely partitioned and distributed to all processors, so each processor has the same workload. The experimental results of the PSDL algorithm under network distributed computing environment are given and compared with that of the PSRS algorithm. According to the theoretical analysis and experimental results, the PSDL algorithm is an efficient and scalable algorithm of parallel sorting.