TRACO   an automatic parallelizing and optimizing compiler

based on the transitive closure of dependence graphs

2018

Marek Palkowski, Wlodzimierz Bielecki: Parallel tiled codes implementing the Smith-Waterman alignment algorithm for two and three sequences Journal of Computational Biology, accepted

Marek Palkowski, Wlodzimierz Bielecki: Tuning iteration space slicing based tiled multi-core code implementing Nussinov’s RNA folding. BMC Bioinformatics 19:12 (2018) Online   

Marek Palkowski, Krzysztof Siedlecki, Wlodzimierz Bielecki: Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment ICAISC 2018, LNAI 10842, to appear

2017

Marek Palkowski, Wlodzimierz Bielecki: Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing. BMC Bioinformatics 18(1): 290 (2017) Online   TRACO demonstration

Wlodzimierz Bielecki, Marek Palkowski, Piotr Skotnicki: Generation of parallel synchronization-free tiled code, Computing, doi=10.1007/s00607-017-0576-3, pp.1-26. Read more

Marek Palkowski, Wlodzimierz Bielecki: Parallel Tiled Code Generation with Loop Permutation within Tiles, Computing and Informatics, 36(6): 1261-1282 (2017).

Marek Palkowski, Wlodzimierz Bielecki: Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs. FedCSIS 2017, Prague, Czech Republic, 523-526

Marek Palkowski, Wlodzimierz Bielecki, Piotr Skotnicki: Improving Data Locality of RNA Secondary Structure Prediction Code. ICAISC (1) 2017: 690-699

Marek Palkowski, Wlodzimierz Bielecki: A Practical Approach to Tiling Zuker's RNA Folding Using the Transitive Closure of Loop Dependence Graphs. ISAT (2) 2017: 200-209

Włodzimierz Bielecki, Pałkowski Marek Loop Nest Tiling for Image Processing and Communication Applications ACS 2016: Hard and Soft Computing for Artificial Intelligence, Multimedia and Security pp 305-314

2016

Wlodzimierz Bielecki, Marek Palkowski, Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs, AMCS : International Journal of Applied Mathematics and Computer Science, Vol. 26, No. 4, pp. 919-939, 2016. Online

Marek Palkowski, Wlodzimierz Bielecki: TRACO: Source-to-Source Parallelizing Compiler. Computing and Informatics 35(6): 1277-1306 (2016)

Marek Palkowski, Wlodzimierz Bielecki: An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming. FedCSIS 2016: 705-708

Marek Palkowski: Finding Free Schedules for RNA Secondary Structure Prediction. ICAISC (2) 2016: 179-188

Tomasz Klimek, Marek Palkowski, Wlodzimierz Bielecki: Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops. SBAC-PAD Workshops 2016, Los Angeles, USA, 43-48.

2015

Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek: Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs. PPAM (2) 2015: 133-142

Marek Palkowski, Tomasz Klimek, Wlodzimierz Bielecki: TRACO: An automatic loop nest parallelizer for numerical applications. FedCSIS 2015: 681-686

Marek Palkowski, Wlodzimierz Bielecki: Using an Artificial Neural Network to Predict Loop Transformation Time. ICAISC (1) 2015: 102-111

Marek Pałkowski, Włodzimierz Bielecki Traco Parallelizing Compiler Compiler Soft Computing in Computer and Information Science vol. 342, 409-421. ACS 2015.

Wlodzimierz Bielecki, Marek Palkowski Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph Compiler Soft Computing in Computer and Information Science vol. 342, 309-320. ACS 2015.

2014

Marek Palkowski, Wlodzimierz Bielecki: Usage of the TRACO Compiler for Neural Network Parallelization. ICAISC (1) 2014: 121-130

2013

Marek Palkowski, Impact of Variable Privatization on Extracting Synchronization-Free Slices, Facing the Multicore-Challenge III, Stuttgart, Germany, Volume 7686 of the series Lecture Notes in Computer Science pp 72-83, LNCS 2013.


2012

Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek, Free scheduling for statement instances of parameterized arbitrarily nested affine loops, Parallel Computing, Volume 38 Issue 9, September, 2012, Pages 518-532.

Wlodzimierz Bielecki, Marek Palkowski, Using Free Scheduling for Programming Graphic Cards, Facing the Multicore - Challenge II, Lecture Notes in Computer Science Volume 7174, 2012, pp 72-83

Marek Palkowski, Automatic Privatization for Parallel Execution of Loops, Artificial Intelligence and Soft Computing - 11th International Conference, ICAISC 2012, Zakopane, Poland, April 29-May 3, 2012, Proceedings, Part II. Lecture Notes in Computer Science 7268, 395-403, Springer 2012,

Włodzimierz Bielecki, Marek Pałkowski, Programming NVIDIA cards by means of transitive closure based parallelization algorithms, Electrical Review, 2012-10b, 217-222.

2011

Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki: Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations. Parallel Computing 37(8): 479-497 (2011)

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: 104-113

Wlodzimierz Bielecki, Marek Palkowski, Coarse-Grained Loop Parallelization for Image Processing and Communication Applications, Image Processing and Communications Challenges 2, Advances in Intelligent and Soft Computing Volume 84, 2010, pp 307-314

2009

Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki: Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations. ISPDC 2009: 73-80

Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski: Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing. LCPC 2009: 233-246

Wlodzimierz Bielecki, Marek Palkowski: Extracting Both Affine and Non-linear Synchronization-Free Slices in Program Loops. PPAM (1) 2009: 196-205

2008

Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro: Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. ICA3PP 2008: 185-195

Wlodzimierz Bielecki, Marek Palkowski: Using Message Passing for Developing Coarse-Grained Applications in OpenMP. ICSOFT (PL/DPS/KE) 2008: 145-152