Finding legal reordering transformations using mappings | Zendy

Wayne Kelly | Zendy; William Pugh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Finding legal reordering transformations using mappings

Author(s) -

Wayne Kelly,

William Pugh

Publication year - 1995

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-58868-X

DOI - 10.1007/bfb0025874

Subject(s) - computer science , sequence (biology) , transformation (genetics) , compiler , set (abstract data type) , loop (graph theory) , theoretical computer science , code (set theory) , program transformation , space (punctuation) , tree (set theory) , algorithm , programming language , mathematics , biology , mathematical analysis , biochemistry , chemistry , genetics , combinatorics , gene , operating system

Traditionally, optimizing compilers attempt to improve the performance of programs by applying source tosource transformations, such as loop interchange, loop skewing and loop distribution. Each of these transformationshas its own special legality checks and transformation rules which make it hard to analyze or predict theeffects of compositions of these transformations. To overcome these problems we have developed a framework forunifying iteration reordering transformations. The...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research