High-Performance Computation of the Number of Nested RNA Structures with 3D Parallel Tiled Code

Many current bioinformatics algorithms have been implemented in parallel programming code. Some of them have already reached the limits imposed by Amdahl’s law, but many can still be improved. In our paper, we present an approach allowing us to generate a high-performance code for calculating the nu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Eng (Basel, Switzerland) Ročník 4; číslo 1; s. 507 - 525
Hlavní autoři: Błaszyński, Piotr, Bielecki, Włodzimierz
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.03.2023
Témata:
Algorithms
Bioinformatics
code parallelization
Codes
Dependence
dynamic programming
Gold
High performance computing
high-performance code
Parallel programming
RNA folding
tiled code generation
ISSN:2673-4117, 2673-4117
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Many current bioinformatics algorithms have been implemented in parallel programming code. Some of them have already reached the limits imposed by Amdahl’s law, but many can still be improved. In our paper, we present an approach allowing us to generate a high-performance code for calculating the number of RNA pairs. The approach allows us to generate parallel tiled code of the maximal dimension of tiles, which for the discussed algorithm is 3D. Experiments carried out by us on two modern multi-core computers, an Intel(R) Xeon(R) Gold 6326 (2.90 GHz, 2 physical units, 32 cores, 64 threads, 24 MB Cache) and Intel(R) i7(11700KF (3.6 GHz, 8 cores, 16 threads, 16 MB Cache), demonstrate a significant increase in performance and scalability of the generated parallel tiled code. For the Intel(R) Xeon(R) Gold 6326 and Intel(R) i7, target code speedup increases linearly with an increase in the number of threads. An approach presented in the paper to generate target code can be used by programmers to generate target parallel tiled code for other bioinformatics codes whose dependence patterns are similar to those of the code implementing the counting algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2673-4117
2673-4117
DOI:10.3390/eng4010030