Reducing Synchronization Overheads In Cg-Type Parallel Iterative Solvers By Embedding Point-To-Point Communications Into Reduction Operations

Cevdet Aykanat
2014 Zenodo  
Parallel iterative solvers are widely used in solving large sparse linear systems of equations on large-scale parallel architectures. These solvers generally contain two different types of communication operations: point-topoint (P2P) and global collective communications. In this work, we present a computational reorganization method to exploit a property that is commonly found in Krylov subspace methods. This reorganization allows P2P and collective communications to be performed
more » ... . We realize this opportunity to embed the content of the messages of P2P communications into the messages exchanged in the collective communications in order to reduce the latency overhead of the solver. Experiments on two different supercomputers up to 2048 processors show that the proposed latency-avoiding method exhibits superior scalability, especially with increasing number of processors.
doi:10.5281/zenodo.825434 fatcat:tlle3zymnjddfh75q27oq35oxa