SubscribeComments
Posted by on January 25, 2011 · Leave a Comment
The case for dynamic optimization: Improving memory-hierarchy performance by continuously adapting the internal storage layout of heap objects at run-time … Science, University of California, Irvine)
Filed under Best Products · Tagged with adapting, California, case, continuously, dynamic, Dynamic Optimization, heap, Heap Objects, Improving, Improving Memory, internal, Internal Storage, Irvine, layout, Memory Hierarchy, memoryhierarchy, objects, optimization, performance, Run Time, runtime, Science, Science University, storage, Time Science, University, University Of California, University Of California Irvine