Wlodzimierz Bielecki

According to our database, Wlodzimierz Bielecki authored at least 60 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers.

Marek Palkowski, Wlodzimierz Bielecki

Parallel Comput., 2023

Polyhedral Tiling Strategies for the Zuker Algorithm Optimization.

Wlodzimierz Bielecki, Marek Palkowski, Piotr Blaszynski, Maciej Poliwoda

Proceedings of the Communication Papers of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022

NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Parallel Processing and Applied Mathematics, 2022

Automatic code optimization for computing the McCaskill partition functions.

Wlodzimierz Bielecki, Marek Palkowski, Maciej Poliwoda

Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022

2021

3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm.

Wlodzimierz Bielecki, Piotr Blaszynski, Maciej Poliwoda

J. Comput. Sci., 2021

Automatic Parallel Tiled Code Generation Based on Dependence Approximation.

Wlodzimierz Bielecki, Maciej Poliwoda

Proceedings of the Parallel Computing Technologies, 2021

2020

Parallel tiled cache and energy efficient codes for O(n4) RNA folding algorithms.

Marek Palkowski, Wlodzimierz Bielecki

J. Parallel Distributed Comput., 2020

Automatic Generation of Parallel Cache-Efficient Code Implementing Zuker's RNA Folding.

Marek Palkowski, Wlodzimierz Bielecki, Mateusz Gruzewski

Proceedings of the Artificial Intelligence and Soft Computing, 2020

2019

Insight into tiles generated by means of a correction technique.

Wlodzimierz Bielecki, Piotr Skotnicki

J. Supercomput., 2019

Tiling Nussinov's RNA folding loop nest with a space-time approach.

Marek Palkowski, Wlodzimierz Bielecki

BMC Bioinform., 2019

Parallel Tiled Cache and Energy Efficient Code for Zuker's RNA Folding.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Parallel Processing and Applied Mathematics, 2019

Parallel cache-efficient code for computing the McCaskill partition functions.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

2018

Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences.

Marek Palkowski, Wlodzimierz Bielecki

J. Comput. Biol., 2018

Generation of parallel synchronization-free tiled code.

Wlodzimierz Bielecki, Marek Palkowski, Piotr Skotnicki

Computing, 2018

Tuning iteration space slicing based tiled multi-core code implementing Nussinov's RNA folding.

Marek Palkowski, Wlodzimierz Bielecki

BMC Bioinform., 2018

Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment.

Marek Palkowski, Krzysztof Siedlecki, Wlodzimierz Bielecki

Proceedings of the Artificial Intelligence and Soft Computing, 2018

Accelerating Minimum Cost Polygon Triangulation Code with the TRACO Compiler.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Communication Papers of the 2018 Federated Conference on Computer Science and Information Systems, 2018

Transitive Closure Based Schedule of Loop Nest Statement Instances.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the Advances in Soft and Hard Computing, 2018

2017

Parallel Tiled Code Generation with Loop Permutation within Tiles.

Marek Palkowski, Wlodzimierz Bielecki

Comput. Informatics, 2017

Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing.

Marek Palkowski, Wlodzimierz Bielecki

BMC Bioinform., 2017

Dynamic Tile Free Scheduling for Code with Acyclic Inter-Tile Dependence Graphs.

Wlodzimierz Bielecki, Piotr Skotnicki

Comput. Sci., 2017

A Practical Approach to Tiling Zuker's RNA Folding Using the Transitive Closure of Loop Dependence Graphs.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Information Systems Architecture and Technology: Proceedings of 38th International Conference on Information Systems Architecture and Technology - ISAT 2017, 2017

Improving Data Locality of RNA Secondary Structure Prediction Code.

Marek Palkowski, Wlodzimierz Bielecki, Piotr Skotnicki

Proceedings of the Artificial Intelligence and Soft Computing, 2017

Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016

TRACO: Source-to-Source Parallelizing Compiler.

Marek Palkowski, Wlodzimierz Bielecki

Comput. Informatics, 2016

Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs.

Wlodzimierz Bielecki, Marek Palkowski

Int. J. Appl. Math. Comput. Sci., 2016

Statistical models to accelerate software development by means of iterative compilation.

Agnieszka Kaminska, Wlodzimierz Bielecki

Comput. Sci., 2016

Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops.

