TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications

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

10.15439/2015f34 ◽

2015 ◽

Cited By ~ 5

Author(s):

Marek Palkowski ◽

Tomasz Klimek ◽

Wlodzimierz Bielecki

Keyword(s):

Loop Nest

Download Full-text

Loop Nest Splitting

Source Code Optimization Techniques for Data Flow Dominated Embedded Software ◽

10.1007/978-1-4020-2829-8_5 ◽

2004 ◽

pp. 53-117

Author(s):

Heiko Falk ◽

Peter Marwedel

Keyword(s):

Loop Nest

Download Full-text

Loop Nest Tiling for Image Processing and Communication Applications

Hard and Soft Computing for Artificial Intelligence, Multimedia and Security - Advances in Intelligent Systems and Computing ◽

10.1007/978-3-319-48429-7_28 ◽

2016 ◽

pp. 305-314

Author(s):

Wlodzimierz Bielecki ◽

Marek Palkowski

Keyword(s):

Image Processing ◽

Loop Nest

Download Full-text

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

BMC Bioinformatics ◽

10.1186/s12859-019-2785-6 ◽

2019 ◽

Vol 20 (1) ◽

Author(s):

Marek Palkowski ◽

Wlodzimierz Bielecki

Keyword(s):

Rna Folding ◽

Space Time ◽

Loop Nest

Download Full-text

GENERALISING THE UNIMODULAR APPROACH TO RESTRUCTURE IMPERFECTLY NESTED LOOPS

Parallel Processing Letters ◽

10.1142/s0129626496000388 ◽

1996 ◽

Vol 06 (03) ◽

pp. 401-414

Author(s):

Jingling Xue

Keyword(s):

Code Generation ◽

Lexicographic Order ◽

Generation Algorithm ◽

Loop Nest ◽

Loop Nests ◽

Iteration Space ◽

New Concepts ◽

Affine Constraints ◽

Nested Loops ◽

Unimodular Transformations

Although overcoming some limitations of the generate-and-test approach, unimodular transformations are limited to perfect loop nests only. Extending the unimodular approach, this paper describes a framework that enables the use of unimodular transformations to restructure imperfect loop nests. The concepts used previously for perfect loop nests, such as iteration vector, iteration space and lexicographic order, are generalised and some new concepts like preorder tree are introduced. Multiple unimodular transformations are allowed, one each statement in the loop nest. A code generation algorithm is provided that produces a possibly imperfect loop nest to scan an iteration space that is given as a union of sets of affine constraints.

Download Full-text