Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (8)
  • Open Access

    ARTICLE

    A Hybrid Parallel Strategy for Isogeometric Topology Optimization via CPU/GPU Heterogeneous Computing

    Zhaohui Xia1,3, Baichuan Gao3, Chen Yu2,*, Haotian Han3, Haobo Zhang3, Shuting Wang3

    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

    A Hybrid Parallel Strategy for Isogeometric Topology Optimization via CPU/GPU Heterogeneous Computing

  • Open Access

    ARTICLE

    A Parallel Hybrid Testing Technique for Tri-Programming Model-Based Software Systems

    Huda Basloom1,*, Mohamed Dahab1, Abdullah Saad AL-Ghamdi2, Fathy Eassa1, Ahmed Mohammed Alghamdi3, Seif Haridi4

    CMC-Computers, Materials & Continua, Vol.74, No.2, pp. 4501-4530, 2023, DOI:10.32604/cmc.2023.033928

    Abstract Recently, researchers have shown increasing interest in combining more than one programming model into systems running on high performance computing systems (HPCs) to achieve exascale by applying parallelism at multiple levels. Combining different programming paradigms, such as Message Passing Interface (MPI), Open Multiple Processing (OpenMP), and Open Accelerators (OpenACC), can increase computation speed and improve performance. During the integration of multiple models, the probability of runtime errors increases, making their detection difficult, especially in the absence of testing techniques that can detect these errors. Numerous studies have been conducted to identify these errors, but no technique exists for detecting errors… More >

  • Open Access

    ARTICLE

    Implementation of OpenMP Parallelization of Rate-Dependent Ceramic Peridynamic Model

    Haoran Zhang1, Yaxun Liu2, Lisheng Liu2,*, Xin Lai2,*, Qiwen Liu2, Hai Mei2

    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 >

  • Open Access

    ARTICLE

    Implementing Delay Multiply and Sum Beamformer on a Hybrid CPU-GPU Platform for Medical Ultrasound Imaging Using OpenMP and CUDA

    Ke Song1,*, Paul Liu2, Dongquan Liu3

    CMES-Computer Modeling in Engineering & Sciences, Vol.128, No.3, pp. 1133-1150, 2021, DOI:10.32604/cmes.2021.016008

    Abstract A novel beamforming algorithm named Delay Multiply and Sum (DMAS), which excels at enhancing the resolution and contrast of ultrasonic image, has recently been proposed. However, there are nested loops in this algorithm, so the calculation complexity is higher compared to the Delay and Sum (DAS) beamformer which is widely used in industry. Thus, we proposed a simple vector-based method to lower its complexity. The key point is to transform the nested loops into several vector operations, which can be efficiently implemented on many parallel platforms, such as Graphics Processing Units (GPUs), and multi-core Central Processing Units (CPUs). Consequently, we… More >

  • Open Access

    ARTICLE

    A Simple OpenMP Scheme for Parallel Iteration Solvers in Finite Element Analysis

    S.H. Ju1

    CMES-Computer Modeling in Engineering & Sciences, Vol.64, No.1, pp. 91-109, 2010, DOI:10.3970/cmes.2010.064.091

    Abstract This study develops an OpenMP scheme to parallel the preconditioned conjugate gradient methods (PCG) in shared memory computers. The proposed method is simple and systematic, so a minor change in traditional PCG methods may produce effective parallelism. At first, the global stiffness matrix is re-numbered in order to produce a parallel three-line form matrix, and a subroutine only needs to be called once in the finite element analysis. Several basic OpenMP commands are then added into the traditional incomplete Cholesky factorization (ILU) and symmetric successive over-relaxation (SSOR) codes to make the procedures of matrix multiplication, decomposition, forward substitution, and backward… More >

  • Open Access

    ARTICLE

    An Alternated Grid Updating Parallel Algorithm for Material Point Method Using OpenMP

    Yantao Zhang1, Xiong Zhang1,2, Yan Liu1

    CMES-Computer Modeling in Engineering & Sciences, Vol.69, No.2, pp. 143-166, 2010, DOI:10.3970/cmes.2010.069.143

    Abstract Material point method(MPM) is a promising method in solving problems involving large deformations, especially explosion and penetration. In MPM, particles can move around the computing domain dynamically, which can result in load imbalance easily. In parallelizing MPM using OpenMP, data races will occur in the stage of grid node updating if we use loop-level parallelism for these loops. Huang et al. proposed a domain decomposition method to overcome data races [Huang, Zhang, Ma and Wang (2008)]. However, significant modifications of the original serial code are required. In this paper, we proposed a new alternated grid updating method to avoid data… More >

  • Open Access

    ARTICLE

    Shared Memory OpenMP Parallelization of Explicit MPM and Its Application to Hypervelocity Impact

    P. Huang1,2, X. Zhang1,3, S. Ma1, H.K. Wang1

    CMES-Computer Modeling in Engineering & Sciences, Vol.38, No.2, pp. 119-148, 2008, DOI:10.3970/cmes.2008.038.119

    Abstract The material point method (MPM) is an extension of particle-in-cell method to solid mechanics. A parallel MPM code is developed using FORTRAN 95 and OpenMP in this study, which is designed primarily for solving impact dynamic problems. Two parallel methods, the array expansion method and the domain decomposition method, are presented to avoid data races in the nodal update stage. In the array expansion method, two-dimensional auxiliary arrays are created for nodal variables. After updating grid nodes in all threads, the auxiliary arrays are assembled to establish the global nodal array. In the domain decomposition method, the background grid is… More >

  • Open Access

    ARTICLE

    Fast Parallel Finite Element Approximate Inverses

    G.A. Gravvanis, K.M. Giannoutakis1

    CMES-Computer Modeling in Engineering & Sciences, Vol.32, No.1, pp. 35-44, 2008, DOI:10.3970/cmes.2008.032.035

    Abstract A new parallel normalized optimized approximate inverse algorithm, based on the concept of the ``fish bone'' computational approach with cyclic distribution of the processors satisfying an antidiagonal data dependency, for computing classes of explicit approximate inverses, is introduced for symmetric multiprocessor systems. The parallel normalized explicit approximate inverses are used in conjunction with parallel normalized explicit preconditioned conjugate gradient square schemes, for the efficient solution of finite element sparse linear systems. The parallel design and implementation issues of the new proposed algorithms are discussed and the parallel performance is presented, using OpenMP. More >

Displaying 1-10 on page 1 of 8. Per Page