Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-05-31
2008-08-12
Vital, Pierre M. (Department: 2169)
Data processing: database and file management or data structures
Database design
Data structure types
C711S133000, C711S135000
Reexamination Certificate
active
07412466
ABSTRACT:
When calculating post-compaction destination addresses during sliding heap compaction, a block of contiguous memory objects may be treated as a single unit by adding the offset of each object in the block to the post-compaction address for the first object in the block. Additionally contiguous blocks of reachable objects may be constructed by creating deadwood objects, such as non-referenced, placeholder objects, into gaps between objects. Thus, post-compaction destination addresses for the object in the resulting contiguous block may be determined by adding the offset of an object within the block to the destination address for the first object in the block.
REFERENCES:
patent: 4989134 (1991-01-01), Shaw
patent: 5561786 (1996-10-01), Morse
patent: 5751613 (1998-05-01), Doty et al.
patent: 6300962 (2001-10-01), Wishoff et al.
patent: 6823351 (2004-11-01), Flood et al.
patent: 6826583 (2004-11-01), Flood et al.
patent: 6865585 (2005-03-01), Dussud
patent: 6996590 (2006-02-01), Borman
patent: 7016923 (2006-03-01), Garthwaite
patent: 7024436 (2006-04-01), Kolodner et al.
patent: 7031990 (2006-04-01), Garthwaite
patent: 7051056 (2006-05-01), Rodriguez-Rivera
patent: 7065617 (2006-06-01), Wang
patent: 7069280 (2006-06-01), Garthwaite
patent: 2004/0078381 (2004-04-01), Blandy et al.
patent: 2004/0128329 (2004-07-01), Ben-Yitzhak et al.
Author: Martin Larose and Marc Feeley, A compacting Incremental Collector and its Performance in a Production Quality Compiler, Oct. 1998, Proceedings of the 1st international symposium on Memory management ISMM '98, vol. 34 Issue 3.
“Garbage Collection”; Sep. 27, 2004; 7 pages; printed off website www.memorymanagement.org.
Edwards, “Artificial Intelligence Project-RLE and MIT Computation Center”; Memo 19-LISP II Garbage Collector; 2 pages, Mar. 1998.
Abuaiadh, et al; “An Efficient Parallel Heap Compaction Algorithm”; OOPSLA '04; Oct. 24-28, 2004; pp. 224-236; Vancouver, British Columbia, Canada.
Agesen, et al; “An Efficient Meta-Lock for Implementing Ubiquitous Synchronization”; Sun Microsystems; Apr. 1999; pp. 1-27; SMLI TR- 99-76; Palo Alto, CA; USA.
Agesen, et al; “Mixed-mode Bytecode Execution”; Sun Microsystems; Jun. 2000; pp. 1-20; SMLI TR-2000-87; Palo Alto, CA; USA.
Agesen; “GC Points in a Threaded Environment”; Sun Microsystems; Dec. 1998; pp. 1-20; SMLI TR-98-70; Palo Alto, CA; USA.
Ben-Yitzhak, et al; “An Algorithm for Parallel Incremental Compaction”; IBM Haifa Research Laboratory, Mount Carmel; Jun. 20-21, 2002; pp. 100-105; Berlin; Germany.
Appel; “Simple Generational Garbage Collection and Fast Allocation”; Department of Computer Science-Princeton Universtiy; Mar. 1998; 16 pages; Princeton, N.J., USA.
Detlefs, et al; “Inlining of Virtual Methods”; Sun Microsystems Laboratories; 21 pages; Burlington, MA, USA, Jan. 2003.
Flood, et al; “Parallel Garbage Collection for Shared Memory Multiprocessors”; Sun Microsystems; Apr. 2001; USA.
Kowert Robert C.
Meyertons Hood Kivlin Kowert & Goetzel P.C.
Obisesan Augustine
Sun Microsystems Inc.
Vital Pierre M.
LandOfFree
Offset-based forward address calculation in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Offset-based forward address calculation in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Offset-based forward address calculation in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4001414