Communication Cost Reduction for Krylov Methods on Parallel Computers

On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved algorithms to reduce this communication overhead, and we analyze the performance by experiments on a 400-processor parallel computer and with a simple performance model.

• Type: Conference
• Year: 1994
• Where: HPCN
• Authors: Eric de Sturler, Henk A. van der Vorst
• Keywords: Distributed And Parallel Computing, HPCN 1994, Krylov Subspace Methods, Memory Parallel Computers, Parallel Computer