Cache miss analysis of WHT algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Cache miss analysis of WHT algorithms


On modern computers memory access patterns and cache utilization are as important, if not more important, than operation count in obtaining high-performance implementations of algorithms. In this work, the memory behavior of a large family of algorithms for computing the Walsh-Hadamard transform, an important signal processing transform related to the fast Fourier transform, is investigated. Empirical evidence shows that the family of algorithms exhibit a wide range of performance, despite the fact that all algorithms perform the same number of arithmetic operations. Different algorithms, while having the same number of memory operations, access memory in different patterns and consequently have different numbers of cache misses. A recurrence relation is derived for the number of cache misses and is used to determine the distribution of cache misses over the space of WHT algorithms.
Fichier principal
Vignette du fichier
dmAD0111.pdf (126.17 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184035 , version 1 (12-08-2015)



Mihai Furis, Paweł Hitczenko, Jeremy Johnson. Cache miss analysis of WHT algorithms. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.115-124, ⟨10.46298/dmtcs.3363⟩. ⟨hal-01184035⟩


66 View
488 Download



Gmail Facebook Twitter LinkedIn More