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...
Main Authors: | Mihai Furis, Paweł Hitczenko, Jeremy Johnson |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3363/pdf |
Similar Items
-
Cache efficient simple dynamic programming
by: Cary Cherng, et al.
Published: (2005-01-01) -
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Convex hull for intersections of random lines
by: Daniel Berend, et al.
Published: (2005-01-01) -
Expected values of statistics on permutation tableaux
by: Sylvie Corteel, et al.
Published: (2007-01-01) -
Order statistics and estimating cardinalities of massive data sets
by: Frédéric Giroire
Published: (2005-01-01)