Methods and apparatus for concurrently executing a garbage...

Data processing: database and file management or data structures – Garbage collection – Mark-sweep

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07840612

ABSTRACT:
According to the present disclosure, one or more processors of a computer device (e.g. a mobile communication device) are operative to execute a garbage collection program and an application program concurrently with execution of the garbage collection program. The garbage collection program is operative to identify a root set of referenced objects of an application program, where a reference indicator in a reference indicator array is set as referenced for each one of such referenced objects, and to perform a mark and sweep process based on the root set of referenced objects. The application program has computer instructions which includes a predefined computer instruction (e.g. a GETREF instruction) adapted to retrieve a reference from a target object and to set a reference indicator in the reference indicator array as referenced for the target object when executed. Advantageously, execution of the application program need not be unreasonably suspended during garbage collection processes. In one illustrative example, the application program is adapted to receive and/or provide information via a user interface of the computer device, and the concurrent processing allows for the receiving and/or providing of the information via the user interface without interference (e.g. suspension or delay) during the mark and sweep process.

REFERENCES:
patent: 5845298 (1998-12-01), O'Connor et al.
patent: 5930807 (1999-07-01), Ebrahim et al.
patent: 6339779 (2002-01-01), Houldsworth
patent: 6349314 (2002-02-01), Patel
patent: 6804762 (2004-10-01), Dussud et al.
patent: 6907437 (2005-06-01), Trotter
patent: 7483930 (2009-01-01), Wright et al.
patent: 2004/0248612 (2004-12-01), Lee et al.
patent: 2005/0129235 (2005-06-01), Little et al.
patent: 2005/0198088 (2005-09-01), Subramoney et al.
patent: 1785873 (2007-05-01), None
patent: 1569108 (2009-08-01), None
“A Tool for Monitoring and recording heap-allocated object behavior”, by Qingfeng Duan, 1995. http://www.cs.unm.edu/˜darko/papers/duan-ms-thesis.pdf.
“Exerience with Ratargeting the Java HotSpot”, Todd Smith et al. , p. 1-9, 2002. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1016507&isnumber=21854.
Myrrh: A Transaction-based model for Autonomic Recovery. Guy et al. p. 1-11, 2005.
Angelscript Change Log. Version 2.1.0—Apr. 3, 2005. http://www.angelcode.com/angelscript/sdk/docs/articles/changes2.html.
European Search Report for EP Application# 06122771.6, Dated Mar. 30, 2007.
Stephen M. Blackburn , “Starting with Termination: A Methodology For Building Distributed Garbage Collection Algorithms”, Computer Science Conference, Jan. 29, 2001, pp. 20-28, vol. XP010534687.
Tony Printezis, “A Generational Mostly-concurrent Garbage Collector”, A Generational Mostly-concurrent Garbage Collector, 1998, pp. 1-12.
Katherine Barabash, “Mostly Concurrent Garbage Collection Revisited”, Mostly Concurrent Garbage Collection Revisited, Oct. 26-30, 2003, pp. 1-14.

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

Methods and apparatus for concurrently executing a garbage... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and apparatus for concurrently executing a garbage..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and apparatus for concurrently executing a garbage... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4193319

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