Automatic Restructuring of Linked Data Structures
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 263-277
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- MPADS2008
- An adaptive packed-memory array2006
- Transparent pointer compression for linked data structures2005
- Automatic pool allocationACM SIGPLAN Notices, 2005
- LLVM: A compilation framework for lifelong program analysis & transformation2004
- Hybrid Analysis: Static & Dynamic Memory Reference AnalysisInternational Journal of Parallel Programming, 2003
- Automatic pool allocation for disjoint data structuresACM SIGPLAN Notices, 2002
- Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data StructuresLecture Notes in Computer Science, 1999
- Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures1998
- Run-time parallelization and scheduling of loopsIEEE Transactions on Computers, 1991