000192928 001__ 192928
000192928 005__ 20190316235809.0
000192928 037__ $$aCONF
000192928 245__ $$aUsing Generational Garbage Collection to Implement Cache-Conscious Data Placement
000192928 269__ $$a1998
000192928 260__ $$bACM$$c1998
000192928 336__ $$aConference Papers
000192928 520__ $$aThe cost of accessing main memory is increasing. Machine designers have tried to mitigate the consequences of the processor and memory technology trends underlying this increasing gap with a variety of techniques to reduce or tolerate memory latency. These techniques, unfortunately, are only occasionally successful for pointer-manipulating programs. Recent research has demonstrated the value of a complementary approach, in which pointer-based data structures are reorganized to improve cache locality.This paper studies a technique for using a generational garbage collector to reorganize data structures to produce a cache-conscious data layout, in which objects with high temporal affinity are placed next to each other, so that they are likely to reside in the same cache block. The paper explains how to collect, with low overhead, real-time profiling information about data access patterns in object-oriented languages, and describes a new copying algorithm that utilizes this information to produce a cache-conscious object layout.Preliminary results show that this technique reduces cache miss rates by 21--42%, and improves program performance by 14--37% over Cheney's algorithm. We also compare our layouts against those produced by the Wilson-Lam-Moher algorithm, which attempts to improve program locality at the page level. Our cache-conscious object layouts reduces cache miss rates by 20--41% and improves program performance by 18--31% over their algorithm, indicating that improving locality at the page level is not necessarily beneficial at the cache level.
000192928 700__ $$aChilimbi, Trishul M.
000192928 700__ $$aLarus, James R.
000192928 773__ $$tACM SIGPLAN International Symposium on Memory Management$$q36-48
000192928 8564_ $$uhttp://doi.acm.org/10.1145/286860.286865$$zURL
000192928 909C0 $$xU12814$$0252497$$pUPLARUS
000192928 909CO $$ooai:infoscience.tind.io:192928$$qGLOBAL_SET$$pconf$$pIC
000192928 937__ $$aEPFL-CONF-192928
000192928 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000192928 980__ $$aCONF