Cache Misses Analysis by Means of Data Mining Methods

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

Result language
angličtina
Original language name
Cache Misses Analysis by Means of Data Mining Methods
Original language description
It is really difficult to predict the cache behavior even for a simple program because every modern CPU use a complex memory hierarchy, which consists of levels of cache memories. One challenging task is to predict the exact number of cache misses duringthe sparse matrix-vector multiplication. Due to matrix sparsity, the memory access patterns are irregular and the utilization of a cache suffers from low spatial and temporal locality. It is really difficult to predict the cache behavior for all cases of input parameters. The cache misses data were also analyzed by means of data mining methods. This is the main topic of this paper and we will discuss the data mining analysis bellow in the more detailed form.
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)