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.
BolzeRCappelloFCaronEDaydéMDesprezFJeannotE. (2006) GRID’5000: A large scale and highly reconfigurable experimental Grid testbed. Int J High Perform Comput Appl20: 481–494.
6.
ChandyKMLamportL (1985) Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst3: 63–75.
7.
ChazanDMirankerW (1969) Chaotic relaxation. Linear Algebra Appl2: 199–222.
8.
El TaraziM (1982) Some convergence results for asynchronous algorithms. Numer Math39: 325–340.
9.
GiraudLSpiteriP (1991) “Résolution parallèle de problèmes aux limites non linéaires”, M2AN25: 579–606.
10.
GlowinskiRLionsJLTremolieresR (1976) Analyse numérique des inéquations variationnelles. DUNOD, tome 1 and 2.
11.
KuznetsovYANeittaanmakiPTarvainenP (1996) Block relaxation methods for algebraic obstacle problems with M-matrices, East–West J Numer Math4: 69–82.
12.
LionsPMercierB (1980) Approximation numérique des équations de Hamilton–Jacobi–Bellman. RAIRO Anal Numér14: 369–393.
13.
MiellouJ (1975) Algorithmes de relaxation chaotique à retards. RAIRO Anal NumérR1: 55–82.
14.
MiellouJSpiteriP (1985a) Un critère de convergence pour des méthodes générales de point fixe. M2AN 19: 645–669.
15.
MiellouJSpiteriP (1985b) Two criteria for the convergence of asynchronous iterations. In CheninP. (Ed.), Computers and Computing. Paris: Wiley Masson, pp. 91–95.
16.
SpiteriPChauM (2002) Parallel asynchronous Richardson method for the solution of obstacle problem. In AlmhanaJNBhavsarVC (ed.), Proceedings of the 16th Annual International Symposium on HPCS, 2002. New York: IEEE, pp. 133–138.
17.
SpiteriPMiellouJCEl BazD (2001) Asynchronous Schwarz alternating method with flexible communication for the obstacle problem. Rés Syst Répartis13: 47–66.
18.
TaiXC (2001) Convergence rate analysis of domain decomposition methods for obstacle problems. East–West J Numer Anal9: 233–252.
