Computational Technology Resources - CCC

G. Gbikpi-Benissan¹ and F. Magoules^1,2

¹Laboratory of Mathematics in Interaction with Computer Science, Centrale Supelec, Paris-Saclay University, Gif-sur-Yvette, France
²Faculty of Engineering and Information Technology, University of Pecs, Hungary

doi:10.4203/ccc.4.1.1

G. Gbikpi-Benissan, F. Magoules, "Accurate Coarse Residual for Two-Level Asynchronous Domain Decomposition Methods", in P. Iványi, F. Magoulès, B.H.V. Topping, (Editors), "Proceedings of the Seventh International Conference on Parallel, Distributed, GPU and Cloud Computing for Engineering", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 4, Paper 1.1, 2023, doi:10.4203/ccc.4.1.1

Keywords: parallel computing, domain decomposition methods, overlapping Schwarz, asynchronous iterations, coarse-space correction, global residual.

Abstract

Recently, asynchronous coarse-space correction has been achieved within both the overlapping Schwarz and the primal Schur frameworks. Both additive and multiplicative corrections have been discussed. In this paper, we address some implementation drawbacks of the proposed additive correction scheme. In the existing approach, each coarse solution is applied only once, leaving most of the iterations of the solver without coarse-space information while building the right-hand side of the coarse problem. Moreover, one-sided routines of the Message Passing Interface (MPI) standard were considered, which introduced the need for a sleep statement in the iterations loop of the coarse solver. This implies a tuning of the sleep period, which is a nondiscrete quantity. In this paper, we improve the accuracy of the coarse right-hand side, which allowed for more frequent corrections. In addition, we highlight a two-sided implementation which better suits the asynchronous coarse-space correction scheme. Numerical experiments show a significant performance gain with such increased incorporation of the coarse space.

download the full-text of this paper (PDF, 10 pages, 316 Kb)

go to the next paper
return to the table of contents
return to the volume description

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCC CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Conferences ISSN 2753-3239 CCC: 4 PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GPU AND CLOUD COMPUTING FOR ENGINEERING Edited by: P. Iványi, F. Magoulès and B.H.V. Topping Paper 1.1 Accurate Coarse Residual for Two-Level Asynchronous Domain Decomposition Methods G. Gbikpi-Benissan¹ and F. Magoules^1,2 ¹Laboratory of Mathematics in Interaction with Computer Science, Centrale Supelec, Paris-Saclay University, Gif-sur-Yvette, France ²Faculty of Engineering and Information Technology, University of Pecs, Hungary doi:10.4203/ccc.4.1.1 Full Bibliographic Reference for this paper G. Gbikpi-Benissan, F. Magoules, "Accurate Coarse Residual for Two-Level Asynchronous Domain Decomposition Methods", in P. Iványi, F. Magoulès, B.H.V. Topping, (Editors), "Proceedings of the Seventh International Conference on Parallel, Distributed, GPU and Cloud Computing for Engineering", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 4, Paper 1.1, 2023, doi:10.4203/ccc.4.1.1 Keywords: parallel computing, domain decomposition methods, overlapping Schwarz, asynchronous iterations, coarse-space correction, global residual. Abstract Recently, asynchronous coarse-space correction has been achieved within both the overlapping Schwarz and the primal Schur frameworks. Both additive and multiplicative corrections have been discussed. In this paper, we address some implementation drawbacks of the proposed additive correction scheme. In the existing approach, each coarse solution is applied only once, leaving most of the iterations of the solver without coarse-space information while building the right-hand side of the coarse problem. Moreover, one-sided routines of the Message Passing Interface (MPI) standard were considered, which introduced the need for a sleep statement in the iterations loop of the coarse solver. This implies a tuning of the sleep period, which is a nondiscrete quantity. In this paper, we improve the accuracy of the coarse right-hand side, which allowed for more frequent corrections. In addition, we highlight a two-sided implementation which better suits the asynchronous coarse-space correction scheme. Numerical experiments show a significant performance gain with such increased incorporation of the coarse space. download the full-text of this paper (PDF, 10 pages, 316 Kb) go to the next paper return to the table of contents return to the volume description
Back to top	©Civil-Comp Limited 2023 - terms & conditions