Staging the processing of remembered-set entries as part of collection based on the train algorithm

• US 7,146,390 B2
• Filed: 02/24/2003
• Issued: 12/05/2006
• Est. Priority Date: 02/24/2003
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Garthwaite, Alexander T.
• Primary Examiner(s): Alam, Shahid
• Assistant Examiner(s): FLEURANTIN, JEAN B
• Application Number:
  US10/372,905
• Publication Number:
  US 20040167946A1
• Time in Patent Office: 1,380 Days
• Field of Search: 707 1- 10, 707100-1041, 707200-206, 711170-173, 711200-209, 719312-315
• US Class Current: 1/1
• CPC Class Codes: G06F 12/0276 Generational garbage collection
• CPC Class Codes: Y10S 707/99953 Recoverability
• CPC Class Codes: Y10S 707/99957 Garbage collection

Abstract

A garbage collector that reclaims memory space no longer needed by a mutator treats a generation of a dynamically allocated heap as being divided into “car” sections. For each car section, the collector maintains a remembered-set structure in which it keeps a record of the locations in the generation where the collector has previously found references to locations in that car section. The collector operates in increments in each of which it collects a respective collection set consisting of one or more of the generation'"'"'s car sections. From the remembered sets associated with a collection set'"'"'s car sections, it generates scratch-pad lists whose entries tell where locations identified by those remembered sets still contain references to collection-set locations. In situations in which the remembered sets are particularly large, the collector divides the operation of generating the scratch-pad lists into a plurality of collection intervals separated by mutator intervals. The collector bases its identification of reachable collection-set objects on the scratch-pad-list entries. By dividing the scratch-pad-list generation into multiple collection intervals, the collector can keep pause times low while employing relatively large collection sets.

Claims

1. A method of garbage collection comprising:

A) providing a computer system that includes memory and executes a mutator that modifies references in a dynamically allocated heap in the memory;

B) configuring the computer system to act as a garbage collector that;

i) treats the heap as comprising at least one generation; and

ii) collects at least an incrementally collected one said generation in collection increments, the collection of each collection increment being performed without intervening mutator execution and wherein the garbage collector is modified to perform a collection of at least one collection increment in a plurality of collection intervals dedicated to collection and separated by intervals of mutator execution;

iii) associates with each collection increment a respective collection set collected during that increment;

iv) maintains for the collection sets respective remembered sets of remembered-set entries that identify locations where references to objects in the respective collection sets have been found before the increments with which those collection sets are associated;

v) during a collection increment;

a) performs a reference-listing operation in which, by inspecting the locations identified by the remembered-set entries in the remembered set associated with that increment, it compiles a scratch-pad list of locations where it thereby finds references to objects in the collection set associated with that increment;

b) performs an evacuation operation in which it evacuates from the collection set objects that it employs the scratch-pad list to identify; and

c) thereafter reclaims the collection set; and

vi) in at least some collection increments divides performance of the reference-listing operation among a plurality of the collection intervals; and

C) employing the computer system to execute the garbage collector.

2. A method as defined in claim 1 wherein the collector always performs the entire evacuation operation in a single collection interval.

3. A method as defined in claim 1 wherein:

D) the garbage collector treats the incrementally collected generation as divided into car sections organized into trains; and

E) the scratch-pad list is a composite scratch-pad list that includes a plurality of constituent scratch-pad lists of which each is associated with a respective train and lists locations in car sections belonging to the train with which it is associated.

4. A method as defined in claim 1 wherein:

D) the garbage collector treats the incrementally collected generation as divided into car sections;

E) the garbage collector maintains for each car section a respective remembered set, associated therewith, of remembered-set entries that identify locations where references to objects in the that car section have been found; and

F) the remembered set associated with a collection set includes each remembered set associated with a car section included in that collection set.

5. A method as defined in claim 4 wherein:

G) the mutator employs write barriers to report to the garbage collector where reference modifications have been made; and

H) the garbage collector responds to the write barriers by inspecting the locations reported thereby and, for each reference thereby found to an object located in the generation;

