Collection-set selection using a small priority queue

Details Collection-set selection using a small priority queue Collection-set selection using a small priority queue

2007-11-06

2007-11-06

Wong, Don (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C718S104000

Reexamination Certificate

active

10884526

ABSTRACT:
A space-incremental garbage collector performs marking operations that are usually separated by several collection increments. It uses the marking results to compute collection-efficiency metrics for regions into which it treats the heap as divided. It bases its selection of regions for successive increments' collection sets on the metrics' values, whose computations also depend on the sizes of the regions' “remembered sets,” i.e., on the lists of locations where references to objects in those regions have been observed. Although the remembered-set sizes therefore potentially change between collection increments, the collector re-computes metrics in most collection increments for only a subset of the regions. It selects the subset in accordance with a sorting of all regions that it performed at the end of the most recent completed marking operation.

REFERENCES:
patent: 4989134 (1991-01-01), Shaw
patent: 5088036 (1992-02-01), Ellis et al.
patent: 6098089 (2000-08-01), O'Connor et al.
patent: 6185581 (2001-02-01), Garthwaite
patent: 6892212 (2005-05-01), Shuf et al.

Affiliated with

Also associated with

Rating

Collection-set selection using a small priority queue does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Collection-set selection using a small priority queue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Collection-set selection using a small priority queue will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3846009