B. Hayes. Key Objects in Garbage Collection. Ph.D thesis, Stanford University, March 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Hayes OOPSLA 91 GC workshop report. Boehm, 1991a] Hans Juergen Boehm. Hardware and operating system support for conservative garbage collection. In Cabrera et al. Cabrera et al..1991] pages 61 67. Boehm, 1991b] Hans Juergen Boehm. Simple GC safe compilation. In Wilson and Hayes [Wilson and Hayes1991a] Boehm, 1993] Hans Juergen Boehm. Space efficient conservative garbage collection. In PLDI [PLDI1993] pages 197 206. Boehm, 1995] Hans Juergen Boehm. Dynamic memory allocation and garbage collection. Computers in Physics, 9(3) 297 303, May June 1995. Boehm, 1996] Hans Juergen Boehm. Simple ....

Barry Hayes. Key Objects in Garbage Collection. PhD thesis, Stanford University, March 1993.

....lifetimes and the generational hypotheses; Clinger and Hansen offer a good overview of these [Clinger and Hansen, 1997, Section 9 (pp. 106 107) We could not find any recent studies of mature object lifetime distributions that go beyond anecdotal reports, with the signal exception of Hayes data [Hayes, 1993]. One of us has worked on collection techniques directed at mature objects, the Mature Object Space (MOS) collector, also called the Train Algorithm [Hudson and Moss, 1992] The objective of that work, though, is not so much the minimization of total garbage collection cost as avoidance of ....

Hayes, B. (1993). Key Objects in Garbage Collection. PhD thesis, Stanford University, Stanford, California.

.... data structures quickly, and then use those data structures for long periods (often nearly the whole running time of the program) These patterns are well known, from anecdotal experience by many people (e.g. Ros67, Han90] from research on garbage collection (e.g. Whi80, WM89, UJ88, Hay91, Hay93, BZ95, Wil95] 32 and from a recent study of C and C programs [WJNB95] 32 It may be thought that garbage collected systems are sufficiently different from those using conventional storage management that these results are not relevant. It appears, however, that these patterns are common ....

Barry Hayes. Key Objects in Garbage Collection. PhD thesis, Standford University, March 1993.

....garbage collection is that storage reclamation can be made more efficient and less obtrusive by concentrating effort on reclaiming those objects most likely to be garbage, i.e. young objects. Hayes and others observe that youngest objects have the highest mortality [Hayes, 1991; Baker, 1993; Hayes, 1993; Stefanovic and Moss, 1994] which is a refinement of the somewhat vague observation that most objects have a very short lifetime while some live much longer [Lieberman and Hewitt, 1983; Ungar, 1984; Shaw, 1988; DeTreville, 1990a; Zorn, 1990b] Figure 2.1 graphs a typical mortality function using ....

....known as cons cells. True age timestamps permit the collector to focus attention on particular age groups, i.e. on sets of objects allocated consecutively. They arise naturally from considerations of object lifetime behavior clusters of objects allocated together tend to expire together [Hayes, 1993]. On the other hand, the notion of renewal age timestamps can arise from considerations of an a priori exponential lifetime distribution [Clinger and Hansen, 1997] Traditional generational collection schemes are, in the main, age based. They are based on true age, and the region collected is some ....

Barry Hayes. Key Objects in Garbage Collection. PhD thesis, Stanford University, Stanford, California, March 1993.

.... Therefore, without making specific comparisons, which are difficult when evaluation metrics as well as underlying languages are widely different, we recognize that our study draws on previous experience with generational garbage collection implementations [19, 27, 20, 24, 28, 35] their policies [29, 30, 31, 34, 1, 13], their write barrier mechanisms [33, 15, 14] and their evaluation with respect to object allocation and lifetime behavior [3, 26, 11] Achieving performance improvements with generational collection critically depends on setting or adapting the configuration parameters right incorrectly chosen ....

Hayes, B. Key Objects in Garbage Collection. PhD thesis, Stanford University, Stanford, California, Mar. 1993.

....generational garbage collection (GC) algorithms look for garbage among the youngest objects, where age is measured in terms of units of memory allocated. These collectors are based on two widely held beliefs: 1. Young objects die more quickly than older objects [Jones and Lins, 1996; Hayes, 1993]. 2. Pointer directions overwhelmingly tend to be from younger to older objects [Jones and Lins, 1996; Zorn, 1990; Appel, 1989] 1. If instead of the death rate (the mortality) we consider the age at which an object dies, i.e. the survivor function [Cox and Oakes, 1984] we obtain a monotone ....

....garbage collection is that storage reclamation can be made more efficient and less obtrusive by concentrating effort on reclaiming those objects most likely to be garbage, i.e. young objects. Hayes and others observe that youngest objects have the highest mortality [Hayes, 1991; Baker, 1993; Hayes, 1993; Stefanovi c and Moss, 1994] Figure 1 graphs a typical mortality function using Tomcatv written in Smalltalk as an example (see Section 5.2) with the age of objects on the horizontal axis, and for a given age, the rate at which they die on the vertical axis. Both axes use a logarithmic scale. ....

Hayes, B. (1993). Key Objects in Garbage Collection. PhD thesis, Stanford University, Stanford, California.

....fourth part discusses other overheads of automatic garbage collection. Below I will reference other work that impacts on specific parts of my analysis. Some more general surveys of memory management are Wilson s modern survey of garbage collection[Wil92] the introduction to Hayes s recent thesis[Hay94] Cohen and Nicolau s 1981 survey of garbage collection[Coh81] Cohen s 1983 survey of compaction[CN83] and Hickey and Cohen s 1984 analysis of performance[HC84] General references can be found in the surveys just cited. CHAPTER 2. MEMORY MANAGEMENT 25 2.3 Definitions In this section I will ....

....it is done, all objects will be swept, so unmarked objects will be returned to the free list. Compactification may be done as part of sweeping. Whenever compactification is done, forwarding must be done. Discussion of forwarding is deferred till later. 2.5. 2 Ephemeral Marking Studies have shown ( Hay94, Chapter 3] that 85 of all objects allocated have fairly short lifetimes. Also, some systems have initial program loads that contain tens of megabytes of objects that need never be garbage collected. Garbage collection can be adapted to these facts by dividing objects into two kinds: permanent ....

Barry Hayes. Key objects in garbage collection. Technical Report CS-TR94 -1510, Stanford, August 1994.

....garbage collection is that storage reclamation can be made more efficient and less obtrusive by concentrating effort on reclaiming those objects most likely to be garbage, i.e. young objects. Hayes and others observe that youngest objects have the highest mortality [Hayes, 1991; Baker, 1993; Hayes, 1993; Stefanovic and Moss, 1994] which is a refinement of the somewhat vague observation that most objects have a very short lifetime while some live much longer [Lieberman and Hewitt, 1983; Ungar, 1984; Shaw, 1988; DeTreville, 1990a; Zorn, 1990b] Figure 2.1 graphs a typical mortality function using ....

....known as cons cells. True age timestamps permit the collector to focus attention on particular age groups, i.e. on sets of objects allocated consecutively. They arise naturally from considerations of object lifetime behavior clusters of objects allocated together tend to expire together [Hayes, 1993]. On the other hand, the notion of renewal age timestamps can arise from considerations of an a priori exponential lifetime distribution [Clinger and Hansen, 1997] Traditional generational collection schemes are, in the main, age based. They are based on true age, and the region collected is some ....

Barry Hayes. Key Objects in Garbage Collection. PhD thesis, Stanford University, Stanford, California, March 1993.

No context found.

B. Hayes. Key Objects in Garbage Collection. Ph.D thesis, Stanford University, March 1993.

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