Wlodzimierz Bielecki

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