Není k dispozici

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03099631" target="_blank" >RIV/68407700:21230/04:03099631 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants

Popis výsledku v původním jazyce

In this paper, we apply several transformations to Cholesky factorization and describe a new transformation called {em dynamic loop reversal} which can increase temporal and spatial locality. We also describe a probabilistic analytical model of the cache behavior during the standard and recursive Cholesky factorization and use it for studying effects of these transformations. Automatic methods for predicting the cache behavior have been described in the literature, but they are inaccurate in case of recursive calls, since they do not take into account the interactions between subroutines. Our model is more accurate, since it takes most of the interactions, namely on the last level of recursion, into account. We have evaluated the accuracy of the modelby measurements on a cache monitor. The comparisons of the numbers of measured cache misses and the numbers of cache misses estimated by the model indicate that the accuracy of the model is within the range on units of percents.

Název v anglickém jazyce

Analytical Model for Analysis of Cache Behavior during Cholesky Factorization and Its Variants

Popis výsledku anglicky

In this paper, we apply several transformations to Cholesky factorization and describe a new transformation called {em dynamic loop reversal} which can increase temporal and spatial locality. We also describe a probabilistic analytical model of the cache behavior during the standard and recursive Cholesky factorization and use it for studying effects of these transformations. Automatic methods for predicting the cache behavior have been described in the literature, but they are inaccurate in case of recursive calls, since they do not take into account the interactions between subroutines. Our model is more accurate, since it takes most of the interactions, namely on the last level of recursion, into account. We have evaluated the accuracy of the modelby measurements on a cache monitor. The comparisons of the numbers of measured cache misses and the numbers of cache misses estimated by the model indicate that the accuracy of the model is within the range on units of percents.

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

<a href="/cs/project/IBS3086102" target="_blank" >IBS3086102: Paralelní algoritmy pro rozsáhlé simulace na svazcích (klastrech) PC</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2004

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the 2004 International Conference on Parallel Processing Workshops

ISBN

0-7695-2198-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

190-197

Název nakladatele

IEEE Computer Society Press

Místo vydání

Los Alamitos

Místo konání akce

Montreal, Quebec

Datum konání akce

15. 8. 2004

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—