A novel approach to generation of tiled code for arbitrarily nested loops is presented. It is
derived via a combination of the polyhedral and iteration space slicing frameworks. Instead …

Background RNA secondary structure prediction is a compute intensive task that lies at the
core of several search algorithms in bioinformatics. Fortunately, the RNA folding …

Polyhedral compilation techniques have proven to be a powerful tool for optimization of
dense array codes. In particular, their ability to tile imperfectly nested loops has provided …

Designing automatic optimizing compilers is an advanced engineering process requiring a
great deal of expertise, programming, testing, and experimentation. Maintaining the …

In this article, we analyze the program codes generated automatically using three advanced
optimizers: Pluto, Traco, and Dapt, which are specifically tailored for the NPDP benchmark …

The paper presents a benchmark suite of ten non-serial polyadic dynamic programming
(NPDP) kernels, which are designed to test the efficiency of tiled code generated by …

Background An RNA primary structure, or sequence, is a single strand considered as a
chain of nucleotides from the alphabet AUGC (adenine, uracil, guanine, cytosine). The …

Background RNA folding is an ongoing compute-intensive task of bioinformatics.
Parallelization and improving code locality for this kind of algorithms is one of the most …

This paper presents an approach to generation of 3D parallel tiled code implementing an
optimal binary search tree (OBST) algorithm. We demonstrate that the features of data …

The two-volume set LNAI 12854 and 12855 constitutes the refereed proceedings of the 20th
International Conference on Artificial Intelligence and Soft Computing, ICAISC 2021, held in …