摘要
并行算法的可扩放性是指其有效利用计算节点的能力，它可以预测算法在处理机数目变化时的性能．在网络环境下用ＰＶＭ实现了并行矩阵乘法及ＰＳＲＳ算法，分析了在网络计算环境下这两个算法的可扩放性，并利用试验数据进行了验证．
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.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1997年第11期844-849,共6页
Journal of Computer Research and Development
基金
高校博士点基金
"863"计划
关键词
网络计算
并行算法
可扩放性
等效率函数
network computing, parallel algorithms, scalability, iso efficiency function
