The Impact of Global Communication Latency at Extreme Scales on Krylov Methods

Abstract

Krylov Subspace Methods (KSMs) are popular numerical tools for solving large linear systems of equations. We consider their role in solving sparse systems on future massively parallel distributed memory machines, by estimating future performance of their constituent operations. To this end we construct a model that is simple, but which takes topology and network acceleration into account as they are important considerations. We show that, as the number of nodes of a parallel machine increases to very large numbers, the increasing latency cost of reductions may well become a problematic bottleneck for traditional formulations of these methods. Finally, we discuss how pipelined KSMs can be used to tackle the potential problem, and appropriate pipeline depths.

DOI: 10.1007/978-3-642-33078-0_31

5 Figures and Tables

Cite this paper

@inproceedings{Ashby2012TheIO, title={The Impact of Global Communication Latency at Extreme Scales on Krylov Methods}, author={Thomas J. Ashby and Pieter Ghysels and Wim Heirman and Wim Vanroose}, booktitle={ICA3PP}, year={2012} }