W
Wlodzimierz Bielecki
Researcher at West Pomeranian University of Technology
Publications - 71
Citations - 411
Wlodzimierz Bielecki is an academic researcher from West Pomeranian University of Technology. The author has contributed to research in topics: Transitive closure & Compiler. The author has an hindex of 12, co-authored 66 publications receiving 369 citations. Previous affiliations of Wlodzimierz Bielecki include University of Szczecin & Szczecin University of Technology.
Papers
More filters
Journal ArticleDOI
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations
TL;DR: Experimental results show that by means of Iteration SpaceSlicing algorithms, it is able to extract coarse-grained parallelism for most loops of the NAS and UTDSP benchmarks, and that there is a strong need in devising advanced algorithms for calculating the exact transitive closure of dependence relations in order to increase the applicability of that framework.
Journal ArticleDOI
Tiling arbitrarily nested loops by means of the transitive
TL;DR: The main merit of the presented approach in comparison with the well-known ones is that it does not require full permutability of loops to generate both serial and parallel tiled codes; this increases the scope of loop nests to be tiled.
Book ChapterDOI
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
TL;DR: This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples by introducing a novel sufficient and necessary condition defining a class of relations for which an exact computation is possible.
Journal ArticleDOI
Free scheduling for statement instances of parameterized arbitrarily nested affine loops
TL;DR: An approach permitting us to build free scheduling for statement instances of affine loops by calculating the power k of a relation representing exactly all dependences in a loop to demonstrate that if the authors are able to calculate the powerk of a dependence relation describing all dependence in the loop, then it is able also to produce free scheduling.
Journal ArticleDOI
Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing.
TL;DR: A novel approach allowing for generation of a parallel tiled Nussinov RNA loop nest exposing significantly higher performance than that of known related code and is implemented as a part of the publicly available polyhedral source-to-source TRACO compiler.