Lars Thomas Hansen. Older-first Garbage Collection in Practice. Ph.D. Thesis, Northeastern University, November 2000. Available online---see [10]. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Beltway: Getting Around Garbage Collection Gridlock - Blackburn, Jones, McKinley.. (2002) (11 citations) (Correct)
....increment consumes all usable memory, BA2 collects it, copying survivors to a new increment on the same belt. In practice, if the nursery size drops below some small fixed threshold, the heap is considered full. Older First Mix algorithms are an incremental variation on the semi space collector [19, 31]. They are called older first mix because they mix copies and newly allocated objects in memory. This Beltway configuration, BOFM, shown in Figure 3(c) has one belt and multiple increments. BOFM both allocates and copies survivors to the last increment on the belt, triggering collection when the ....
....hybrids. The most common segregation policy is by age: two or three agebased regions are common, but some collectors use more [27] Generational age based collectors exploit the weak generational hypothesis [34] Older first collection [32] and renewal older first (here called older first mix) [15, 19] are premised upon the just allocated (Older First) or copied (renewal older first) objects being likely to stay reachable for a while. Beltway configurations exploit these characteristics with multiple increments on FIFO belts. Beltway X.X.100 is complete, unlike older first. More importantly, ....
Lars Thomas Hansen. Older-first garbage collection in practice. PhD thesis, North-eastern University, November 2000.
An Experimental Study of Renewal-Older-First Garbage Collection - Hansen, Clinger Self-citation (Hansen) (Correct)
.... (This algorithm is exactly the same as the nonpredictive algorithm that we described previously, but we have adopted the more descriptive name that Darko Stefanovic gave to it [9, 31] Our ROF algorithm described here should not be confused with Stefanovic s deferred older first (DOF) algorithm [17, 31]. A pure renewal older first collector divides the heap into two generations, and always collects the older generation. Instead of grouping objects according to their actual age, however, the ROF algorithm groups objects according to their renewal age, which is defined as the time that has ....
....a substantial fraction of the cost of copying and scanning a pair in the hybrid ROF collector. This cost would be less significant in languages like Java. 4 Larceny and its Collectors This section describes our Larceny implementation of Scheme and some characteristics of its garbage collectors [8, 16, 17, 23, 25]. 4.1 Compiler Larceny uses the Twobit optimizing compiler to compile Scheme to SPARC machine code. Previous measurements have established that Twobit and Larceny together have performance that is roughly competitive with Standard ML of New Jersey and with commercial Common Lisp and Scheme ....
[Article contains additional citation context not shown here]
Lars Thomas Hansen. Older-first Garbage Collection in Practice. Ph.D. Thesis, Northeastern University, November 2000. Available online---see [10].
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
Lars Thomas Hansen. Older-first garbage collection in practice. PhD thesis, Northeastern University, November 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC