High-performance genome sorting program

This paper is devoted to the practical application of parallel sorting algorithms and parallel input-output methods for the problem of genome alignment. The paper considers different approaches to the implementation of such algorithms, taking into account the capabilities of high-performance systems...

Full description

Saved in:
Bibliographic Details
Published inProcedia computer science Vol. 193; pp. 464 - 473
Main Authors Kasilov, Vasily, Drobintsev, Pavel, Voinov, Nikita
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2021
Subjects
alignment
BAM
genome
HPC
OpenMP
SAM files
sorting algorithm
SAM files
genome
OpenMP
HPC
sorting algorithm
alignment
BAM
Online AccessGet full text
ISSN1877-0509
1877-0509
DOI10.1016/j.procs.2021.10.048

Cover

More Information
Summary:This paper is devoted to the practical application of parallel sorting algorithms and parallel input-output methods for the problem of genome alignment. The paper considers different approaches to the implementation of such algorithms, taking into account the capabilities of high-performance systems. Main purpose of the work is to develop a genome sorting program, the efficiency of which significantly exceeds the efficiency of free software analogues. The genome sorting program is implemented for a supercomputer using the C++ language and the OpenMP and OpenMPI. The developed program demonstrates a significant increase in the speed of operation (up to 10 times) compared to free software analogues due to massive parallel data input and output. Different approaches for data input/output parallelization and data processing considered in the paper can be applied in other subject areas.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2021.10.048