{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:11:58Z","timestamp":1760145118923,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of Jiangxi Province","award":["20212BAB212007","20212BAB202016"],"award-info":[{"award-number":["20212BAB212007","20212BAB202016"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Sequence alignment is a critical factor in the variant analysis of genomic research. Since the FM (Ferrainas\u2013Manzini) 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.<\/jats:p>","DOI":"10.3390\/fi16060217","type":"journal-article","created":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T08:06:06Z","timestamp":1718784366000},"page":"217","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Data Parallelism for FM-Based Short-Read Alignment on the Heterogeneous Non-Uniform Memory Access Architectures"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5479-0197","authenticated-orcid":false,"given":"Shaolong","family":"Chen","sequence":"first","affiliation":[{"name":"School of Software, Jiangxi Normal University, Nanchang 330022, China"},{"name":"Jiangxi Provincial Engineering Research Center of Blockchain Data Security and Governance, Nanchang 330022, China"}]},{"given":"Yunzi","family":"Dai","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Normal University, Nanchang 330022, China"}]},{"given":"Liwei","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Normal University, Nanchang 330022, China"}]},{"given":"Xinting","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Normal University, Nanchang 330022, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,6,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1007\/s11227-017-2159-7","article-title":"Parallelization of Large Vector Similarity Computations in a Hybrid CPU+GPU Environment","volume":"74","author":"Czarnul","year":"2017","journal-title":"J. Supercomput.\/J. Supercomput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/TPDS.2023.3325137","article-title":"A High-Performance Genomic Accelerator for Accurate Sequence-to-Graph Alignment Using Dynamic Programming Algorithm","volume":"35","author":"Zeng","year":"2024","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1038\/s41587-019-0201-4","article-title":"Graph-Based Genome Alignment and Genotyping with HISAT2 and HISAT-Genotype","volume":"37","author":"Kim","year":"2019","journal-title":"Nat. Biotechnol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1240233.1240243","article-title":"Compressed Representations of Sequences and Full-Text Indexes","volume":"3","author":"Ferragina","year":"2007","journal-title":"ACM Trans. Algorithms"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Anderson, T., and Wheeler, T.J. (2021). An Optimized FM-Index Library for Nucleotide and Amino Acid Search. Algorithms Mol. Biol., 16.","DOI":"10.1186\/s13015-021-00204-6"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3514245","article-title":"A Case for Intra-Rack Resource Disaggregation in HPC","volume":"19","author":"Michelogiannakis","year":"2022","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TC.2020.2993561","article-title":"An Energy-Aware High Performance Task Allocation Strategy in Heterogeneous Fog Computing Environments","volume":"70","author":"Gai","year":"2021","journal-title":"IEEE Trans. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Jia, M., Zhang, Y., Gan, X., Li, D., Xu, E., Wang, R., and Lu, K. (2022, January 13\u201318). vGraph: Memory-Efficient Multicore Graph Processing for Traversal-Centric Algorithms. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC \u201822), Dallas, TX, USA.","DOI":"10.1109\/SC41404.2022.00068"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hong, A., Oliva, M., K\u00f6ppl, D., Bannai, H., Boucher, C., and Gagie, T. (2024). Pfp-Fm: An Accelerated FM-Index. Algorithms Mol. Biol., 19.","DOI":"10.1186\/s13015-024-00260-8"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1038\/nmeth.1923","article-title":"Fast Gapped-Read Alignment with Bowtie 2","volume":"9","author":"Langmead","year":"2012","journal-title":"Nat. Methods"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","article-title":"Fast and Accurate Long-Read Alignment with Burrows\u2013Wheeler Transform","volume":"26","author":"Li","year":"2010","journal-title":"Bioinformatics"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1038\/nmeth.3317","article-title":"HISAT: A Fast Spliced Aligner with Low Memory Requirements","volume":"12","author":"Kim","year":"2015","journal-title":"Nat. Methods"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","article-title":"SOAP2: An Improved Ultrafast Tool for Short Read Alignment","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1101\/gr.260604.119","article-title":"Data Structures Based on K-Mers for Querying Large Collections of Sequencing Data Sets","volume":"31","author":"Marchet","year":"2020","journal-title":"Genome Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1109\/TBCAS.2023.3293721","article-title":"An FM-Index Based High-Throughput Memory-Efficient FPGA Accelerator for Paired-End Short-Read Mapping","volume":"17","author":"Yang","year":"2023","journal-title":"IEEE Trans. Biomed. Circuits Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2790","DOI":"10.1093\/bioinformatics\/btr477","article-title":"Comparative Analysis of Algorithms for Next-Generation Sequencing Read Alignment","volume":"27","author":"Ruffalo","year":"2011","journal-title":"Bioinformatics"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Chen, J., Chao, J., Liu, H., Yang, F., Zou, Q., and Tang, F. (2023). WMSA 2: A Multiple DNA\/RNA Sequence Alignment Tool Implemented with Accurate Progressive Mode and a Fast Win-Win Mode Combining the Center Star and Progressive Strategies. Brief. Bioinform., 24.","DOI":"10.1093\/bib\/bbad190"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.26599\/TST.2019.9010036","article-title":"PsmArena: Partitioned Shared Memory for NUMA-Awareness in Multithreaded Scientific Applications","volume":"26","author":"Yang","year":"2021","journal-title":"Tsinghua Sci. Technol. \/Tsinghua Sci. Technol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"e7888","DOI":"10.1002\/cpe.7888","article-title":"A Scalable Parallel Algorithm for Global Sequence Alignment with Customizable Scoring Scheme","volume":"35","author":"Sadiq","year":"2023","journal-title":"Concurr. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Papadakis, O., Zakkak, F.S., Foutris, N., and Kotselidis, C. (2020, January 4\u20136). You Can\u2019t Hide You Can\u2019t Run: A Performance Assessment of Managed Applications on a NUMA Machine. Proceedings of the 17th International Conference on Managed Programming Languages and Runtimes (MPLR \u201920), Manchester, UK.","DOI":"10.1145\/3426182.3426189"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1109\/TPDS.2020.3030920","article-title":"Hierarchical Multi-Agent Optimization for Resource Allocation in Cloud Computing","volume":"32","author":"Gao","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Klus, P., Lam, S., Lyberg, D., Cheung, M.S., Pullan, G., McFarlane, I., Yeo, G.S., and Lam, B.Y. (2012). BarraCUDA\u2014A Fast Short Read Sequence Aligner Using Graphics Processing Units. BMC Res. Notes, 5.","DOI":"10.1186\/1756-0500-5-27"},{"key":"ref_23","unstructured":"Doblas, M., Lostes-Cazorla, O., Aguado-Puig, Q., Cebry, N., Fontova-Must\u00e9, P., Batten, C.F., Marco-Sola, S., and Moret\u00f3, M. (November, January 28). GMX: Instruction Set Extensions for Fast, Scalable, and Efficient Genome Sequence Alignment. Proceedings of the 56th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO \u201823), Toronto, ON, Canada."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Polyanovsky, V.O., Roytberg, M.A., and Tumanyan, V.G. (2011). Comparative Analysis of the Quality of a Global Algorithm and a Local Algorithm for Alignment of Two Sequences. Algorithms Mol. Biol., 6.","DOI":"10.1186\/1748-7188-6-25"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Aguado-Puig, Q., Doblas, M., Matzoros, C., Espinosa, A., Moure, J.C., Marco-Sola, S., and Moreto, M. (2023). WFA-GPU: Gap-Affine Pairwise Read-Alignment Using GPUs. Bioinformatics, 39.","DOI":"10.1093\/bioinformatics\/btad701"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Liu, B., and Warnow, T. (2023). WITCH-NG: Efficient and Accurate Alignment of Datasets with Sequence Length Heterogeneity. Bioinform. Adv., 3.","DOI":"10.1093\/bioadv\/vbad024"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1101\/gr.078212.108","article-title":"Mapping Short DNA Sequencing Reads and Calling Variants Using Mapping Quality Scores","volume":"18","author":"Li","year":"2008","journal-title":"Genome Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"i367","DOI":"10.1093\/bioinformatics\/btq217","article-title":"Efficient Construction of an Assembly String Graph Using the FM-Index","volume":"26","author":"Simpson","year":"2010","journal-title":"Bioinformatics"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Jiang, L., and Zokaee, F. (March, January 27). EXMA: A Genomics Accelerator for Exact-Matching. Proceedings of the 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), Seoul, Republic of Korea.","DOI":"10.1109\/HPCA51647.2021.00041"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/TPDS.2016.2548462","article-title":"Reactive Molecular Dynamics on Massively Parallel Heterogeneous Architectures","volume":"28","author":"Kylasa","year":"2017","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2852","DOI":"10.1109\/TPDS.2021.3078153","article-title":"Architectural Adaptation and Performance-Energy Optimization for CFD Application on AMD EPYC Rome","volume":"32","author":"Szustak","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_32","first-page":"3890255","article-title":"Construction of Artistic Design Patterns Based on Improved Distributed Data Parallel Computing of Heterogeneous Tasks","volume":"2022","author":"Sun","year":"2022","journal-title":"Math. Probl. Eng."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Liu, H., Zou, Q., and Xu, Y. (2021). A Novel Fast Multiple Nucleotide Sequence Alignment Method Based on FM-Index. Brief. Bioinform., 23.","DOI":"10.1093\/bib\/bbab519"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2081","DOI":"10.1093\/bioinformatics\/btac066","article-title":"Performance Optimization in DNA Short-Read Alignment","volume":"38","author":"Wilton","year":"2022","journal-title":"Bioinformatics"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/16\/6\/217\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:00:58Z","timestamp":1760108458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/16\/6\/217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,19]]},"references-count":34,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["fi16060217"],"URL":"https:\/\/doi.org\/10.3390\/fi16060217","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2024,6,19]]}}}