Method for combining card marking with remembered sets for old a

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1730

Patent

active

061483109

ABSTRACT:
A system for garbage collection of memory objects in a memory heap. The system includes memory heap that is partitioned into respective old and young areas. The old area is partitioned into cars and is further associated with card markings and remembered sets data structures. The card markings include for each card, a card time stamp that represents the time that the card was updated. The car includes, for each car, a car time entry stamp that represents the time the remembered set of the car was updated. The system further includes a processor communicating with the memory, and being capable of identifying all cards that were updated later than the remembered set of a selected car. In response to the event, it performs identifying change in pointers that refer from the card to a memory object in the selected car and in response to identified change in pointers, updating the remembered set of the car with the identified pointers. The process is further capable of updating the car time stamp of the selected car.

REFERENCES:
patent: 5903900 (1999-05-01), Kuippel et al.
patent: 6038572 (2000-03-01), Schwartz et al.
Hudson et al., "A Language-Independent Garbage Collector Toolkit," COINS Technical Report 91-47, Sep. 1991.
Holzle, U., "A Fast Write Barrier for Generational Gar.sub.bag e Collectors," OOPSLA/ECOOP '93, Workshop on Garbage Collections in Object-Oriented Systems, Oct. 1993.
Hosking, A.L., et al., "Remembered Sets Can Also Play Cards," OOPSLA '93, Workshop on Garbage Collection and Memory Management, Washington D.C., Sep. 1993.
Hudson, R.L., et al., "Incremental Collection of Mature Objects," Proceedings on International Workshop on Memory Management, vol. 637 of Lecture Notes in Computer Science, Springer-Verlag, 1992.
Lieberman, H., et al., "A Real-Time Garbage Collector Based on the Lifetimes of Objects," Communications of the ACM, 26-6:419-429 (1983).
Seligmann, J., et al., "Incremental Mature Garbage Collection Using the Train Algorithm," Proceedings of 1995 European Conference on Object-Oriented Programming, Lecture Notes in Computer-Science, Springer-Verlag Aug. 1995.
Sobalvarro, P.G., "A Lifetime-based Garbage Collector for LISP Systems on General-Purpose Computers," Technical Report AITR-1417, MIT, AI Lab, Feb. 1988.
Ungar, D., "Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm," Proceedings of the ACM Symposium on Practical Software Development Environments, ACM SIGPLAN Notices 19-5: 157-167 (1984).
Wilson, P.R., "Uniprocessor Garbage Collection Techniques," Proceedings of International Workshop on Memory Management, vol. 637 of Lecture Notes in Computer Science, Springer-Verlag, 1992.
Wilson, P.R., "A `Card-Marking` Scheme for Controlling Intergenerational References in Generation-Based Garbage Collection on Stock Hardware," ACM SIGPLAN Notices, 24-5:87-92 (1989).
R.E. Jones and R.D. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Chapter 7 John Wiley & Sons (1996).

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

Method for combining card marking with remembered sets for old 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 Method for combining card marking with remembered sets for old a, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for combining card marking with remembered sets for old a will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2075165

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