Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    A Multilevel Hierarchical Parallel Algorithm for Large-Scale Finite Element Modal Analysis

    Gaoyuan Yu1, Yunfeng Lou2, Hang Dong3, Junjie Li1, Xianlong Jin1,*

    CMC-Computers, Materials & Continua, Vol.76, No.3, pp. 2795-2816, 2023, DOI:10.32604/cmc.2023.037375 - 08 October 2023

    Abstract The strict and high-standard requirements for the safety and stability of major engineering systems make it a tough challenge for large-scale finite element modal analysis. At the same time, realizing the systematic analysis of the entire large structure of these engineering systems is extremely meaningful in practice. This article proposes a multilevel hierarchical parallel algorithm for large-scale finite element modal analysis to reduce the parallel computational efficiency loss when using heterogeneous multicore distributed storage computers in solving large-scale finite element modal analysis. Based on two-level partitioning and four-transformation strategies, the proposed algorithm not only improves… More >

  • Open Access

    ARTICLE

    Analysis of CLARANS Algorithm for Weather Data Based on Spark

    Jiahao Zhang, Honglin Wang*

    CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2427-2441, 2023, DOI:10.32604/cmc.2023.038462 - 30 August 2023

    Abstract With the rapid development of technology, processing the explosive growth of meteorological data on traditional standalone computing has become increasingly time-consuming, which cannot meet the demands of scientific research and business. Therefore, this paper proposes the implementation of the parallel Clustering Large Application based upon RANdomized Search (CLARANS) clustering algorithm on the Spark cloud computing platform to cluster China’s climate regions using meteorological data from 1988 to 2018. The aim is to address the challenge of applying clustering algorithms to large datasets. In this paper, the morphological similarity distance is adopted as the similarity measurement… More >

  • Open Access

    ARTICLE

    Identifying Counterexamples Without Variability in Software Product Line Model Checking

    Ling Ding1, Hongyan Wan2,*, Luokai Hu1, Yu Chen1

    CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 2655-2670, 2023, DOI:10.32604/cmc.2023.035542 - 31 March 2023

    Abstract Product detection based on state abstraction technologies in the software product line (SPL) is more complex when compared to a single system. This variability constitutes a new complexity, and the counterexample may be valid for some products but spurious for others. In this paper, we found that spurious products are primarily due to the failure states, which correspond to the spurious counterexamples. The violated products correspond to the real counterexamples. Hence, identifying counterexamples is a critical problem in detecting violated products. In our approach, we obtain the violated products through the genuine counterexamples, which have… More >

  • Open Access

    ARTICLE

    A New Hybrid Hierarchical Parallel Algorithm to Enhance the Performance of Large-Scale Structural Analysis Based on Heterogeneous Multicore Clusters

    Gaoyuan Yu1, Yunfeng Lou2, Hang Dong3, Junjie Li1, Xianlong Jin1,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.1, pp. 135-155, 2023, DOI:10.32604/cmes.2023.025166 - 05 January 2023

    Abstract Heterogeneous multicore clusters are becoming more popular for high-performance computing due to their great computing power and cost-to-performance effectiveness nowadays. Nevertheless, parallel efficiency degradation is still a problem in large-scale structural analysis based on heterogeneous multicore clusters. To solve it, a hybrid hierarchical parallel algorithm (HHPA) is proposed on the basis of the conventional domain decomposition algorithm (CDDA) and the parallel sparse solver. In this new algorithm, a three-layer parallelization of the computational procedure is introduced to enable the separation of the communication of inter-nodes, heterogeneous-core-groups (HCGs) and inside-heterogeneous-core-groups through mapping computing tasks to various… More >

  • Open Access

    ARTICLE

    Identification and Classification of Multiple Power Quality Disturbances Using a Parallel Algorithm and Decision Rules

    Nagendra Kumar Swarnkar1, Om Prakash Mahela2, Baseem Khan3,*, Mahendra Lalwani1

    Energy Engineering, Vol.119, No.2, pp. 473-497, 2022, DOI:10.32604/ee.2022.017703 - 24 January 2022

    Abstract A multiple power quality (MPQ) disturbance has two or more power quality (PQ) disturbances superimposed on a voltage signal. A compact and robust technique is required to identify and classify the MPQ disturbances. This manuscript investigated a hybrid algorithm which is designed using parallel processing of voltage with multiple power quality (MPQ) disturbance using stockwell transform (ST) and hilbert transform (HT). This will reduce the computational time to identify the MPQ disturbances, which makes the algorithm fast. A MPQ identification index (IPI) is computed using statistical features extracted from the voltage signal using the ST… More >

  • Open Access

    ARTICLE

    A GPU-Based Parallel Algorithm for 2D Large Deformation Contact Problems Using the Finite Particle Method

    Wei Wang1,2, Yanfeng Zheng1,3, Jingzhe Tang1, Chao Yang1, Yaozhi Luo1,*

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

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

  • Open Access

    ARTICLE

    BFS Parallel Algorithm Based on Sunway TaihuLight

    Yang Zhou1, Jinhui He1, Hao Yang1,2,*

    Journal of New Media, Vol.3, No.2, pp. 63-72, 2021, DOI:10.32604/jnm.2021.018829 - 23 April 2021

    Abstract In recent years, more and more attention has been paid to the research and application of graph structure. As the most typical representative of graph structure algorithm, breadth first search algorithm is widely used in many fields. However, the performance of traditional serial breadth first search (BFS) algorithm is often very low in specific areas, especially in large-scale graph structure traversal. However, it is very common to deal with large-scale graph structure in scientific research. At the same time, the computing performance of supercomputer has also made great progress. China’s self-developed supercomputer system Sunway TaihuLight… More >

  • Open Access

    ARTICLE

    Parallel Optimization of Program Instructions Using Genetic Algorithms

    Petre Anghelescu*

    CMC-Computers, Materials & Continua, Vol.67, No.3, pp. 3293-3310, 2021, DOI:10.32604/cmc.2021.015495 - 01 March 2021

    Abstract This paper describes an efficient solution to parallelize software program instructions, regardless of the programming language in which they are written. We solve the problem of the optimal distribution of a set of instructions on available processors. We propose a genetic algorithm to parallelize computations, using evolution to search the solution space. The stages of our proposed genetic algorithm are: The choice of the initial population and its representation in chromosomes, the crossover, and the mutation operations customized to the problem being dealt with. In this paper, genetic algorithms are applied to the entire search… More >

  • Open Access

    GPU-Based Simulation of Dynamic Characteristics of Ballasted Railway Track with Coupled Discrete-Finite Element Method

    Xu Li1, Ying Yan2, Shuai Shao3, Shunying Ji1,*

    CMES-Computer Modeling in Engineering & Sciences, Vol.126, No.2, pp. 645-671, 2021, DOI:10.32604/cmes.2021.013674 - 21 January 2021

    Abstract Considering the interaction between a sleeper, ballast layer, and substructure, a three-dimensional coupled discrete-finite element method for a ballasted railway track is proposed in this study. Ballast granules with irregular shapes are constructed using a clump model using the discrete element method. Meanwhile, concrete sleepers, embankments, and foundations are modelled using 20-node hexahedron solid elements using the finite element method. To improve computational efficiency, a GPU-based (Graphics Processing Unit) parallel framework is applied in the discrete element simulation. Additionally, an algorithm containing contact search and transfer parameters at the contact interface of discrete particles and… More >

  • Open Access

    ARTICLE

    Parallel Control-volume Method Based on Compact Local Integrated RBFs for the Solution of Fluid Flow Problems

    N. Pham-Sy1, C.-D. Tran1, N. Mai-Duy1, T. Tran-Cong1

    CMES-Computer Modeling in Engineering & Sciences, Vol.100, No.5, pp. 363-397, 2014, DOI:10.3970/cmes.2014.100.363

    Abstract In this paper, a high performance computing method based on the Integrated Radial Basis Function (IRBF), Control Volume (CV) and Domain Decomposition technique for solving Partial Differential Equations is presented. The goal is to develop an efficient parallel algorithm based on the Compact Local IRBF method using the CV approach, especially for problems with non-rectangular domain. The results showed that the goal is achieved as the computational efficiency is quite significant. For the case of square lid driven cavity problem with Renoylds number 100, super-linear speed-up is also achieved. The parallel algorithm is implemented in More >

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