i) if that object does belong to the collection set, places into the remembered set associated with the car containing that object a remembered-set entry that identifies that reference'"'"'s location; and

ii) if that object does belong to the collection set, refrains from placing an entry identifying it into a remembered and instead places into the scratch-pad list a scratch-pad-list entry that identifies that reference'"'"'s location.

6. A method as defined in claim 5 wherein the collector always performs the entire evacuation operation in a single collection interval.

7. A method as defined in claim 1 wherein:

D) in at least some collection increments, the garbage collector;

i) performs an evacuation operation, in which it evacuates from the collection set objects that it identifies as potentially reachable; and

ii) thereafter reclaims the collection set; and

E) the garbage collector always performs the entire evacuation operation in a single collection interval.

8. A computer system comprising:

A) processor circuitry operable to execute processor instructions; and

B) memory circuitry, to which the processor circuitry is responsive, that includes a heap comprising at least one generation in which memory space is dynamically allocated and that contains processor instructions readable by the processor circuitry to configure the computer system as a mutator that modifies references in the heap and as a garbage collector that;

i) treats the heap as comprising at least one generation; and

ii) collects at least an incrementally collected one said generation in collection increments, the collection of each collection increment being performed without intervening mutator execution and wherein the garbage collector is modified to perform a collection of at least one collection increment in a plurality of collection intervals dedicated to collection and separated by intervals of mutator execution;

iii) associates with each collection increment a respective collection set collected during that increment;

iv) maintains for the collection sets respective remembered sets of remembered-set entries that identify locations where references to objects in the respective collection sets have been found before the increments with which those collection sets are associated;

v) during a collection increment;

a) performs a reference-listing operation in which, by inspecting the locations identified by the remembered-set entries in the remembered set associated with that increment, it compiles a scratch-pad list of locations where it thereby finds references to objects in the collection set associated with that increment;

d) performs an evacuation operation in which it evacuates from the collection set objects that it employs the scratch-pad list to identify; and

c) thereafter reclaims the collection set; and

vi) in at least some collection increments divides performance of the reference-listing operation among a plurality of the collection intervals; and

C) employing the computer system to execute the garbage collector.

9. A computer system as defined in claim 8 wherein the collector always performs the entire evacuation operation in a single collection interval.

10. A computer system as defined in claim 8 wherein:

D) the garbage collector treats the incrementally collected generation as divided into car sections organized into trains; and

E) the scratch-pad list is a composite scratch-pad list that includes a plurality of constituent scratch-pad lists of which each is associated with a respective train and lists locations in car sections belonging to the train with which it is associated.

11. A computer system as defined in claim 8 wherein:

D) the garbage collector treats the incrementally collected generation as divided into car sections;

E) the garbage collector maintains for each car section a respective remembered set, associated therewith, of remembered-set entries that identify locations where references to objects in the that car section have been found; and

F) the remembered set associated with a collection set includes each remembered set associated with a car section included in that collection set.

12. A computer system as defined in claim 11 wherein:

G) the mutator employs write barriers to report to the garbage collector where reference modifications have been made; and

H) the garbage collector responds to the write barriers by inspecting the locations reported thereby and, for each reference thereby found to an object located in the generation;

i) if that object does belong to the collection set, places into the remembered set associated with the car containing that object a remembered-set entry that identifies that reference'"'"'s location; and

ii) if that object does belong to the collection set, refrains from placing an entry identifying it into a remembered and instead places into the scratch-pad list a scratch-pad-list entry that identifies that reference'"'"'s location.

13. A computer system as defined in claim 12 wherein the collector always performs the entire evacuation operation in a single collection interval.

14. A computer system as defined in claim 8 wherein:

D) in at least some collection increments, the garbage collector;

i) performs an evacuation operation, in which it evacuates from the collection set objects that it identifies as potentially reachable; and

ii) thereafter reclaims the collection set; and

E) the garbage collector always performs the entire evacuation operation in a single collection interval.

15. A storage medium containing instructions readable, by a computer system that includes memory including a heap in which space is dynamically allocated to a mutator that modifies references therein, to configure the computer system to operate as a garbage collector that:

