EVA STAR Trefferanzeige

Volltext emcl-preprint-2011-14.pdf1.pdf (1,7 MB)
URN (für Zitat) http://nbn-resolving.org/urn:nbn:de:swb:90-295264
Titel A Block-Asynchronous Relaxation Method for Graphics Processing Units
Autor Anzt, H.
Dongarra, J.
Heuveline, Vincent
Tomov, S.
Institution Fakultät für Mathematik (MATH)
Institut für Angewandte und Numerische Mathematik (IANM)
Dokumenttyp Buch
Verlag KIT, Karlsruhe
Jahr 2011
Serie Preprint Series of the Engineering Mathematics and Computing Lab (EMCL) ; 2011,14
ISSN: 2191-0693
Abstract In this paper, we analyze the potential of asynchronous relaxation methods on Graphics Processing Units (GPUs). For this purpose, we developed a set of asynchronous iteration algorithms in CUDA and compared them with a parallel implementation of synchronous relaxation methods on CPU-based systems. For a set of test matrices taken from the University of Florida Matrix Collection we monitor the convergence behavior, the average iteration time and the total time-to-solution time. Analyzing the results, we observe that even for our most basic asynchronous relaxation scheme, despite its lower convergence rate compared to the Gauss-Seidel relaxation (that we expected), the asynchronous iteration running on GPUs is still able to provide solution approximations of certain accuracy in considerably shorter time than Gauss-Seidel running on CPUs. Hence, it overcompensates for the slower convergence by exploiting the scalability and the good fit of the asynchronous schemes for the highly parallel GPU architectures. Further, enhancing the most basic asynchronous approach with hybrid schemes -- using multiple iterations within the "subdomain" handled by a GPU thread block and Jacobi-like asynchronous updates across the "boundaries", subject to tuning various parameters -- we manage to not only recover the loss of global convergence but often accelerate convergence of up to two times (compared to the standard but difficult to parallelize Gauss-Seidel type of schemes), while keeping the execution time of a global iteration practically the same. This shows the high potential of the asynchronous methods not only as a stand alone numerical solver for linear systems of equations fulfilling certain convergence conditions but more importantly as a smoother in multigrid methods. Due to the explosion of parallelism in todays architecture designs, the significance and the need for asynchronous methods, as the ones described in this work, is expected to grow.