Garbage Collection without Paging Export

@misc{citeulike:2784151, abstract = {Garbage collection offers numerous software engineering advantages, but interacts poorly with virtual memory managers. Existing garbage collectors require far more pages than the application's working set and touch pages without regard to which ones are in memory, especially during full-heap garbage collection. The resulting paging can cause throughput to plummet and pause times to spike up to seconds or even minutes. We present a garbage collector that avoids paging. This bookmarking collector ...}, author = {Hertz, Matthew and Feng, Yi and Berger, Emery D.}, citeulike-article-id = {2784151}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.3800}, keywords = {garbage-collection, homepage, performance, virtual-memory}, posted-at = {2008-05-11 11:49:25}, priority = {2}, title = {Garbage Collection without Paging}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.3800} }

TY - GEN ID - citeulike:2784151 L3 - citeulike-article-id:2784151 N2 - Garbage collection offers numerous software engineering advantages, but interacts poorly with virtual memory managers. Existing garbage collectors require far more pages than the application's working set and touch pages without regard to which ones are in memory, especially during full-heap garbage collection. The resulting paging can cause throughput to plummet and pause times to spike up to seconds or even minutes. We present a garbage collector that avoids paging. This bookmarking collector ... TI - Garbage Collection without Paging KW - garbage-collection KW - homepage KW - performance KW - virtual-memory AU - Hertz, Matthew AU - Feng, Yi AU - Berger, Emery UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.3800 ER -