A) treats the heap as comprising at least one generation;

B) collects at least an incrementally collected one said generation in collection increments, the collection of each collection increment being performed without intervening mutator execution and wherein the garbage collector is modified to perform a collection of at least one collection increment in a plurality of collection intervals dedicated to collection and separated by intervals of mutator execution;

C) associates with each collection increment a respective collection set collected during that increment;

D) maintains for the collection sets respective remembered sets of remembered-set entries that identify locations where references to objects in the respective collection sets have been found before the increments with which those collection sets are associated;

E) during a collection increment;

i) performs a reference-listing operation in which, by inspecting the locations identified by the remembered-set entries in the remembered set associated with that increment, it compiles a scratch-pad list of locations where it thereby finds references to objects in the collection set associated with that increment;

ii) performs an evacuation operation in which it evacuates from the collection set objects that it employs the scratch-pad list to identify; and

iii) thereafter reclaims the collection set; and

F) in at least some collection increments divides performance of the reference-listing operation among a plurality of the collection intervals.

16. A storage medium as defined in claim 15 wherein the collector always performs the entire evacuation operation in a single collection interval.

17. A storage medium as defined in claim 15 wherein:

G) the garbage collector treats the incrementally collected generation as divided into car sections organized into trains; and

H) the scratch-pad list is a composite scratch-pad list that includes a plurality of constituent scratch-pad lists of which each is associated with a respective train and lists locations in car sections belonging to the train with which it is associated.

18. A storage medium as defined in claim 15 wherein:

G) the garbage collector treats the incrementally collected generation as divided into car sections;

H) the garbage collector maintains for each car section a respective remembered set, associated therewith, of remembered-set entries that identify locations where references to objects in the that car section have been found; and

I) the remembered set associated with a collection set includes each remembered set associated with a car section included in that collection set.

19. A storage medium as defined in claim 18 wherein:

J) the mutator employs write barriers to report to the garbage collector where reference modifications have been made; and

K) the garbage collector responds to the write barriers by inspecting the locations reported thereby and, for each reference thereby found to an object located in the generation;

i) if that object does belong to the collection set, places into the remembered set associated with the car containing that object a remembered-set entry that identifies that reference'"'"'s location; and

ii) if that object does belong to the collection set, refrains from placing an entry identifying it into a remembered and instead places into the scratch-pad list a scratch-pad-list entry that identifies that reference'"'"'s location.

20. A storage medium as defined in claim 19 wherein the collector always performs the entire evacuation operation in a single collection interval.

21. A storage medium as defined in claim 15 wherein:

G) in at least some collection increments, the garbage collector;

i) performs an evacuation operation, in which it evacuates from the collection set objects that it identifies as potentially reachable; and

ii) thereafter reclaims the collection set; and

H) the garbage collector always performs the entire evacuation operation in a single collection interval.

22. For reclaiming memory in a dynamically allocated heap in which a mutator modifies references, a garbage collector comprising:

A) means for treating the heap as comprising at least one generation;

B) means for collecting at least an incrementally collected one said generation in collection increments, the collection of each collection increment being performed without intervening mutator execution and wherein the garbage collector is modified to perform a collection of at least one collection increment in a plurality of collection intervals dedicated to collection and separated by intervals of mutator execution;

C) means for associating with each collection increment a respective collection set collected during that increment;

D) means for maintaining for the collection sets respective remembered sets of remembered-set entries that identify locations where references to objects in the respective collection sets have been found before the increments with which those collection sets are associated;

E) means operable during a collection increment;

i) for performing a reference-listing operation in which, by inspecting the locations identified by the remembered-set entries in the remembered set associated with that increment, it compiles a scratch-pad list of locations where it thereby finds references to objects in the collection set associated with that increment;

ii) for performing an evacuation operation in which it evacuates from the collection set objects that it employs the scratch-pad list to identify; and

iii) for thereafter reclaiming the collection set; and

F) means operable in at least some collection increments for dividing performance of the reference-listing operation among a plurality of the collection intervals.