Recursive Implementation of High Performance Numerical Algebra Library

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A00114523" target="_blank" >RIV/68407700:21230/06:00114523 - isvavai.cz</a>
Result on the web
<a href="http://shimi.webzdarma.cz/vyzkum/workshop06/Recursive_workshop.doc" target="_blank" >http://shimi.webzdarma.cz/vyzkum/workshop06/Recursive_workshop.doc</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Recursive Implementation of High Performance Numerical Algebra Library
Original language description
For a good performance of every computer program, the efficient cache utilization is crucial. In numerical algebra libraries (such as BLAS or LAPACK) is the good cache utilization achieved by the explicit loop restructuring. It includes loop unrolling-and-jam which increase the FPU pipeline utilization in the innermost loop, loop blocking (that is why we called these codes shortly blocked) and loop interchange to maximize the a cache hit ratio. After application of these transformations, these codes aredivided into two parts. Outer loops are "out-cache", inner loops are "in-cache". Codes have almost the same performance independently on the amount of data, but all these code transformations require the difficult cache behavior analysis. In this paper,we represent the recursive implementation of some routines from the numerical algebra library. This implementation leads to cache-sensitive codes due to the "natural" partition of data without need to analyze the cache behavior.
Czech name
—
Czech description
—

Project
<a href="/en/project/IBS3086102" target="_blank" >IBS3086102: Parallel Algorithms for Large Scale Simulation on PC Clusters</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)