3D Tiled Code Generation for Nussinov’s Algorithm

• Published in: Applied sciences Vol. 12; no. 12; p. 5898
• Main Authors: Bielecki, Włodzimierz, Błaszyński, Piotr, Pałkowski, Marek
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.06.2022
• Subjects: Algorithms; bioinformatics; Codes; compiler; Dynamic programming; nussinov; RNA; shared memory algorithms; source code generation
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app12125898

Current state-of-the-art parallel codes used to calculate the maximum number of pairs for a given RNA sequence by means of Nussinov’s algorithm do not allow for achieving speedup close up to the number of the processors used for execution of those codes on multi-core computers. This is due to the fact that known codes do not make full use of and derive benefit from cache memory of such computers. There is a need to develop new approaches allowing for increasing cache exploitation in multi-core computers. One of such possibilities is increasing the dimension of tiles in generated target tiled code and assuring a similar size of generated tiles. The article presents an approach allowing us to produce 3D parallel code with tiling calculating Nussinov’s RNA folding, i.e., code with the maximal tile dimension possible for the loop nest, executing Nussinov’s algorithm. The approach guarantees that generated tiles are of a similar size. The code generated with the presented approach is characterized by increased code locality and outperforms all closely related ones examined by us. This allows us to considerably reduce execution time required for computing the maximum number of pairs of any nested structure for larger RNA sequences by means of Nussinov’s algorithm.