D. Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....(ROF) Collection In this section we describe a pure renewal older first (ROF) generational collector. 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 ....

.... (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 ....

[Article contains additional citation context not shown here]

Darko Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. Ph.D. thesis, University of Massachusetts, Amherst, Massachusetts, February 1999.

....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 ....

Darko Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, 1999.

....states that most objects die young. This hypothesis forms the basis of generational garbage collection [29, 6] focus on reclaiming objects that are most likely to die, i.e. young objects. Stefanovic et al. have investigated alternatives to the traditional young first generational collectors [39]. They propose age based garbage collection [40] algorithms, some of which use an older first collector that collects older objects before the younger ones. This approach primarily reduces copying costs over the traditional generation collectors. Both the age based and traditional generational ....

D. Stefanovic. Properties of Age-based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, Amherst, MA, February 1999.

....then the next two, and finally the last instruction. A sequence that does card marking based on the slot address will have more groups, because it must do further calculations dependent on the result ry, and thus may take more cycles to execute. The sequence for an address order write barrier [13, 14] is perhaps more interesting. In Figure 8 we use a block size of 2 k ; we also record the interesting stores using a sequential store buffer [8] to illustrate that feature. This sequence takes advantage of the large register set (dedicating registers to hold the block mask m and the SSB ....

D. Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, Amherst, MA, Feb. 1999.

.... when all free s are local) Johnstone and Stefanovic show in their empirical studies of allocation behavior that for nearly every program they analyzed, the memory in use tends to vary within a range that is within a fraction of total memory currently in use, and this amount often grows steadily [18, 31]. Thus, in the steady state case, Hoard incurs no contention, and in gradual growth, Hoard incurs low contention. 5 Experimental Results In this section, we describe our experimental results. We performed experiments on uniprocessors and multiprocessors to demonstrate Hoard s speed, scalability, ....

D. Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, Department of Computer Science, University of Massachusetts, Amherst, Massachusetts, Dec. 1998.

....(b) Representative heap size. Figure 8: Copying cost estimates, Bloat Bloat. and to stay in a sweet spot for a long time. The OF collector does occasionally sweep through the heap and as a result revisits the oldest objects repeatedly. When we examine the lifetimes of the objects in this program [25] we find there are a number of long lived objects. Thus, the OF collector is repeatedly copying these objects (whereas generational collectors by design rarely copy these objects) nevertheless it copies a factor of 10 less data. As it is the trend in most of the benchmarks, OF collection ....

....copying cost. Furthermore, Figure 8(b) shows that these 3 collectors achieve close to or their minimums with a window size around 40 of the entire heap. The OF collector (as simulated for this study) fails with a window size below 20 , because long lived data spans more than the collection window [25]. These results are representative of the remaining 8 programs. Comparing 2G with 3G collection in Figure 8(a) and (b) reveals no significant differences in the best configurations, but many configurations of the 3G collector perform worse, sometimes much worse, than the 2G collector. 4.1 ....

[Article contains additional citation context not shown here]

Stefanovic, D. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, Amherst, MA, Feb. 1999.

No context found.

D. Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, 1999.

No context found.

D. Stefanovic. Properties of Age-Based Automatic Memory Reclamation Algorithms. PhD thesis, University of Massachusetts, 1999.

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