Strategies and Performance Evaluation of Parallel Computation in Solving the Laplace Equation
スポンサーリンク
概要
- 論文の詳細を見る
The factors which have influence on the efficiency of parallel computation are the scheme of problem decomposition, the processor interconnection, and the OS overhead. In this paper, the scheme of problem decomposition of parallel computation in solving the Laplace equation numerically is studied from two different viewpoints, the strategy of partitioning mesh-points into blocks and the strategy for assignment of these blocks to the processors. Two matrices called the partition matrix and the distance matrix are introduced and an algorithm to give an optimum processor assignment to the blocks in the sense that it results in minimum data transmission in the whole system is presented. The performance of parallel computation in solving a Lapalce equation is evaluated by developing a software simulator of CORAL system which is a binary tree processor network. The result, in comparison with serial computation, shows that a speed-up ratio of 100 is attained with 300 processors in a binary tree.
- 一般社団法人情報処理学会の論文
- 1982-12-20
著者
-
Takahashi Yoshizo
Department Of Information Science And Inteliigent Systems University Of Tokushima.
-
Takahashi Yoshizo
Department Of Information Science Faculty Of Engineering Tokushima University
-
NOBUTOMO YOSHIHIRO
Department of Industrial Control Systems, Omika Works, Hitachi Co.,Ltd.
-
KAWAMURA TOSHIKAZU
Heavy Apparatus Engineering Laboratory, Toshiba Inc.
-
Kawamura Toshikazu
Heavy Apparatus Engineering Laboratory Toshiba Inc.
-
Nobutomo Yoshihiro
Department Of Industrial Control Systems Omika Works Hitachi Co. Ltd.
関連論文
- Efficiency of Parallel Computation on the Binary-Tree Machine CORAL'83
- Strategies and Performance Evaluation of Parallel Computation in Solving the Laplace Equation
- The MEGA Router : A Hardware Message-Passing Gate Array Router
- Restricted-Length Hardware Multicasting in Multicomputer Networks