Solving unstructured grid problems on massively parallel computersA highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. 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, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.
Document ID
19920034762
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Hammond, Steven W. (NASA Ames Research Center Moffett Field, CA, United States)
Schreiber, Robert (NASA Ames Research Center Moffett Field, CA, United States)
Date Acquired
August 15, 2013
Publication Date
January 1, 1990
Subject Category
Computer Programming And Software
Meeting Information
Meeting: Advanced Signal-Processing Algorithms, Architectures and Implementations