PARALLEL ALGORITHMS UNDER NETWORK COMPUTING ENVIRONMENT AND THEIR SCALABILITY ANALYSIS

The scalability of parallel algorithms is a measure of its capability to effectively utilize an increasing number of computing nodes on networks. It can predict the performance of algorithms when the number of the computing nodes increases. Parallel matrix multiplication and PSRS （parallel sorting by regular sample） algorithm are implemented under PVM environment, their scalability under networks environment is analyzed, and the analysis results are certified by experiments.