Sciweavers

20 search results - page 3 / 4
» Dynamic Dictionary-Based Data Compression for Level-1 Caches
Sort
View
CASES
2006
ACM
13 years 11 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
COMPUTER
2000
138views more  COMPUTER 2000»
13 years 5 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
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
13 years 11 months ago
Transparent pointer compression for linked data structures
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...
Chris Lattner, Vikram S. Adve
TC
2002
13 years 5 months ago
Multiversion Data Broadcast
Broadcasting provides an efficient means for disseminating information in both wired and wireless setting. In this paper, we propose a suite of broadcast organization schemes for ...
Evaggelia Pitoura, Panos K. Chrysanthis
MICRO
2000
IEEE
95views Hardware» more  MICRO 2000»
13 years 9 months ago
Very low power pipelines using significance compression
Data, addresses, and instructions are compressed by maintaining only significant bytes with two or three extension bits appended to indicate the significant byte positions. This s...
Ramon Canal, Antonio González, James E. Smi...