63 search results - page 1 / 13 » Transparent pointer compression for linked data structures |
ACMMSP
2005
ACM
13 years 10 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
COMPUTER
2000
13 years 4 months ago
2000
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...
EUROPAR
2003
Springer
13 years 10 months ago
2003
Springer
We introduce a software/hardware scheme called the Field Array Compression Technique (FACT) which reduces cache misses due to recursive data structures. Using a data layout transfo...
ISCA
1999
IEEE
13 years 9 months ago
1999
IEEE
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency. Jumppointers...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...