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. © 2012 Springer-Verlag.
CITATION STYLE
Ashby, T. J., Ghysels, P., Heirman, W., & Vanroose, W. (2012). The impact of global communication latency at extreme scales on Krylov methods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7439 LNCS, pp. 428–442). https://doi.org/10.1007/978-3-642-33078-0_31
Mendeley helps you to discover research relevant for your work.