Sciweavers

Share
61 search results - page 1 / 13
» Making Pointer-Based Data Structures Cache Conscious
Sort
View
COMPUTER
2000
138views more  COMPUTER 2000»
9 years 11 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
10 years 6 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
CLOUDI
2013
115views more  CLOUDI 2013»
6 years 7 months ago
Cache conscious star-join in MapReduce environments
With the popularity of big data and cloud computing, data parallel framework MapReduce based data warehouse systems are used widely. Column store is a default data placement in th...
Guoliang Zhou, Yongli Zhu, Guilan Wang
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
10 years 4 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
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
10 years 1 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
books