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.
W artykule podjęto próbę usystematyzowania pojęć (terminów): komunikacja i transport, uściślając ich definicje. Są to pojęcia niejednokrotnie błędnie interpretowane i sprzeczne z innymi ustaleniami w tym zakresie.