Field array compression in data caches for dynamically allocated recursive data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2858, Issue , 2003, Pages 127-145

  Takagi, Masamichi ^a   Hiraki, Kei ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; METADATA;

CACHE CAPACITY; CACHE MISS; COMPRESSION TECHNIQUES; DATA CACHES; DATA LAYOUT TRANSFORMATIONS; PREFETCHING; RECURSIVE DATA STRUCTURES; SOFTWARE/HARDWARE;

DATA COMPRESSION;

EID: 0242339534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39707-6_10     Document Type: Article

References (15)

1. J. Bonwick. The slab allocator: An object-caching kernel memory allocator. Proc. USENIX Conference, pp. 87-98, Jun. 1994.
2. D. A. Barret and B. G. Zorn. Using lifetime prediction to improve memory allocation performance. Proc. PLDI, 28(6):187-196, Jun. 1993.
3. D. N. Truong, F. Bodin, and A. Seznec. Improving cache behavior of dynamically allocated data structures. Proc. PACT, pp. 322-329, Oct. 1998.
4. A. Rogers et al.Supporting dynamic data structures on distributed memory machines. ACM TOPLAS, 17(2):233-263, Mar. 1995.
5. Compaq Computer Corp. Alpha 21264 Microprocessor Hardware Reference Manual. Jul. 1999.
6. T. M. Chilimbi et al.Cache-conscious structure layout. Proc. PLDI, 1999.
7. C-K. Luk and T. C. Mowry. Compiler based prefetching for recursive data structures. Proc. ASPLOS, pp. 222-233, Oct. 1996.
8. A. Roth, A. Moshovos, and G. S. Sohi. Dependence based prefetching for linked data structures. Proc. ASPLOS, pp. 115-126, Oct. 1998.
9. J. Lee et al.An on-chip cache compression technique to reduce decompression overhead and design complexity. Journal of Systems Architecture, Vol. 46, pp. 1365-1382, 2000.
10. Y. Zhang, J. Yang, and R. Gupta. Frequent value locality and value-centric data cache design. Proc. ASPLOS, pp. 150-159, Nov. 2000.
11. J. Yang, Y. Zhang, and R. Gupta. Frequent value compression in data caches. Proc. MICRO, pp. 258-265, Dec. 2000.
12. S. Y. Larin. Exploiting program redundancy to improve performance, cost and power consumption in embedded systems. Ph.D. Thesis, ECE Dept., North Carolina State Univ., 2000.
13. Y. Zhang et al.Data compression transformations for dynamically allocated data structures. Int. Conf. on Compiler Construction, LNCS 2304, Springer Verlag, pp. 14-28, Apr. 2002.
14. D. Brooks et al.Dynamically exploiting narrow width operands to improve processor power and performance. Proc. HPCA, pp. 13-22, Jan. 1999.
15. R. M. Rabbah and K. V. Palem. Data remapping for design space optimization of embedded memory systems. ACM TECS, 2(2):186-218 May 2003.