公开(公告)号：US20050198088A1

公开(公告)日：2005-09-08

申请号：US10793707

申请日：2004-03-03

Applicant: Sreenivas Subramoney ,  Richard Hudson

Inventor： Sreenivas Subramoney ,  Richard Hudson

IPC: G06F17/30

CPC classification number: G06F16/2308

Abstract: An arrangement is provided for using only one bit vector per heap block to improve the concurrency and parallelism of mark-sweep-compact garbage collection in a managed runtime system. A heap may be divided into a number of heap blocks. Each heap block has only one bit vector used for marking, compacting, and sweeping, and in that bit vector only one bit is needed per word or double word in that heap block. Both marking and sweeping phases may proceed concurrently with the execution of applications. Because all information needed for marking, compacting, and sweeping is contained in a bit vector for a heap block, multiple heap blocks may be marked, compacted, or swept in parallel through multiple garbage collection threads. Only a portion of heap blocks may be selected for compaction during each garbage collection to make the compaction incremental to reduce the disruptiveness of compaction to running applications and to achieve a fine load-balance of garbage collection process.

Abstract translation: 提供了一种仅对每个堆块使用一个位向量来提高被管理的运行时系统中标记扫描紧凑垃圾收集的并发性和并行性的布置。 堆可以分为多个堆块。 每个堆块只有一个位向量用于标记，压缩和扫描，并且在该位向量中，该堆块中每个字或双字只需要一个位。 标记和扫描阶段都可以与应用程序的执行同时进行。 因为标记，压缩和扫描所需的所有信息都包含在堆块的位向量中，所以可以通过多个垃圾回收线程并行地标记，压缩或扫描多个堆块。 在每个垃圾收集期间，只能选择一部分堆块进行压缩，以使压缩增量减少压缩对运行应用程序的破坏性，并实现垃圾收集过程的精细负载平衡。

公开(公告)号：US20050138329A1

公开(公告)日：2005-06-23

申请号：US10741897

申请日：2003-12-19

Applicant: Sreenivas Subramoney ,  Mauricio Serrano ,  Richard Hudson ,  Ali-Reza Adl-Tabatabai

Inventor： Sreenivas Subramoney ,  Mauricio Serrano ,  Richard Hudson ,  Ali-Reza Adl-Tabatabai

IPC: G06F9/45 ,  G06F12/02 ,  G06F15/00

CPC classification number: G06F12/0253 ,  G06F12/0862 ,  G06F2212/6026

Abstract: Methods and apparatus to dynamically insert prefetch instructions are disclosed. In an example method, one or more samples associated with cache misses are identified from a performance monitoring unit in a processor system. Based on sample information associated with the one or more samples, delinquent information is generated. To dynamically insert one or more prefetch instructions, a prefetch point is identified based on the delinquent information.

Abstract translation: 公开了动态插入预取指令的方法和装置。 在示例性方法中，与处理器系统中的性能监视单元识别与高速缓存未命中相关联的一个或多个样本。 根据与一个或多个样本相关联的样本信息，生成违法信息。 为了动态地插入一个或多个预取指令，基于拖欠信息来识别预取点。

公开(公告)号：US20050114413A1

公开(公告)日：2005-05-26

申请号：US10719443

申请日：2003-11-21

Applicant: Sreenivas Subramoney ,  Richard Hudson

Inventor： Sreenivas Subramoney ,  Richard Hudson

IPC: G06F12/02 ,  G06F17/30

CPC classification number: G06F12/0269 ,  Y10S707/99944 ,  Y10S707/99957

Abstract: An arrangement is provided for using bit vector toggling to achieve concurrent mark-sweep garbage collection in a managed runtime system. A heap may be divided into a number of heap blocks. Each heap block may contain a mark bit vector pointer, a sweep bit vector pointer, and two bit vectors of which one may be initially pointed to by the mark bit vector pointer and used for marking and the other may be initially pointed to by the sweep bit vector pointer and used for sweeping. At the end of the marking phase for a heap block, the bit vector used for marking and the bit vector used for sweeping may be toggled so that marking phase and sweeping phase may proceed concurrently and both phases may proceed concurrently with mutators.

Abstract translation: 提供了一种使用位向量切换在托管运行时系统中实现同时标记扫描垃圾收集的布置。 堆可以分为多个堆块。 每个堆块可以包含标记位向量指针，扫描位矢量指针和两个位向量，其中可以由标记位向量指针最初指向并用于标记的两个位向量，另一个可以由扫描开始指向 位向量指针并用于扫描。 在堆块的标记阶段结束时，可以切换用于标记的位向量和用于扫描的位向量，以便同时进行标记相位和扫描阶段，并且两个阶段可以与变异器同时进行。