Muhammad Ali, Minhaj Ahmad Khan^*

Computer Systems Science and Engineering, Vol.48, No.2, pp. 287-303, 2024, DOI:10.32604/csse.2023.043010

Abstract The Extensible Markup Language (XML) files, widely used for storing and exchanging information on the web require efficient parsing mechanisms to improve the performance of the applications. With the existing Document Object Model (DOM) based parsing, the performance degrades due to sequential processing and large memory requirements, thereby requiring an efficient XML parser to mitigate these issues. In this paper, we propose a Parallel XML Tree Generator (PXTG) algorithm for accelerating the parsing of XML files and a Regression-based XML Parsing Framework (RXPF) that analyzes and predicts performance through profiling, regression, and code generation for efficient parsing. The PXTG algorithm… More >

Xin Liu¹, Jie Li^1,*, Jianwei Zhao², Bin Cao^2,*, Rongge Yan³, Zhihan Lyu⁴

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.1, pp. 143-185, 2024, DOI:10.32604/cmes.2023.030391

Abstract Most of the neural network architectures are based on human experience, which requires a long and tedious trial-and-error process. Neural architecture search (NAS) attempts to detect effective architectures without human intervention. Evolutionary algorithms (EAs) for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures. Using multiobjective EAs for NAS, optimal neural architectures that meet various performance criteria can be explored and discovered efficiently. Furthermore, hardware-accelerated NAS methods can improve the efficiency of the NAS. While existing reviews have mainly focused on different strategies to complete NAS, a few studies have explored the… More > Graphic Abstract

Mary Aksa¹, Junaid Rashid^2,*, Muhammad Wasif Nisar¹, Toqeer Mahmood³, Hyuk-Yoon Kwon⁴, Amir Hussain⁵

CMC-Computers, Materials & Continua, Vol.68, No.3, pp. 3931-3946, 2021, DOI:10.32604/cmc.2021.016081

Abstract Advancements in next-generation sequencer (NGS) platforms have improved NGS sequence data production and reduced the cost involved, which has resulted in the production of a large amount of genome data. The downstream analysis of multiple associated sequences has become a bottleneck for the growing genomic data due to storage and space utilization issues in the domain of bioinformatics. The traditional string-matching algorithms are efficient for small sized data sequences and cannot process large amounts of data for downstream analysis. This study proposes a novel bit-parallelism algorithm called BitmapAligner to overcome the issues faced due to a large number of sequences… More >

Zonglin Fu¹, Pei Hu¹, Wei Li², Jeng-Shyang Pan^1,*, Shuchuan Chu¹

Intelligent Automation & Soft Computing, Vol.27, No.1, pp. 233-247, 2021, DOI:10.32604/iasc.2021.014192

Abstract The Equilibrium Optimizer (EO) algorithm is a novel meta-heuristic algorithm based on the strength of physics. To achieve better global search capability, a Parallel Equilibrium Optimizer algorithm, named PEO, is proposed in this paper. PEO is inspired by the idea of parallelism and adopts two different communication strategies between groups to improve EO. The first strategy is used to speed up the convergence rate and the second strategy promotes the algorithm to search for a better solution. These two kinds of communication strategies are used in the early and later iterations of PEO respectively. To check the optimization effect of… More >

Min Ki Kim¹, Seung Jo Kim²

CMES-Computer Modeling in Engineering & Sciences, Vol.84, No.4, pp. 297-332, 2012, DOI:10.3970/cmes.2012.084.297

Abstract Hybrid parallelization of multifrontal solution method and its parallel performances in a multicore distributed parallel computing architecture are represented in this paper. To utilize a state-of-the-art multicore computing architecture, parallelization of the multifrontal method for a symmetric multiprocessor machine is required. Multifrontal method is easier to parallelize than other direct solution methods because the solution procedure implies that the elimination of unknowns can be executed simultaneously. This paper focuses on the multithreaded parallelism and mixing distributed algorithm and multithreaded algorithm together in a unified software. To implement the hybrid parallelized algorithm in a distributed shared memory environment, two innovative ideas… More >

C. Moulinec¹, R. Issa², J.-C. Marongiu³, D. Violeau⁴

CMES-Computer Modeling in Engineering & Sciences, Vol.25, No.3, pp. 133-148, 2008, DOI:10.3970/cmes.2008.025.133

Abstract The gridless Smoothed Particle Hydrodynamics (SPH) numerical method is preferably used in Computational Fluid Dynamics (CFD) to simulate complex flows with one or several convoluted free surfaces. This type of flows requires distorted meshes with classical Eulerian mesh-based methods or very fine meshes with Volume of Fluid method. Few 3-D SPH simulations have been carried out to our knowlegde so far, mainly due to prohibitive computational investment since the number of particles required in 3-D is usually too large to be handled by a single processor. In this paper, a parallel 3-D SPH code is presented. Parallelisation validation is discussed… More >