Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-05-10
2005-05-10
Mizrahi, Diane D. (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06892212
ABSTRACT:
A computing apparatus and method classify data objects into at least a first type and alternatively a second type, and allocate a first portion of computer memory to objects of the first type and a second portion of computer memory to objects of the second type. Then the method performs garbage collection of data objects within at least one portion of computer memory while retaining surviving objects within the computer memory. Objects of the first type occur in a computer memory with a frequency that exceeds a selected threshold, and are designated “prolific.” Objects of the second type occur in the computer memory with a frequency that does not exceed the selected threshold, and are designated “non-prolific”.
REFERENCES:
patent: 5920876 (1999-07-01), Ungar et al.
patent: 5930807 (1999-07-01), Ebrahim et al.
patent: 5933840 (1999-08-01), Menon et al.
patent: 5953736 (1999-09-01), O'Connor et al.
patent: 6047295 (2000-04-01), Endicott et al.
patent: 6049810 (2000-04-01), Schwartz et al.
patent: 6070173 (2000-05-01), Huber et al.
patent: 6101580 (2000-08-01), Agesen et al.
patent: 6115782 (2000-09-01), Wolczko et al.
patent: 6131191 (2000-10-01), Cierniak et al.
patent: 6138127 (2000-10-01), Pasch
patent: 6148310 (2000-11-01), Azagury et al.
patent: 6185581 (2001-02-01), Garthwaite
patent: 6226761 (2001-05-01), Berstis
patent: 6249793 (2001-06-01), Printezis et al.
patent: 6438560 (2002-08-01), Loen
patent: 6502109 (2002-12-01), Aravamudan et al.
patent: 20010000821 (2001-05-01), Kolodner et al.
patent: 20020042807 (2002-04-01), Thomas et al.
patent: 20020120428 (2002-08-01), Christiaens
U.S. Appl. No. 60/278,060, filed Mar. 22, 2001.
U.S. Appl. No. 60/281,759, filed Apr. 5, 2001.
O. Agesen and A. Garthwaite, “Efficient Object Sampling Via Weak References,” pp. 121-126.
T. Harris, “Dynamic Adaptive Pre-Tenuring,” pp. 127-136, ISMM '00 Minneapolis, MN., copyright ACM 2000.
R. Jones and R. Lins, “Garbage Collection—Algorithms for Automatic Dynamic Memory Management,” “Generational Garbage Collection,” pp. 143-181, John Wiley & Sons, 1996.
A.L. Hosking, J.E.B. Moss, and D. Stefanovic, “A Comparative Performance Evaluation of Write Barrier Implementations,” pp. 1-18, Proceedings ACM Conference on Object-Oriented Programming Systems, Languages, and Applications; Vancouver, Canada, Oct. 1992, pp. 92-109.
H. Lieberman and C. Hewitt, “A Real-Time Garbage Collector Based on the Lifetimes of Objects,” Communications of the ACM, pp. 419-429, vol. 26, No. 6, 1983.
M.L. Seidl and B.G. Zorn, “Segregating Heap Objects by Reference Behavior and Lifetime,” ASPLOS VIII Oct. 1998, pp. 12-23.
Y. Shuf, M. Gupta, R. Bordawekar and J.P. Singh, “Exploiting Prolific Types for Memory Management and Optimizations,” POPL 2002, Jan. 16-18, 2002, Portland, OR.
Y. Shuf, M. Gupta, and R. Bordawekar, “Distinguishing Between Prolific and Non-Prolific Types for Efficient Memory Management,” pp. 1-13.
D. Stefanovic, K.S. McKinley, and J.E.B. Moss, “Age-Based Garbage Collection,” pp. 1-12, OOPSLA'99, Denver, Nov. 1999.
D. Stefanovic, K.S. McKinley, and J.E.B. Moss, “On Models for Object Lifetime Distributions,” pp. 137-142, ISMM '00, Minneapolos, MN, copyright ACM 2000.
D. Tarditi, and A. Diwan, “The Full Cost of a Generational Copying Garbage Collection Implementation,” pp. 1-8, Sep. 10, 1993.
P.R. Wilson, “Uniprocessor Garbage Collection Techniques,” [Submitted to ACM Computing Surveys], pp. 1-67.
P.R. Wilson, M.S. Johnstone, M. Neely, and D. Boles, “Dynamic Storage Allocation: A Survey and Critical Review,” pp. 1-78, Sep. 1995.
P.R. Wilson, “Uniprocessor Garbage Collection Techniques,” International Workshop on Memory Management, St. Malo, France, Sep. 1992.
S.M. Blackburn, J. Cavazos, S. Singhai, A., Khan, K.S. McKinley, J.E.B. Moss, and S. Smolensky, “Profile-Driven Pretenuring for Java,” OOPSLA 2000 Companion, Minneapolis, Minnesota.
Bordawekar Rajesh
Gupta Manish
Shuf Yefim
August Casey P.
Fleit Kain Gibbons Gutman Bongini & Bianco P.L.
Gutman Jose
International Business Machines - Corporation
Mizrahi Diane D.
LandOfFree
Method for efficient garbage collection based on object type 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 efficient garbage collection based on object type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for efficient garbage collection based on object type will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3400040