Cache miss analysis of WHT algorithms

MaRDI QIDQ5485336zbMATH OpenFDO

Authors Mihai Furis, Paweł Hitczenko, Jeremy R. Johnson

Publication date 29 August 2006

zbMATH Keywords

cachedivide and conquer recurrencesgeometric distributionsmemory access patternsperformance analysisrandom compositionsWalsh-Hadamard transform

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• scientific article; zbMATH DE number 2127727
• Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
• Cache-oblivious algorithms
• Towards a theory of cache-efficient algorithms
• scientific article; zbMATH DE number 1445384

Cited in

(4)

• High-level cache modeling for 2-D discrete wavelet transform implementations
• Revisiting the Cache Miss Analysis of Multithreaded Algorithms
• CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP
• Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform

This page was built for publication: Cache miss analysis of WHT algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485336)