Toward Modeling Cache-Miss Ratio for Dense-Data-Access-Based Optimization - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Toward Modeling Cache-Miss Ratio for Dense-Data-Access-Based Optimization

(1) , (1) , (2)
1
2

Abstract

Adapting a source code to the specificity of its host hardware represents one way to implement software optimization. This allows to benefit from processors that are primarily designed to improve system performance. To reach such a software/hard-ware fitting without narrowing the scope of the optimization to few executions, one needs to have at his disposal relevant performance models of the considered hardware. This paper proposes a new method to optimize software kernels by considering their data-access mode. The proposed method permits to build a data-cache-miss model of a given application regarding its specific memory-access pattern. We apply our method in order to evaluate some custom implementations of matrix data layouts. To validate the functional correctness of the generated models, we propose a reference algorithm that simulates a ker-nel's exploration of its data. Experimental results show that the proposed data alignment permits to reduce the number of cache misses by a factor up to 50%, and to decrease the execution time by up to 30%. Finally, we show the necessity to integrate the impact of the Translation Lookaside Buffers (TLB) and the memory prefetcher within our performance models.
Fichier principal
Vignette du fichier
main.pdf (842.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-02284183 , version 1 (11-09-2019)

Identifiers

Cite

Riyane Sid Lakhdar, Henri-Pierre Charles, Maha Kooli. Toward Modeling Cache-Miss Ratio for Dense-Data-Access-Based Optimization. 30th International Workshop on Rapid System Prototyping (RSP’19), ACM; IEEE, Oct 2019, New-York, United States. ⟨10.1145/3339985.3358498⟩. ⟨cea-02284183⟩
107 View
220 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More