摘要
加速比是判断一个并行算法是否最优的依据,但播送类问题是针对并行机提出的,不存在串行算法,加速比标准对之无能为力.通过对几种不同并行计算模型上播送算法的研究,文中提出了一个不依赖于具体模型的一般化的评价标准minC2,用以判断播送类算法是否最优,为这类问题的进一步研究开辟了新的思路.
Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcasting class problems, existing only on parallel computer systems, have no sequential algorithms. The speedup becomes invalid here. Through researhing on broadcasting algorithms in several typical parallel computation models, a model independent evaluation criterion min C 2 is developed, which can be used to determine an optimal broadcasting algorithm, and a new approach to broadcasting class problems is given.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1998年第2期114-117,共4页
Journal of Computer Research and Development
基金
国家自然科学基金
"863"计划资助
关键词
并行算法
并行计算模型
并行计算机
optimal parallel algorithm,broadcasting class problem,parallel computation model