Share Email Print
cover

Proceedings Paper

Solving unstructured grid problems on massively parallel computers
Author(s): Steven W. Hammond; Robert Schreiber
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We present a highly parailel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck we map the graph of the irregular problem into 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 using our heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Paper Details

Date Published: 1 November 1990
PDF: 12 pages
Proc. SPIE 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations, (1 November 1990); doi: 10.1117/12.23496
Show Author Affiliations
Steven W. Hammond, NASA/Ames Research Ctr. (United States)
Robert Schreiber, NASA/Ames Research Ctr. (United States)


Published in SPIE Proceedings Vol. 1348:
Advanced Signal Processing Algorithms, Architectures, and Implementations
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top