Tomasz Klimek, Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the 2016 International Symposium on Computer Architecture and High Performance Computing Workshops, 2016

An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph.

Wlodzimierz Bielecki, Piotr Skotnicki

Proceedings of the Hard and Soft Computing for Artificial Intelligence, 2016

Loop Nest Tiling for Image Processing and Communication Applications.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the Hard and Soft Computing for Artificial Intelligence, 2016

2015

Using basis dependence distance vectors in the modified Floyd-Warshall algorithm.

Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek

J. Comb. Optim., 2015

Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs.

Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek

Proceedings of the Parallel Processing and Applied Mathematics, 2015

Using an Artificial Neural Network to Predict Loop Transformation Time.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Artificial Intelligence and Soft Computing, 2015

TRACO: An automatic loop nest parallelizer for numerical applications.

Marek Palkowski, Tomasz Klimek, Wlodzimierz Bielecki

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

2014

Usage of the TRACO Compiler for Neural Network Parallelization.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Artificial Intelligence and Soft Computing, 2014

TRACO Parallelizing Compiler.

Marek Palkowski, Wlodzimierz Bielecki

Proceedings of the Soft Computing in Computer and Information Science, 2014

Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the Soft Computing in Computer and Information Science, 2014

2013

Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops.

Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek

Proceedings of the Parallel Computing Technologies - 12th International Conference, 2013

Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm.

Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Free scheduling for statement instances of parameterized arbitrarily nested affine loops.

Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek

Parallel Comput., 2012

An Iterative Algorithm of Computing the Transitive Closure of a Union of Parametrized Affine Integer Tuple Relations.

Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska

Discret. Math. Algorithms Appl., 2012

2011

Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations.

Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki

Parallel Comput., 2011

Extracting Coarse-Grained Parallelism for Affine Perfectly Nested Quasi-uniform Loops.

Wlodzimierz Bielecki, Krzysztof Kraska

Proceedings of the Parallel Processing and Applied Mathematics, 2011

Using Free Scheduling for Programming Graphic Cards.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the Facing the Multicore - Challenge II, 2011

2010

Coarse-Grained Loop Parallelization for Image Processing and Communication Applications.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the Image Processing and Communications Challenges 2, 2010

An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations.

Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation.

Wlodzimierz Bielecki, Tomasz Klimek, Konrad Trifunovic

Electron. Notes Discret. Math., 2009

Extracting Both Affine and Non-linear Synchronization-Free Slices in Program Loops.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the Parallel Processing and Applied Mathematics, 2009

Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing.

Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski

Proceedings of the Languages and Compilers for Parallel Computing, 2009

Computing the Transitive Closure of a Union of Affine Integer Tuple Relations.

Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, Albert Cohen

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Using Message Passing for Developing Coarse-Grained Applications in OpenMP.

Wlodzimierz Bielecki, Marek Palkowski

Proceedings of the ICSOFT 2008, 2008

Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops.

Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro

Proceedings of the Computational Science and Its Applications - ICCSA 2008, International Conference, Perugia, Italy, June 30, 2008

Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations.

Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro

Proceedings of the Algorithms and Architectures for Parallel Processing, 2008

2007

Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework.

Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro

Proceedings of the 6th International Symposium on Parallel and Distributed Computing (ISPDC 2007), 2007

Hyperplane Method Implementation for Loops Parallelization in the .NET Environment.

Wlodzimierz Bielecki, Maciej Poliwoda

Proceedings of the Advances in Information Processing and Protection., 2007

Parallelization Method of Encryption Algorithms.

Wlodzimierz Bielecki, Dariusz Burak

Proceedings of the Advances in Information Processing and Protection., 2007

2006

A System for Transforming an ANSI C Code with OpenMP Directives into a SystemC Description.

Piotr Dziurzanski, Wlodzimierz Bielecki, Konrad Trifunovic, M. Kleszczonek

Proceedings of the 9th IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS 2006), 2006

Parallelization of Standard Modes of Operation for Symmetric Key Block Ciphers.

Wlodzimierz Bielecki, Dariusz Burak

Proceedings of the Biometrics, 2006

2004

A Modified Vertex Method for Parallelization of Arbitrary Nested Loops.

Wlodzimierz Bielecki, Rafal Kocisz

Proceedings of the 2004 International Conference on Parallel Computing in Electrical Engineering (PARELEC 2004), 2004