Open Access iconOpen Access



MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation

Yang Li1, Jiangping Xu1,*, Yun Liu1, Wen Zhong2,*, Fei Wang3

1 School of Mechanical Engineering, Jiangsu University, Zhenjiang, 212016, China
2 School of Mechanical Engineering, Wuhan Polytechnic University, Wuhan, 430023, China
3 Shenyang Mint Company Limited, Shenyang, 110092, China

* Corresponding Authors: Jiangping Xu. Email: email; Wen Zhong. Email: email

(This article belongs to the Special Issue: New Trends on Meshless Method and Numerical Analysis)

Computer Modeling in Engineering & Sciences 2024, 140(1), 461-483.


In this research, we present the pure open multi-processing (OpenMP), pure message passing interface (MPI), and hybrid MPI/OpenMP parallel solvers within the dynamic explicit central difference algorithm for the coining process to address the challenge of capturing fine relief features of approximately 50 microns. Achieving such precision demands the utilization of at least 7 million tetrahedron elements, surpassing the capabilities of traditional serial programs previously developed. To mitigate data races when calculating internal forces, intermediate arrays are introduced within the OpenMP directive. This helps ensure proper synchronization and avoid conflicts during parallel execution. Additionally, in the MPI implementation, the coins are partitioned into the desired number of regions. This division allows for efficient distribution of computational tasks across multiple processes. Numerical simulation examples are conducted to compare the three solvers with serial programs, evaluating correctness, acceleration ratio, and parallel efficiency. The results reveal a relative error of approximately 0.3% in forming force among the parallel and serial solvers, while the predicted insufficient material zones align with experimental observations. Additionally, speedup ratio and parallel efficiency are assessed for the coining process simulation. The pure MPI parallel solver achieves a maximum acceleration of 9.5 on a single computer (utilizing 12 cores) and the hybrid solver exhibits a speedup ratio of 136 in a cluster (using 6 compute nodes and 12 cores per compute node), showing the strong scalability of the hybrid MPI/OpenMP programming model. This approach effectively meets the simulation requirements for commemorative coins with intricate relief patterns.

Graphical Abstract

MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation


Cite This Article

APA Style
Li, Y., Xu, J., Liu, Y., Zhong, W., Wang, F. (2024). Mpi/openmp-based parallel solver for imprint forming simulation. Computer Modeling in Engineering & Sciences, 140(1), 461-483.
Vancouver Style
Li Y, Xu J, Liu Y, Zhong W, Wang F. Mpi/openmp-based parallel solver for imprint forming simulation. Comput Model Eng Sci. 2024;140(1):461-483
IEEE Style
Y. Li, J. Xu, Y. Liu, W. Zhong, and F. Wang "MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation," Comput. Model. Eng. Sci., vol. 140, no. 1, pp. 461-483. 2024.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 108


  • 166


  • 0


Share Link