公开(公告)号：US07389395B1

公开(公告)日：2008-06-17

申请号：US11169983

申请日：2005-06-26

申请人： Alexander T. Garthwaite ,  David P. Stoutamire ,  Peter B. Kessler ,  Y Srinivas Ramakrisha ,  David L. Detlefs ,  Antonios Printezis ,  Jon A. Masamitsu ,  John W. Coomes

发明人： Alexander T. Garthwaite ,  David P. Stoutamire ,  Peter B. Kessler ,  Y Srinivas Ramakrisha ,  David L. Detlefs ,  Antonios Printezis ,  Jon A. Masamitsu ,  John W. Coomes

IPC分类号： G06F12/00

CPC分类号： G06F12/0269 ,  G06F12/0253 ,  Y10S707/99953 ,  Y10S707/99957

摘要： A heap may be marked and compacted while performing only two passes over the objects and object references in the heap. Specifically, objects and object references are traversed once during a marking phase and again during a compaction phase of split-reference, two-pass mark-compaction. Object references are updated in two steps. First, during marking, each object reference may be updated to include the relative offset within its block of the referenced object and-during compaction that offset may be added to the block's destination address resulting in a reference that points to the actual post-compaction location for the referenced object. Objects of a particular block may be rearranged, or permuted, with respect to each other within the block. However, the order between groups of objects in different blocks may be preserved across compaction.

摘要翻译： 堆可以被标记和压缩，同时仅在堆中的对象和对象引用执行两次传递。 具体来说，在标记阶段期间遍历一次对象和对象引用，并在分割参考，二次标记压缩的压缩阶段再次遍历对象和对象引用。 对象引用有两个步骤更新。 首先，在标记期间，可以更新每个对象引用以包括其引用对象的块内的相对偏移量，并且 - 在压缩期间，该偏移可以被添加到块的目的地地址，导致指向实际的后压缩位置的引用 为引用的对象。 特定块的对象可以在块内相对于彼此重新布置或排列。 但是，不同块中的对象组之间的顺序可以在压缩之间保留。

公开(公告)号：US20080235305A1

公开(公告)日：2008-09-25

申请号：US11725918

申请日：2007-03-20

申请人： Antonios Printezis ,  John W. Coomes

发明人： Antonios Printezis ,  John W. Coomes

IPC分类号： G06F12/00

CPC分类号： G06F12/0253 ,  G06F2212/702

摘要： A technique for establishing a dense prefix for a memory in a computer system. Memory is divided into a plurality of chunks. An efficiency factor is generated for each chunk in one or more chunks contained in the plurality of chunks. The efficiency factor may be based on an amount of memory to be reclaimed, an amount of memory to be scanned and an amount of memory to be copied relative to the chunk. A dense prefix is then established for the memory based on an efficiency factor associated with a chunk.

摘要翻译： 一种用于为计算机系统中的存储器建立密集前缀的技术。 存储器被分成多个块。 为包含在多个块中的一个或多个块中的每个块生成效率因子。 效率因子可以基于待回收的存储器的量，要被扫描的存储器的量和相对于块被复制的存储器的量。 然后基于与块相关联的效率因子为存储器建立密集前缀。

公开(公告)号：US07853627B2

公开(公告)日：2010-12-14

申请号：US11725918

申请日：2007-03-20

申请人： Antonios Printezis ,  John W. Coomes

发明人： Antonios Printezis ,  John W. Coomes

IPC分类号： G06F12/02 ,  G06F17/30

CPC分类号： G06F12/0253 ,  G06F2212/702

摘要： A technique for establishing a dense prefix for a memory in a computer system. Memory is divided into a plurality of chunks. An efficiency factor is generated for each chunk in one or more chunks contained in the plurality of chunks. The efficiency factor may be based on an amount of memory to be reclaimed, an amount of memory to be scanned and an amount of memory to be copied relative to the chunk. A dense prefix is then established for the memory based on an efficiency factor associated with a chunk.

摘要翻译： 一种用于为计算机系统中的存储器建立密集前缀的技术。 存储器被分成多个块。 为包含在多个块中的一个或多个块中的每个块生成效率因子。 效率因子可以基于待回收的存储器的量，要被扫描的存储器的量和相对于块被复制的存储器的量。 然后基于与块相关联的效率因子为存储器建立密集前缀。