| タイトル | Mapping unstructured grid problems to the connection machine |
| 本文（外部サイト） | http://hdl.handle.net/2060/19910023550 |
| 著者（英） | Schreiber, Robert; Hammond, Steven W. |
| 著者所属（英） | Research Inst. for Advanced Computer Science |
| 発行日 | 1990-10-01 |
| 言語 | eng |
| 内容記述 | We present a highly parallel graph mapping technique that enables one to solve unstructured grid problems on massively parallel computers. Many implicit and explicit methods for solving discretizated partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The time spent communicating can limit the high performance promised by massively parallel computing. To eliminate this bottleneck, we map the graph of the irregular problem to the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. We show that, in comparison to a naive assignment of processors, our heuristic mapping algorithm significantly reduces the communication time on the Connection Machine, CM-2. |
| NASA分類 | NUMERICAL ANALYSIS |
| レポートNO | 91N32864
RIACS-TR-90-22
NASA-CR-187719
NAS 1.26:187719 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/130658 |
