Memory management

Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S100000, C711S151000, C711S158000, C711S165000, C711S170000

Reexamination Certificate

active

07117318

ABSTRACT:
A technique for managing an object in memory is disclosed. The technique comprises: assigning the object to an assigned frame wherein the object can be released when the assigned frame is released; detecting an attempt to place a reference to the object in an older frame, the older frame being older than the assigned frame; and reassigning the object to a reassignment frame that is at least as old as the older frame.

REFERENCES:
patent: 4422145 (1983-12-01), Sacco et al.
patent: 5485613 (1996-01-01), Engelstad et al.
patent: 5491808 (1996-02-01), Geist, Jr.
patent: 5893121 (1999-04-01), Ebrahim et al.
patent: 6047125 (2000-04-01), Agesen et al.
patent: 6192517 (2001-02-01), Agesen et al.
patent: 6505344 (2003-01-01), Blais et al.
Hansen et al., “An Experimental Study of Renewal-Older-First Garbage Collection,” ACM, pp. 247-258, Oct. 2002.
Blackburn et al., “Beltway: Getting Around Garbage Collection Gridlock,” ACM, pp. 153-164, Jun. 2002.
Domani, Tamar, et al, “Thread-Local Heaps for Java”, IBM Haifa Research Laboratory, ISMM '02, Jun. 20-21, 2002, Berlin Germany.

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

Memory management does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Memory management, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory management will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3718340

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