Paper
1 November 1990 Solving unstructured grid problems on massively parallel computers
Steven W. Hammond, Robert Schreiber
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Steven W. Hammond and Robert Schreiber "Solving unstructured grid problems on massively parallel computers", Proc. SPIE 1348, Advanced Signal Processing Algorithms, Architectures, and Implementations, (1 November 1990); https://doi.org/10.1117/12.23496
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computing systems

Parallel computing

Partial differential equations

Back to Top