Cache miss analysis of WHT algorithms

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...

Full description

Bibliographic Details
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:
walsh-hadamard transform
random compositions
performance analysis
cache
divide and conquer recurrences
geometric distributions
memory access patterns
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
[info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
Online Access:https://dmtcs.episciences.org/3363/pdf

Internet

https://dmtcs.episciences.org/3363/pdf

Similar Items