Repository logo

Browsing by Subject "data locality"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Dynamic tile free scheduling for code with acyclic inter-tile dependence graphs
    (Wydawnictwa AGH, 2017) Bielecki, Włodzimierz; Skotnicki, Piotr
    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 that allows 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.
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Hardware-aware tiling optimization for multi-core systems
    (Wydawnictwa AGH, 2017) Adamski, Dominik; Jabłoński, Grzegorz
    This paper presents a proposal for a new tool that improves tiling efficiency for a given hardware architecture. This article also describes the correlation between the changing hardware architecture and methods of software optimization. The first chapter includes a short description of the change in hardware architecture that has occurred over the past ten years. The second chapter provides an overview of the tools that will be used in further research. The subsequent sections contain a description of the proposed hardware-aware tool for optimal tiling.