DYNAMIC TILE FREE SCHEDULING FOR CODE WITH ACYCLIC INTER-TILE DEPENDENCE GRAPHS | Zendy

Włodzimierz Bielecki | Zendy; Piotr Skotnicki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

DYNAMIC TILE FREE SCHEDULING FOR CODE WITH ACYCLIC INTER-TILE DEPENDENCE GRAPHS

Author(s) -

Włodzimierz Bielecki,

Piotr Skotnicki

Publication year - 2017

Publication title -

computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.145

H-Index - 5

eISSN - 2300-7036

pISSN - 1508-2806

DOI - 10.7494/csci.2017.18.2.195

Subject(s) - computer science , tile , parallel computing , suite , scheduling (production processes) , benchmark (surveying) , operand , code (set theory) , subroutine , affine transformation , algorithm , mathematical optimization , programming language , operating system , mathematics , art , archaeology , geodesy , set (abstract data type) , visual arts , history , geography , pure mathematics

Free scheduling is a task ordering technique under which instructions are executed as soon as their operands become available. Coarsening the grain of computations under the free schedule, by means of using groups of loop nest statement instances (tiles) in place of single statement instances, increases the locality of data accesses and reduces the number of synchronization events, and as a consequence improves program performance. The paper presents an approach for code generation allowing for the free schedule for tiles of arbitrarily nested affine loops at run-time. The scope of the applicability of the introduced algorithms is limited to tiled loop nests whose inter-tile dependence graphs are cycle-free. The approach is based on the Polyhedral Model. Results of experiments with the PolyBench benchmark suite, demonstrating significant tiled code speed-up, are discussed.

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