Abstract
The present study deals with the solution of the obstacle problem defined in a three-dimensional domain. In order to solve a large-scale obstacle problem, the use of parallelism is necessary. In this work we present a parallel synchronous iterative algorithm to solve this problem and its asynchronous version. For the considered problem, the convergence of parallel synchronous and asynchronous algorithms is analysed in a general framework. Finally, computational experiments on GRID’5000, the French national grid, are presented and analysed. They allow us to compare both synchronous and asynchronous versions with local and distributed clusters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of High Performance Computing Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
