Transparent pointer compression for linked data structures
Authors:
Open Access
- 12 June 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 24-35
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Automatic pool allocation2005
- On the effectiveness of address-space randomization2004
- Bottom-Up and Top-Down Context-Sensitive Summary-Based Pointer AnalysisLecture Notes in Computer Science, 2004
- Data size optimizations for java programs2003
- Field Array Compression in Data Caches for Dynamically Allocated Recursive Data StructuresLecture Notes in Computer Science, 2003
- Automatic pool allocation for disjoint data structures2002
- Benchmark health considered harmfulACM SIGARCH Computer Architecture News, 2001
- Modular interprocedural pointer analysis using access paths2000
- The mungi single-address-space operating systemSoftware: Practice and Experience, 1998
- Supporting dynamic data structures on distributed-memory machinesACM Transactions on Programming Languages and Systems, 1995