Depth counter used to reduce number of items to consider for...

Details Depth counter used to reduce number of items to consider for... Depth counter used to reduce number of items to consider for...

2008-01-01

2008-01-01

Wong, Don (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C711S133000, C711S134000, C711S135000, C711S136000, C711S170000

Reexamination Certificate

active

07315873

ABSTRACT:
A technique for improving the efficiency of a loop detecting, reference counting storage reclamation program in a computer system. A depth value is maintained for data objects in a memory resource to indicate a distance from a global, live data object. A reference count is also maintained based on a number of objects pointing to each object. A particular object is processed by the storage reclamation program when another object that previously pointed to the particular object no longer points to it, e.g., because the object was deleted or reset to point to another object, and when the depth value of the another object is one less than the depth value of the particular object. If the particular object is determined to be live, its depth value, and the depth values of other objects it points to or “roots” are reset. If the particular object is dead, it is cleaned up.

REFERENCES:
patent: 5920876 (1999-07-01), Ungar et al.
patent: 6038572 (2000-03-01), Schwartz et al.
patent: 6115782 (2000-09-01), Wolczko et al.
patent: 6226761 (2001-05-01), Berstis
patent: 6289012 (2001-09-01), Harrington et al.
patent: 6317872 (2001-11-01), Gee et al.
patent: 6338159 (2002-01-01), Alexander et al.
patent: 6502110 (2002-12-01), Houldsworth
patent: 6502213 (2002-12-01), Bowman-Amuah
patent: 6513155 (2003-01-01), Alexander, III et al.
patent: 2002/0087590 (2002-07-01), Bacon et al.
patent: 2002/0107880 (2002-08-01), Bacon
Peter Dickman, Diffusion Tree Restructuring for Indirect Reference Counting, Jan. 2001, ACM Press, ACM SIGPLAN Notices, vol. 36, Issue 1, pp. 167-177.
S. Blackburn and K. McKinley, “Fast Garbage Collection without a Long Wait”, The Australian National University Joint Computer Science Technical Report Series, Nov. 2002.
David F. Bacon et al., “Java without the Coffee Breaks: A Non-intrusive Multiprocessor Garbage Collector,” Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices, vol. 36, No. 5, May 2001.
David F. Bacon et al., “Concurrent Collection if Reference Counted Systems,” Proceedings of the 15thEuropean Conference on Object-oriented Programming, J.L. Knudsen, ed., Lecture Notes in Computer Science, vol.2072, pp. 207-235, presented at U.C. Berkeley, Feb. 6, 2001.

Affiliated with

Also associated with

Rating

Depth counter used to reduce number of items to consider for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Depth counter used to reduce number of items to consider for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Depth counter used to reduce number of items to consider for... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2757944