Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories
Reexamination Certificate
2008-07-31
2011-12-20
Doan, Duc (Department: 2185)
Electrical computers and digital processing systems: memory
Storage accessing and control
Hierarchical memories
Reexamination Certificate
active
08082399
ABSTRACT:
Cache bounded reference counting for computer languages having automated memory management in which, for example, a reference to an object “Z” initially stored in an object “O” is fetched and the cache hardware is queried whether the reference to the object “Z” is a valid reference, is in a cache, and has a continuity flag set to “on”. If the object “Z” is a valid reference, is in the cache, and has a continuity flag set to “on”, the object “O” is locked for an update, a reference counter is decremented for the object “Z” if the object “Z” resides in the cache, and a return code is set to zero to indicate that the object “Z” is de-referenced and that its storage memory can be released and re-used if the reference counter for the object “Z” reaches zero. Thereafter, the cache hardware is similarly queried regarding an object “N” that will become a new reference of object “O”.
REFERENCES:
patent: 6434576 (2002-08-01), Garthwaite
patent: 6839726 (2005-01-01), Kawamoto
patent: 7774546 (2010-08-01), Wright et al.
patent: 2005/0283771 (2005-12-01), Paller
patent: 2007/0203960 (2007-08-01), Guo
Choi, Jong-Deok, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar and Sam Midkiff. “Escape Analysis for Java” 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA99). Denver, Colorado, Nov. 1, 1999.
Ho, C. Y., W. Y. Lo and Anthony S. S. Fong. “Memory Garbage Collection for an Object-Oriented Processor” Proceedings of the International Conference on Information Technology; pp. 522-527: 2007.
Meyer, Matthias. “An On-Chip Garbage Collection Coprocessor for Embedded Real-Time Systems” Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications; pp. 517-524: Aug. 2005.
Chilimbi, Trishul M. and James R. Larus. “Using Generational Garbage Collection to Implement Cache-Conscious Data Placement” Proceedings of the 1st International Symposium on Memory Management; pp. 37-48: 1998.
Paller, Gabor. “Increasing Java Performance in Memory-Constrained Environments Using Explicit Memory Deallocation” International Workshop on Mobility Aware Computing; 2005.
Nilsen, Kelvin D. “Cost-Effective Hardware-Assisted Real-Time Garbage Collection” ACM PLDI Workshop on Language, Compiler, and Tool Support for Real-Time Systems; Jun. 1994.
Burtscher, Martin, Amer Diwan and Matthias Hauswirth. “Static Load Classification for Improving the Value Predictability of Data-Cache Misses” ACM SIGPLAN Notices; vol. 37, Issue 5 (May 2002) Session: Dynamic Prefetching & Cache Optimizations; pp. 222-233; 2002.
Wright, Greg, Matthew L. Seidl and Mario Wolczko. “An Object-Aware Memory Architecture” Science of Computer Programming archive; vol. 62, Issue 2 (Oct. 2006); Special issue on five perspectives on modern memory management: Systems, hardware and theory; pp. 145-163; 2006.
Haessler Achim
Nosse Markus
Pasch Eberhard
Tast Hans-Werner
Zipp Elmar
Doan Duc
International Business Machines - Corporation
King & Spalding
LandOfFree
Cache bounded reference counting does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Cache bounded reference counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache bounded reference counting will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4254400