Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods

Algebraic multigrid methods for large, sparse linear systems are a necessity in many computational simulations, yet parallel algorithms for such solvers are generally decomposed into coarse-grained tasks suitable for distributed computers with traditional processing cores. However, accelerating mult...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on scientific computing Jg. 34; H. 4; S. C123 - C152
Hauptverfasser:	Bell, Nathan, Dalton, Steven, Olson, Luke N.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Schlagworte:	Aggregates Algebra Algorithms Computation Computer simulation Cycles Explicit knowledge Exposure Heuristic High performance computing Methods Multigrid methods Solvers Sparsity
ISSN:	1064-8275, 1095-7197
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!