It is an efficient technique to parallelize incomplete factorizations based on domain decomposition. In this paper, three are considered for solving the derived sparse linear systems from the meso-scale simulation of concrete, including the block Jacobi analog, the classical additive Schwarz, and the so-called factors combination method. For the grid may be of unstructured ones, the graph partitioning method is exploited to perform domain decomposition. The different partitioning schemes are compared and analyzed. The results show that the communication structure is one of the vital factors for the efficiency but not the all. Further, the degree of overlapping is also tested and the results show that for the current simulation, the degree of 1 is enough.