In this paper, using the metric of iso--efficiency function [if. we analyze the scalability of PSRS (Parallel. Sorting by Regular Sample) algorithm I2] on two popular architectures (Mesh and Hypercube) The Isoefficien...In this paper, using the metric of iso--efficiency function [if. we analyze the scalability of PSRS (Parallel. Sorting by Regular Sample) algorithm I2] on two popular architectures (Mesh and Hypercube) The Isoefficiency function of PSRS on 2-dimensional mesh With p processors reaches the lower bound for that of sorting algorithms on this architecture. In nils sense, we say the scalabilify of PSRS is optimal on 2-dimensional mesh. The lso-efficiency function of PSRS on hypercube is equal to that of PSRS on 2-dimensional mesh. After changing the data exchanging scheme of PSRS, -cafe get a ne'v iso-efficiency function . which is better than that of PSRS on 2-dimensional mesh So we say that hypercube is more suitable for PSRS than 2--dimensional mesh.展开更多
文摘In this paper, using the metric of iso--efficiency function [if. we analyze the scalability of PSRS (Parallel. Sorting by Regular Sample) algorithm I2] on two popular architectures (Mesh and Hypercube) The Isoefficiency function of PSRS on 2-dimensional mesh With p processors reaches the lower bound for that of sorting algorithms on this architecture. In nils sense, we say the scalabilify of PSRS is optimal on 2-dimensional mesh. The lso-efficiency function of PSRS on hypercube is equal to that of PSRS on 2-dimensional mesh. After changing the data exchanging scheme of PSRS, -cafe get a ne'v iso-efficiency function . which is better than that of PSRS on 2-dimensional mesh So we say that hypercube is more suitable for PSRS than 2--dimensional mesh.
