Better placement of objects reachable from outside a...

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000

Reexamination Certificate

active

07072905

ABSTRACT:
A garbage collector for more efficient placement of objects referenced from external references. The expected life times of these objects is measured by trial and error, by the class or type, by how often the object has been evacuated or the external reference processed, by the stability and longevity of the root source, or by the prolificness of the class or type of object. The measured value is held in the header of each object in an AGE field available for this purpose. These objects may be evacuated into existing trains or into new trains, or into a combination of existing and new trains. When new trains are created the trains are distributed among the existing trains according to a distribution contour that may be linear, normal, gamma or any other contour that might be found useful. Also, when new trains are created the youngest train must be a new train. When objects are evacuated into existing trains the objects are placed in trains according the survivability of the objects with the longer-lived objects placed proportionally in the younger trains. The objects are evacuated into the new trains from oldest to youngest trains according to the value in the AGE field. The higher the value the younger the train. A threshold on the AGE value may be established such that when the threshold is reached, the objects are evacuated into the youngest new train.

REFERENCES:
patent: 5560003 (1996-09-01), Nilsen et al.
patent: 5692185 (1997-11-01), Nilsen et al.
patent: 5819304 (1998-10-01), Nilsen et al.
patent: 6148309 (2000-11-01), Azagury et al.
patent: 6148310 (2000-11-01), Azagury et al.
patent: 6173294 (2001-01-01), Azagury et al.
patent: 6457023 (2002-09-01), Pinter et al.
patent: 6618738 (2003-09-01), Ozawa et al.
Barrett, D.A., Zorn, B.G. “Using Lifetime Predictors to Improve Memory Allocation Performance”, in Proceedings of SIGPLAN'93 Conference on Programming Languages Design and Implementation, vol. 28(6) of ACM SIGPLAN Notices, pp. 187-196, Albuquerque, NM, Jun. 1993. ACM Press.
Cheng, P., Harper, R., Lee, P. “Generational Stack Collection and Profile-Driven Pretenuring”, In Proceedings of SIGPLAN'98 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, pp. 162-173, Montreal, Jun. 1998. ACM Press.
Hanson, D.R. “Fast Allocation and Deallocation of Memory Based on Object Lifetimes”, Software Practice and Experience, 20(1):Jan. 5-12, 1990.
Harris, T. “Dynamic Adaptive Pre-Tenuring”, In Proceedings of the International Symposium on Memory Management, pp. 127-136, Oct. 2000.
Ungar, D.M., Jackson, F. “Tenuring Policies for Generation-Based Storage Reclamation”, ACM SIGPLAN Notices, 23(11):1-17, 1988.
Zorn, B., Seidl, M. “Segregating Heap Objects by Reference Behavior and Lifetime”, In Eighth International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 12-23, San Jose, CA, Oct. 1998.
Jones and Lins, “Garbage Collection: Algorithms for Automatic Dynamic Memory Management”, 1996, pp. 167-181, John Wiley and Sons, NY.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Better placement of objects reachable from outside a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Better placement of objects reachable from outside a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Better placement of objects reachable from outside a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3567635

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.