Wlodzimierz Bielecki

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 35

Top Topics

Energy Efficient

Code Generation

Transitive Closure

Rna Secondary Structure Prediction

Top Venues

Publications

Wlodzimierz Bielecki, Marek Palkowski, Piotr Blaszynski, Maciej Poliwoda
Polyhedral Tiling Strategies for the Zuker Algorithm Optimization. FedCSIS (Communication Papers) (2023)
Marek Palkowski, Wlodzimierz Bielecki
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers. Parallel Comput. 116 (2023)
Wlodzimierz Bielecki, Marek Palkowski, Maciej Poliwoda
Automatic code optimization for computing the McCaskill partition functions. FedCSIS (2022)
Marek Palkowski, Wlodzimierz Bielecki
NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation. PPAM (2) (2022)
Wlodzimierz Bielecki, Piotr Blaszynski, Maciej Poliwoda
3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm. J. Comput. Sci. 48 (2021)
Wlodzimierz Bielecki, Maciej Poliwoda
Automatic Parallel Tiled Code Generation Based on Dependence Approximation. PaCT (2021)
Marek Palkowski, Wlodzimierz Bielecki
Parallel tiled cache and energy efficient codes for O(n4) RNA folding algorithms. J. Parallel Distributed Comput. 137 (2020)
Marek Palkowski, Wlodzimierz Bielecki, Mateusz Gruzewski
Automatic Generation of Parallel Cache-Efficient Code Implementing Zuker's RNA Folding. ICAISC (1) (2020)
Marek Palkowski, Wlodzimierz Bielecki
Parallel cache-efficient code for computing the McCaskill partition functions. FedCSIS (2019)
Marek Palkowski, Wlodzimierz Bielecki
Parallel Tiled Cache and Energy Efficient Code for Zuker's RNA Folding. PPAM (2) (2019)
Wlodzimierz Bielecki, Piotr Skotnicki
Insight into tiles generated by means of a correction technique. J. Supercomput. 75 (5) (2019)
Marek Palkowski, Wlodzimierz Bielecki
Tiling Nussinov's RNA folding loop nest with a space-time approach. BMC Bioinform. 20 (1) (2019)
Marek Palkowski, Wlodzimierz Bielecki
Tuning iteration space slicing based tiled multi-core code implementing Nussinov's RNA folding. BMC Bioinform. 19 (1) (2018)
Marek Palkowski, Wlodzimierz Bielecki
Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences. J. Comput. Biol. 25 (10) (2018)
Wlodzimierz Bielecki, Marek Palkowski, Piotr Skotnicki
Generation of parallel synchronization-free tiled code. Computing 100 (3) (2018)
Marek Palkowski, Wlodzimierz Bielecki
Accelerating Minimum Cost Polygon Triangulation Code with the TRACO Compiler. FedCSIS (Communication Papers) (2018)
Wlodzimierz Bielecki, Marek Palkowski
Transitive Closure Based Schedule of Loop Nest Statement Instances. ACS (2018)
Marek Palkowski, Krzysztof Siedlecki, Wlodzimierz Bielecki
Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment. ICAISC (2) (2018)
Marek Palkowski, Wlodzimierz Bielecki
Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs. FedCSIS (2017)
Marek Palkowski, Wlodzimierz Bielecki
Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing. BMC Bioinform. 18 (1) (2017)
Marek Palkowski, Wlodzimierz Bielecki, Piotr Skotnicki
Improving Data Locality of RNA Secondary Structure Prediction Code. ICAISC (1) (2017)
Marek Palkowski, Wlodzimierz Bielecki
A Practical Approach to Tiling Zuker's RNA Folding Using the Transitive Closure of Loop Dependence Graphs. ISAT (2) (2017)
Wlodzimierz Bielecki, Piotr Skotnicki
Dynamic Tile Free Scheduling for Code with Acyclic Inter-Tile Dependence Graphs. Comput. Sci. 18 (2) (2017)
Marek Palkowski, Wlodzimierz Bielecki
Parallel Tiled Code Generation with Loop Permutation within Tiles. Comput. Informatics 36 (6) (2017)
Wlodzimierz Bielecki, Marek Palkowski
Loop Nest Tiling for Image Processing and Communication Applications. ACS (2016)
Wlodzimierz Bielecki, Piotr Skotnicki
Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph. ACS (2016)
Wlodzimierz Bielecki, Marek Palkowski
Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs. Int. J. Appl. Math. Comput. Sci. 26 (4) (2016)
Agnieszka Kaminska, Wlodzimierz Bielecki
Statistical models to accelerate software development by means of iterative compilation. Comput. Sci. 17 (3) (2016)
Tomasz Klimek, Marek Palkowski, Wlodzimierz Bielecki
Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops. SBAC-PAD (Workshops) (2016)
Marek Palkowski, Wlodzimierz Bielecki
TRACO: Source-to-Source Parallelizing Compiler. Comput. Informatics 35 (6) (2016)
Marek Palkowski, Wlodzimierz Bielecki
An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming. FedCSIS (2016)
Marek Palkowski, Tomasz Klimek, Wlodzimierz Bielecki
TRACO: An automatic loop nest parallelizer for numerical applications. FedCSIS (2015)
Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek
Using basis dependence distance vectors in the modified Floyd-Warshall algorithm. J. Comb. Optim. 30 (2) (2015)
Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek
Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs. PPAM (2) (2015)
Marek Palkowski, Wlodzimierz Bielecki
Using an Artificial Neural Network to Predict Loop Transformation Time. ICAISC (1) (2015)
Wlodzimierz Bielecki, Marek Palkowski
Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph. ACS (2014)
Marek Palkowski, Wlodzimierz Bielecki
Usage of the TRACO Compiler for Neural Network Parallelization. ICAISC (1) (2014)
Marek Palkowski, Wlodzimierz Bielecki
TRACO Parallelizing Compiler. ACS (2014)
Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm. COCOA (2013)
Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek
Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops. PaCT (2013)
Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parametrized Affine Integer Tuple Relations. Discret. Math. Algorithms Appl. 4 (1) (2012)
Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek
Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput. 38 (9) (2012)
Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations. Parallel Comput. 37 (8) (2011)
Wlodzimierz Bielecki, Krzysztof Kraska
Extracting Coarse-Grained Parallelism for Affine Perfectly Nested Quasi-uniform Loops. PPAM (1) (2011)
Wlodzimierz Bielecki, Marek Palkowski
Using Free Scheduling for Programming Graphic Cards. Facing the Multicore-Challenge (2011)
Wlodzimierz Bielecki, Marek Palkowski
Coarse-Grained Loop Parallelization for Image Processing and Communication Applications. IP&C (2010)
Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations. COCOA (1) (2010)
Wlodzimierz Bielecki, Tomasz Klimek, Konrad Trifunovic
Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation. Electron. Notes Discret. Math. 33 (2009)
Wlodzimierz Bielecki, Marek Palkowski
Extracting Both Affine and Non-linear Synchronization-Free Slices in Program Loops. PPAM (1) (2009)
Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations. ISPDC (2009)
Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing. LCPC (2009)
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, Albert Cohen
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations. COCOA (2009)
Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. ICCSA (2) (2008)
Wlodzimierz Bielecki, Marek Palkowski
Using Message Passing for Developing Coarse-Grained Applications in OpenMP. ICSOFT (PL/DPS/KE) (2008)
Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. ICA3PP (2008)
Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. ISPDC (2007)
Piotr Dziurzanski, Wlodzimierz Bielecki, Konrad Trifunovic, M. Kleszczonek
A System for Transforming an ANSI C Code with OpenMP Directives into a SystemC Description. DDECS (2006)
Wlodzimierz Bielecki, Rafal Kocisz
A Modified Vertex Method for Parallelization of Arbitrary Nested Loops. PARELEC (2004)