论并行算法的分类 |
| |
引用本文: | 陈景良. 论并行算法的分类[J]. 计算数学, 1990, 12(4): 393-406 |
| |
作者姓名: | 陈景良 |
| |
作者单位: | 清华大学 |
| |
摘 要: | §1.引言利用并行计算系统求解数值计算问题或非数值计算问题,需根据系统的类型设计并行算法。自然,并行算法设计的主要基础是求解问题所涉及的学科领域中的原理和方法,或直接揭示某些已有方法中潜在的并行性,或推广某些原理发展显含并行性的新方法。但是,要建立可行(能在一个并行计算系统中实现)和有效(能充分发挥系统性能使并行度与
|
关 键 词: | 并行算法 SIMD算法 MIMD算法 异步 |
ON THE CLASSIFICATION OF PARALLEL ALGORITHMS |
| |
Affiliation: | Chen Jing-liang (Tsinghua University) |
| |
Abstract: | First, the solution and algorithm, as well as decompositions of task level and process of solution, are described, and then a structural model of parallel algorithms is developed. Ba-sed on this, all the parallel algorithms are classified into three types: SIMD algorithms, syn-chronous MIMD algorithms and asynchronous algorithms. Furthermore, the characterization, designing and applicability of each type of algorithms are clarified respectively. Some typical examples are given. |
| |
Keywords: | |
本文献已被 CNKI 维普 等数据库收录! |
| 点击此处可从《计算数学》浏览原始摘要信息 |
|
点击此处可从《计算数学》下载全文 |
|