Method and system for minor garbage collection

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, C707S793000

Reexamination Certificate

active

07627621

ABSTRACT:
A method for minor garbage collection involves marking cards as clean, where the cards designate ranges of memory locations in a shared older generation, marking a card as dirty to obtain a dirty card when a reference field of an object is modified, where the object is allocated in one of multiple promotion areas, where the promotion area is used to promote objects to the shared older generation only for a single task, and where the card designates the reference field's memory location, examining the promotion areas and the cards to identify a region of the dirty card overlapping the promotion area, where promotion areas associated with other tasks are ignored, scanning the region of the dirty card overlapping the promotion area to identify roots of live young objects associated with the single task, and freeing a young object associated with the single task not identified as live during scanning.

REFERENCES:
patent: 4989134 (1991-01-01), Shaw
patent: 5355483 (1994-10-01), Serlet
patent: 5652883 (1997-07-01), Adcock
patent: 5687368 (1997-11-01), Nilsen
patent: 5692193 (1997-11-01), Jagannathan et al.
patent: 5900001 (1999-05-01), Wolczko et al.
patent: 5903900 (1999-05-01), Knippel et al.
patent: 5915255 (1999-06-01), Schwartz et al.
patent: 5920876 (1999-07-01), Ungar et al.
patent: 6038572 (2000-03-01), Schwartz et al.
patent: 6049810 (2000-04-01), Schwartz et al.
patent: 6081665 (2000-06-01), Nilsen et al.
patent: 6115782 (2000-09-01), Wolczko et al.
patent: 6249793 (2001-06-01), Printezis et al.
patent: 6308185 (2001-10-01), Grarup et al.
patent: 6493730 (2002-12-01), Lewis et al.
patent: 6560773 (2003-05-01), Alexander et al.
patent: 6622226 (2003-09-01), Dussud
patent: 6671707 (2003-12-01), Hudson et al.
patent: 6826583 (2004-11-01), Flood et al.
patent: 6839822 (2005-01-01), Knippel et al.
patent: 6928460 (2005-08-01), Nagarajan et al.
patent: 7039664 (2006-05-01), Garthwaite
patent: 7043509 (2006-05-01), Detlefs
patent: 7051056 (2006-05-01), Rodriguez-Rivera et al.
patent: 7089272 (2006-08-01), Garthwaite et al.
patent: 7107426 (2006-09-01), Kolodner et al.
patent: 7114045 (2006-09-01), Pliss et al.
patent: 7149866 (2006-12-01), Blandy
patent: 7246142 (2007-07-01), Sexton et al.
patent: 7454448 (2008-11-01), Daynes et al.
patent: 2002/0133533 (2002-09-01), Czajkowski et al.
patent: 2002/0194421 (2002-12-01), Berry et al.
patent: 2004/0162861 (2004-08-01), Detlefs
patent: 2006/0155791 (2006-07-01), Tene et al.
patent: 2006/0230087 (2006-10-01), Andreasson
patent: 2007/0016634 (2007-01-01), Sekiguchi et al.
patent: 2007/0180002 (2007-08-01), Printezis et al.
patent: 2007/0288538 (2007-12-01), Bacon et al.
patent: 2009/0150465 (2009-06-01), Branda et al.
Soman, S., Daynes, L., Krintz, C., “Task-Aware Garbage Collection in a Multi-Tasking Virtual Machinie”, ISMM'06,0ttawa, Ontario, Canada, Jun. 10-11, 2006, pp. 64-73.
Ungar, D., “Generation Scavenging: A Non-Disruptive High Performance Storage Reclamation Algorithm”, Department of Electrical Engineering and Computer Sciences, University of California, 1984, pp. 157-167.
Wilson, P., “Uniprocessor Garbage Collection Techniques”, International Workshop on Memory Management, St. Malo, France, Sep. 1992, 34 pages.
Czajkowski, G., Daynes, L., Titzer, B., “A Multi-User Virtual Machine”, Proceedings of the General Track: USENIX Annual Technical Conference, 2003, pp. 85-98.
Czajkowski, G., Daynes, L., “Multitasking without Compromise: a Virtual Machine Evolution”, Proceedings of the 2001 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, 2001, 14 pages.
Azagury, et al., “Combining Card Marking with Remembered Sets: How to Save Scanning Time”, ISMM'98 Proceedings of the First International Symposium on Memory Management, vol. 34(3) of ACM SIGPLAN Notices, Vancouver, Oct. 1998. pp. 10-19.
Hölzle, U, “A Fast Write Barrier for Generational Garbage Collectors”, OOPSLA'93 Garbage Collection Workshop, Washington, D.C., Oct. 1993, 6 pages.
Hosking, A. L., Hudson, R. L., “Remembered sets can also play cards”, OOPSLA'93 Workshop on Garbage Collection in Object-Oriented Systems, Washington, D.C., Sep. 1993, 8 pages.
Hosking, A. L., Moss, J. E. B., Stefanovic, D., “A Comparative Performance Evaluation of Write Barrier Implementations”, Proceedings from the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, Vancouver, Canada, Oct. 1992, 18 pages.
Hudson, R. L., et al., “Garbage Collecting in the World: One Car at a Time”, Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, 1997, 14 pages.
“Run and Reporting Rules for SPEC JVM Client98 Benchmark Suite”, http://www.spec.org/jvm98/jvm98/doc/runrules.html, Jun. 18, 1998, 10 pages.
Domani, T., et al., “Thread-Local Heaps for Java”, ISMM'02, Berlin, Germany, Jun. 20-21, 2002, pp. 76-87.
Daynes, L., Soman, S., Czajkowski, G., “Using Promotion Areas to improve Garbage Collection in multi-tasking Virtual Machine”, Sep. 7, 2005, 18 pages.

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 and system for minor garbage collection 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 and system for minor garbage collection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for minor garbage collection will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4138155

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