Transparent pointer compression for linked data structures
Published • Jun 12, 2005
NobleIDNI3P54W66R43S42
Authors:,
Chris Lattner
Vikram Adve
Abstract
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 memory bandwidth of the system (compared to 32-bit address spaces). This paper presents a sophisticated, automatic transfor...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!