Directive-driven programming models, such as OpenMP, are one solution for exploring the
potential parallelism when targeting multicore architectures. Although these approaches …

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 …

Automatic parallelization of sequential code has become increasingly relevant in multicore
programming. In particular, loop parallelization continues to be a promising optimization …

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 …

We present the source-to-source TRACO compiler allowing for increasing program locality
and parallelizing arbitrarily nested loop sequences in numerical applications. Algorithms for …

This paper focuses on optimizing the Zuker RNA folding algorithm, a bioinformatics task with
non-serial polyadic dynamic programming and non-uniform loop dependencies. The …

In this paper, we present a modified Floyd–Warshall algorithm, where the most time-
consuming part—calculating transitive closure describing self-dependences for each loop …

In this paper the results of parallelizing a block cipher based on a spatiotemporal chaotic
system and a chaotic neural network are presented. A data dependence analysis of loops …

Directive-drive programming models, such as OpenMP, are one solution for exploiting the
potential of multicore architectures, and enable developers to accelerate software …

In this paper, we present results of parallelizing the International Data Encryption Algorithm
(IDEA). The data dependence analysis of loops was applied in order to parallelize this …