Yang Li¹, Jiangping Xu^1,*, Yun Liu¹, Wen Zhong^2,*, Fei Wang³

CMES-Computer Modeling in Engineering & Sciences, Vol.140, No.1, pp. 461-483, 2024, DOI:10.32604/cmes.2024.046467

Abstract 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… More > Graphic Abstract

Shigeki Kaneko¹, Naoto Mitsume², Shinobu Yoshimura^1,*

Digital Engineering and Digital Twin, Vol.2, pp. 33-48, 2024, DOI:10.32604/dedt.2023.044279

Abstract In an integrated coal gasification combined cycle plant, cooling pipes are installed in the gasifier reactor and water cooling is executed to avoid reaching an excessively high temperature. To accelerate the design, it is necessary to develop an analysis system that can simulate the cooling operation within the practical computational time. In the present study, we assumed the temperature fields of the cooled object and the cooling water to be governed by the three-dimensional (3D) heat equation and the one-dimensional (1D) convection-diffusion equation, respectively. Although some existing studies have employed similar modeling, the applications have been limited to simple-shaped structures.… More >

Changtao Wang, Honghua Dai^*, Wenchuan Yang

Digital Engineering and Digital Twin, Vol.1, pp. 3-13, 2023, DOI:10.32604/dedt.2023.044210

Abstract A novel Adaptive Parallel Feedback-Accelerated Picard Iteration (AP-FAPI) method is proposed to meet the requirements of various aerospace missions for fast and accurate orbit propagation. The Parallel Feedback-Accelerated Picard Iteration (P-FAPI) method is an advanced iterative collocation method. With large-step computing and parallel acceleration, the P-FAPI method outperforms the traditional finite-difference-based methods, which require small-step and serial integration to ensure accuracy. Although efficient and accurate, the P-FAPI method suffers extensive trials in tuning method parameters, strongly influencing its performance. To overcome this problem, we propose the AP-FAPI method based on the relationship between the parameters and the convergence speed leveraging… More >

Zhaohui Xia^1,3, Baichuan Gao³, Chen Yu^2,*, Haotian Han³, Haobo Zhang³, Shuting Wang³

CMES-Computer Modeling in Engineering & Sciences, Vol.138, No.2, pp. 1103-1137, 2024, DOI:10.32604/cmes.2023.029177

Abstract This paper aims to solve large-scale and complex isogeometric topology optimization problems that consume significant computational resources. A novel isogeometric topology optimization method with a hybrid parallel strategy of CPU/GPU is proposed, while the hybrid parallel strategies for stiffness matrix assembly, equation solving, sensitivity analysis, and design variable update are discussed in detail. To ensure the high efficiency of CPU/GPU computing, a workload balancing strategy is presented for optimally distributing the workload between CPU and GPU. To illustrate the advantages of the proposed method, three benchmark examples are tested to verify the hybrid parallel strategy in this paper. The results… More > Graphic Abstract

Jawad Ahmad^1,*, Mimonah Al Qathrady², Mohammed S. Alshehri³, Yazeed Yasin Ghadi⁴, Mujeeb Ur Rehman⁵, Syed Aziz Shah⁶

CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 1325-1341, 2023, DOI:10.32604/cmc.2023.040858

Abstract Due to the inherent insecure nature of the Internet, it is crucial to ensure the secure transmission of image data over this network. Additionally, given the limitations of computers, it becomes even more important to employ efficient and fast image encryption techniques. While 1D chaotic maps offer a practical approach to real-time image encryption, their limited flexibility and increased vulnerability restrict their practical application. In this research, we have utilized a 3D Hindmarsh-Rose model to construct a secure cryptosystem. The randomness of the chaotic map is assessed through standard analysis. The proposed system enhances security by incorporating an increased number… More >

Khaled M. Suwais^*

CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 2685-2704, 2023, DOI:10.32604/cmc.2023.036161

Abstract Data encryption is essential in securing exchanged data between connected parties. Encryption is the process of transforming readable text into scrambled, unreadable text using secure keys. Stream ciphers are one type of an encryption algorithm that relies on only one key for decryption and as well as encryption. Many existing encryption algorithms are developed based on either a mathematical foundation or on other biological, social or physical behaviours. One technique is to utilise the behavioural aspects of game theory in a stream cipher. In this paper, we introduce an enhanced Deoxyribonucleic acid (DNA)-coded stream cipher based on an iterated n-player… More >

Haoran Zhang¹, Yaxun Liu², Lisheng Liu^2,*, Xin Lai^2,*, Qiwen Liu², Hai Mei²

CMES-Computer Modeling in Engineering & Sciences, Vol.133, No.1, pp. 195-217, 2022, DOI:10.32604/cmes.2022.020495

Abstract A rate-dependent peridynamic ceramic model, considering the brittle tensile response, compressive plastic softening and strain-rate dependence, can accurately represent the dynamic response and crack propagation of ceramic materials. However, it also considers the strain-rate dependence and damage accumulation caused by compressive plastic softening during the compression stage, requiring more computational resources for the bond force evaluation and damage evolution. Herein, the OpenMP parallel optimization of the rate-dependent peridynamic ceramic model is investigated. Also, the modules that compute the interactions between material points and update damage index are vectorized and parallelized. Moreover, the numerical examples are carried out to simulate the… More >

Jinggang Deng^1,2, Bingquan Zuo^1,2,*, Huixin Luo^1,2, Weikang Xie^1,2, Jiashu Yang^1,2

CMES-Computer Modeling in Engineering & Sciences, Vol.132, No.3, pp. 965-990, 2022, DOI:10.32604/cmes.2022.020631

Abstract In this paper, a new computation scheme based on parallelization is proposed for Isogeometric analysis. The parallel computing is introduced to the whole progress of Isogeometric analysis. Firstly, with the help of the “tensorproduct” and “iso-parametric” feature, all the Gaussian integral points in particular element can be mapped to a global matrix using a transformation matrix that varies from element. Then the derivatives of Gauss integral points are computed in parallel, the results of which can be stored in a global matrix. And a middle layer is constructed to assemble the final stiffness matrices in parallel. The numerical example results… More >

Hongly Va¹, Min-Hyung Choi², Min Hong^3,*

CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 831-848, 2022, DOI:10.32604/cmc.2022.029576

Abstract This paper presents a parallel method for simulating real-time 3D deformable objects using the volume preservation mass-spring system method on tetrahedron meshes. In general, the conventional mass-spring system is manipulated as a force-driven method because it is fast, simple to implement, and the parameters can be controlled. However, the springs in traditional mass-spring system can be excessively elongated which cause severe stability and robustness issues that lead to shape restoring, simulation blow-up, and huge volume loss of the deformable object. In addition, traditional method that uses a serial process of the central processing unit (CPU) to solve the system in… More >

Wei Wang^1,2, Yanfeng Zheng^1,3, Jingzhe Tang¹, Chao Yang¹, Yaozhi Luo^1,*

CMES-Computer Modeling in Engineering & Sciences, Vol.129, No.2, pp. 595-626, 2021, DOI:10.32604/cmes.2021.017321

Abstract Large deformation contact problems generally involve highly nonlinear behaviors, which are very time-consuming and may lead to convergence issues. The finite particle method (FPM) effectively separates pure deformation from total motion in large deformation problems. In addition, the decoupled procedures of the FPM make it suitable for parallel computing, which may provide an approach to solve time-consuming issues. In this study, a graphics processing unit (GPU)-based parallel algorithm is proposed for two-dimensional large deformation contact problems. The fundamentals of the FPM for planar solids are first briefly introduced, including the equations of motion of particles and the internal forces of… More >