A comparison of cache aware and cache oblivious static search trees using program instrumentation

Authors:
Richard E. Ladner;Ray Fortna;Bao-Hoang Nguyen
Affiliations:
Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA;Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA;Department of Computer Science & Engineering, University of Washington, Box 352350, Seattle, WA
Venue:
Experimental algorithmics
Year:
2002

Citing 10
Cited 10

ATOM: a system for building customized program analysis tools

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
The influence of caches on the performance of heaps

Journal of Experimental Algorithmics (JEA)
The influence of caches on the performance of sorting

Journal of Algorithms
Towards a theory of cache-efficient algorithms

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A locality-preserving cache-oblivious dynamic dictionary

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache Conscious Indexing for Decision-Support in Main Memory

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Instrumentation and optimization of Win32/intel executables using Etch

NT'97 Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997

A locality-preserving cache-oblivious dynamic dictionary

Journal of Algorithms
Concurrent cache-oblivious b-trees

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Cache-oblivious nested-loop joins

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Engineering a cache-oblivious sorting algorithm

Journal of Experimental Algorithmics (JEA)
HAT-trie: a cache-conscious trie-based data structure for strings

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures
Cache-oblivious polygon indecomposability testing

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Engineering scalable, cache and space efficient tries for strings

The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An experimental comparison of cache aware and cache oblivious static search tree algorithms is presented. Both cache aware and cache oblivious algorithms outperform classic binary search on large data sets because of their better utilization of cache memory. Cache aware algorithms with implicit pointers perform best overall, but cache oblivious algorithms do almost as well and do not have to be tuned to the memory block size as cache aware algorithms require. Program instrumentation techniques are used to compare the cache misses and instruction counts for implementations of these algorithms.