Résumé
We investigate two algorithms for solving large-scale granular problems using domain decomposition methods. These numerical schemes can be connected to classical domain decompositions, with and without overlapping, developed in continuum mechanics. The two algorithms are compared in terms of implementation and parallel performance. We focus the numerical study on communication procedures between processors, load balancing and scalability, topics particularly crucial in nonlinear evolutive problems.