Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: optymalizacja kompilatora

Sortuj według:

Ogranicz wyniki do:

Dynamic tiling optimization for Polly compiler

Adamski D., Szydłowski M., Jabłoński G., Lasoń J.

International Journal of Microelectronics and Computer Science

2017

Vol. 8, nr 4

150--154

This article presents dynamic tiling optimization for Polly compiler. It describes heuristic technique which can be applied to increase efficiency of tiling optimization. Proposed solution is based on open-source tools (LLVM and Polly compiler) and it proves that dynamic tiling optimization can be achieved by extraction code of tiled loop into seperate function. The compiler can generate multiple versions of the optimzed functions. Each of them is optimized by different tile size. The runtime decides during program’s execution which optimized version of the given function is the most appropriate.

Obliczeniowe szacowanie lokalności danych na poziomie pamięci podręcznej

Kamińska A., Bielecki W.

Metody Informatyki Stosowanej

2011

nr 4

33-44

In order to effectively use cache memory, it is essential to ensure good data locality at the cache memory level. This can be achieved by appropriately transforming the source code of a program to a semantically equivalent form. The problem is, however, how – based only on the form of the source code of a program – to assess the data locality it involves and apply this assessment for selection of the source code of the shortest execution time. The paper presents Wolfe’s method of estimating data locality and - using the matrix multiplication problem for reference – discusses the possibilities of applying Wolfe’s method for the purpose of estimating the program execution time. The paper also presents software prepared by the authors and dedicated for estimating data locality.