Sciweavers

58 search results - page 1 / 12
» Making Pointer-Based Data Structures Cache Conscious
Sort
View
COMPUTER
2000
138views more  COMPUTER 2000»
13 years 3 months ago
Making Pointer-Based Data Structures Cache Conscious
Processor and memory technology trends portend a continual increase in the relative cost of accessing main memory. Machine designers have tried to mitigate the effect of this tren...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
ACSC
2007
IEEE
13 years 10 months ago
HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
Nikolas Askitis, Ranjan Sinha
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
13 years 5 months ago
Making data structures confluently persistent
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
Amos Fiat, Haim Kaplan
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
13 years 8 months ago
Cache conscious programming in undergraduate computer science
The wide-spread use of microprocessor based systems that utilize cache memory to alleviate excessively long DRAM access times introduces a new dimension in the quest to obtain goo...
Alvin R. Lebeck
PLDI
1999
ACM
13 years 8 months ago
Cache-Conscious Structure Layout
Hardware trends have produced an increasing disparity between processor speeds and memory access times. While a variety of techniques for tolerating or reducing memory latency hav...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus