| 
|
QuoteRef: chilTM12_2000
topics >
all references >
ThesaHelp:
references c-d
Topic:
memory cache
Topic:
graph coloring
Topic:
pointers to data
Topic:
recursive data structures
Topic:
code optimization
Topic:
memory management by working sets
Topic:
memory management by garbage collection
Topic:
heap memory management
Reference
Chilimbi, T.M., Hill, M.D., Larus, J.R., "Making pointer-based data structures cache conscious", Computer, December 2000, pp. 67-74. Google
68 ;;Quote: for static tree structure, cluster subtrees for efficient cache access
68 ;;Quote: use coloring to map frequently accessed elements to non-conflicting cache blocks
69 ;;Quote: improve cache performance with compression, clustering, and coloring; i.e., packing cache blocks, grouping blocks, and reducing cache conflicts
69 ;;Quote: compress pointer structures by replacing pointers with computed offsets; e.g., implicit heap
69 ;;Quote: reduce the hot working set by splitting structures into hot, frequently accessed portions and cold portions
70 ;;Quote: cache-conscious pointer structures by rearrangement, allocation policy, and structure layout
71 ;;Quote: used class splitting and cache-conscious garbage collection; 20% faster and 29-43% fewer L2 cache misses
71 ;;Quote: 27% speedup by cache-conscious heap allocator; additional parameter for contemporous data element
72 ;;Quote: improve cache performance via copying garbage collector, object-oriented languages, and octree coloring; 42% speedup
ThesaHelp: references c-d (337 items)
Topic: memory cache (29 items)
Topic: graph coloring (7 items)
Topic: pointers to data (55 items)
Topic: recursive data structures (18 items)
Topic: code optimization (54 items)
Topic: memory management by working sets (18 items)
Topic: memory management by garbage collection (116 items)
Topic: heap memory management (33 items)