Cache Oblivious Data Structures
This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do not require these details for good performance they are portable across caching...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Waterloo
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/1060 |