Research on the Optimal Parallel Algorithms of Broadcast-Class Problems

作     者：李晓峰 寿标 郑世荣 

作者机构：DepartmentofComputerScienceUniversityofScienceandTecnologyofChinaHefei230027PR.China 

出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)

年 卷 期：1998年第13卷第5期

页      面：455-463页

核心收录：

学科分类：0810[工学-信息与通信工程] 08[工学] 081001[工学-通信与信息系统] 

基　　金：国家自然科学基金 国家863计划 

主　　题：Optimal parallel algorithm broadcast-class problem parallel computation model min C^2 

摘      要：Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcast-class problems, existing only on parallel computer system, have no sequential algorithms at all. Speedup standard becomes invalid here. Through this research on broadcast algorithms under several typical parallel computation models,a model-independent evaluation standard min C2 is developed, which can be not only used to determine an optimal broadcasting algorithm, but also normalized to apply to any parallel algorithm. As a new idea, min C2 will lead to a new way in this field.