The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/34600
Record Status Checked
Record Id 34600
Title The communication performance of the Cray T3D and its effect on iterative solvers
Abstract On many distributed memory systems, such as workstation clusters or the Intel iPSC/860, the multigrid algorithm suffers from having extensive communication requirements and, in general, it is not very competitive in comparison to the conjugate gradient algorithm. This is in contrast to the sequential problem whereby the multigrid algorithm is very effective in reducing the global residual, particularly for very large linear systems of equations. These two algorithms are now compared on the Gray T3D for solving very large systems of linear equations (resulted from grids of the order 256(3) cells). The communication performance of the Gray T3D is first measured by the standard ping-pong tests and also by practical communication tasks that are found frequently in CFD calculations. It is found that the Gray no has a low latency (approximate to 6 mu s) and a high bandwidth interprocessor communication (120 MB/s) when the low-level intrinsic communication routines are used. As a result, the multigrid algorithm is found to be very competitive when compared with the conjugate gradient algorithm for solving the very large linear systems arising from the Direct Numerical Simulation of turbulent Combustion (DNSC). Results are contrasted by those on the Intel iPSC/860.
Organisation CCLRC , CSE , CSE-CEG
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Journal Article Parallel Comput 22, no. 6 (1996): 829-844. doi:10.1016/0167-8191(96)00035-X 1996