A new code generation algorithm for 2-offset producer order queue computation model

2008 ◽  
Vol 34 (4) ◽  
pp. 184-194 ◽  
Author(s):  
Arquimedes Canedo ◽  
Ben Abderazek ◽  
Masahiro Sowa
Keyword(s):  
Code Generation ◽  
Computation Model ◽  
Generation Algorithm

GENERALISING THE UNIMODULAR APPROACH TO RESTRUCTURE IMPERFECTLY NESTED LOOPS

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.

Sign in / Sign up

Export Citation Format

Share Document