Patent ID: 7389395
Filing Date: 2008-06-17
Classification: G06F,Y10S

Abstract:
1. A method for compacting a computer memory heap, comprising: logically partitioning the heap into a plurality of logical blocks, wherein the heap comprises a plurality of reachable objects, wherein each of the plurality of reachable objects has a starting address in an associated one of plurality of blocks; determining, for each of one or more of the plurality of reachable objects, an offset corresponding to a post-compaction address for the respective reachable object relative to a post-compaction address for an associated one of the blocks; and wherein the respective offset for at least one of the one or more reachable objects is based on a combined size of one or more other reachable objects, wherein the at least one reachable object and the one or more other reachable objects are associated with a single associated one of the blocks.