IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v16y2024i6p217-d1417737.html
   My bibliography  Save this article

Optimizing Data Parallelism for FM-Based Short-Read Alignment on the Heterogeneous Non-Uniform Memory Access Architectures

Author

Listed:
  • Shaolong Chen

    (School of Software, Jiangxi Normal University, Nanchang 330022, China
    Jiangxi Provincial Engineering Research Center of Blockchain Data Security and Governance, Nanchang 330022, China)

  • Yunzi Dai

    (School of Software, Jiangxi Normal University, Nanchang 330022, China)

  • Liwei Liu

    (School of Software, Jiangxi Normal University, Nanchang 330022, China)

  • Xinting Yu

    (School of Software, Jiangxi Normal University, Nanchang 330022, China)

Abstract

Sequence alignment is a critical factor in the variant analysis of genomic research. Since the FM (Ferrainas–Manzini) index was developed, it has proven to be a model in a compact format with efficient pattern matching and high-speed query searching, which has attracted much research interest in the field of sequence alignment. Such characteristics make it a convenient tool for handling large-scale sequence alignment projects executed with a small memory. In bioinformatics, the massive success of next-generation sequencing technology has led to an exponential growth in genomic data, presenting a computational challenge for sequence alignment. In addition, the use of a heterogeneous computing system, composed of various types of nodes, is prevalent in the field of HPC (high-performance computing), which presents a promising solution for sequence alignment. However, conventional methodologies in short-read alignment are limited in performance on current heterogeneous computing infrastructures. Therefore, we developed a parallel sequence alignment to investigate the applicability of this approach in NUMA-based (Non-Uniform Memory Access) heterogeneous architectures against traditional alignment algorithms. This proposed work combines the LF (longest-first) distribution policy with the EP (enhanced partitioning) strategy for effective load balancing and efficient parallelization among heterogeneous architectures. The newly proposed LF-EP-based FM aligner shows excellent efficiency and a significant improvement over NUMA-based heterogeneous computing platforms. We provide significantly improved performance over several popular FM aligners in many dimensions such as read length, sequence number, sequence distance, alignment speedup, and result quality. These resultant evaluation metrics cover the quality assessment, complexity analysis, and speedup evaluation of our approach. Utilizing the capabilities of NUMA-based heterogeneous computing architectures, our approach effectively provides a convenient solution for large-scale short-read alignment in the heterogeneous system.

Suggested Citation

  • Shaolong Chen & Yunzi Dai & Liwei Liu & Xinting Yu, 2024. "Optimizing Data Parallelism for FM-Based Short-Read Alignment on the Heterogeneous Non-Uniform Memory Access Architectures," Future Internet, MDPI, vol. 16(6), pages 1-18, June.
  • Handle: RePEc:gam:jftint:v:16:y:2024:i:6:p:217-:d:1417737
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/16/6/217/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/16/6/217/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yao Sun & Gengxin Sun, 2022. "Construction of Artistic Design Patterns Based on Improved Distributed Data Parallel Computing of Heterogeneous Tasks," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-11, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:16:y:2024:i:6:p:217-:d:1417737. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.