-
公开(公告)号：US10423526B2
公开(公告)日：2019-09-24
申请号：US14743285
申请日：2015-06-18
发明人： Kiyokuni Kawachiya , Tamiya Onodera
摘要： A method for reducing the cost of stack scanning in garbage collection (GC) includes, in the GC of the first-generation heap area, registering, in a nursery object reference list prepared for each thread, one or more addresses, within each stack, which each refer to a nursery object, and updating a scanning unnecessary area starting pointer such that the addresses listed in the nursery object reference list are included in the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer. The method further includes, in the next GC of the first-generation heap area, for the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer, performing the GC processing on the addresses included in the nursery object reference list.
-
公开(公告)号：US20180314631A1
公开(公告)日：2018-11-01
申请号：US15581201
申请日：2017-04-28
CPC分类号： G06F12/0253 , G06F9/4843 , G06F12/0269 , G06F2212/1044
摘要： Garbage collection methods and systems include adding a data object to one of multiple queues owned by a first garbage collection thread. The queues include a public queue and multiple private queues. A task is popped from one of the plurality of queues to perform garbage collection. The public queue is swapped with one of the private plurality of private queues if there are no tasks in the public queue.
-
公开(公告)号：US20150169444A1
公开(公告)日：2015-06-18
申请号：US14567526
申请日：2014-12-11
发明人： Kiyokuni Kawachiya , Tamiya Onodera
IPC分类号： G06F12/02
摘要： A method for reducing the cost of stack scanning in garbage collection (GC) includes, in the GC of the first-generation heap area, registering, in a nursery object reference list prepared for each thread, one or more addresses, within each stack, which each refer to a nursery object, and updating a scanning unnecessary area starting pointer such that the addresses listed in the nursery object reference list are included in the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer. The method further includes, in the next GC of the first-generation heap area, for the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer, performing the GC processing on the addresses included in the nursery object reference list.
-
公开(公告)号：US09021496B2
公开(公告)日：2015-04-28
申请号：US13940570
申请日：2013-07-12
发明人： Kiyokuni Kawachiya , Rei Odaira , Tamiya Onodera
CPC分类号： G06F8/315 , G06F9/4488 , G06F12/0253
摘要： A method, system, and program for recording an object allocation site. In the structure of an object, a pointer to a class of an object is replaced by a pointer to an allocation site descriptor which is unique to each object allocation site, a common allocation site descriptor is used for objects created at the same allocation site, and the class of the object is accessed through the allocation site descriptor.
摘要翻译： 用于记录对象分配站点的方法，系统和程序。 在对象的结构中，指向对象类的指针由指向每个对象分配站点唯一的分配站点描述符的指针代替，对于在相同分配站点创建的对象使用公共分配站点描述符， 并且通过分配站点描述符访问对象的类。
-
公开(公告)号：US10740230B2
公开(公告)日：2020-08-11
申请号：US15299206
申请日：2016-10-20
IPC分类号： G06F16/00 , G06F12/02 , G06F16/188 , G06F16/10
摘要： A computer-implemented method and a computer processing system are provided for increasing memory density in a memory using heap contraction. The method includes dividing the heap into a plurality of work regions including a last region and other regions such the last region is larger in size than the other regions. The method further includes calculating a size of the heap contraction. The method also includes forming a pair of the last region and one of the other regions that has a largest free portion. The method additionally includes executing intra-table compaction and inter-table compaction on the heap. The method further includes contracting the last region by subtracting a prescribed space from the last region.
-
公开(公告)号：US10324837B2
公开(公告)日：2019-06-18
申请号：US16035110
申请日：2018-07-13
发明人： Tatsuhiro Chiba , Hiroshi Horii , Tamiya Onodera
IPC分类号： G06F12/02 , G06F3/06 , G06F12/0893 , G06F16/901 , G06F9/50
摘要： A computer-implemented method and system are provided for reducing garbage collection overhead. The method includes specifying, by a hardware processor from a set of nodes of a Directed Acyclic Graph representing an application program, wherein each of the nodes represents a respective one of a plurality of computation tasks, any of the nodes which store a respective computation result for at least a threshold period of time as cache nodes. The method further includes allocating, by the hardware processor, the respective computation result of each of the cache nodes into a tenure area of a memory.
-
公开(公告)号：US10324836B2
公开(公告)日：2019-06-18
申请号：US15806530
申请日：2017-11-08
摘要： Garbage collection methods include adding a data object to one of multiple queues owned by a first garbage collection thread. The queues include a public queue and multiple private queues. A task is popped from one of the plurality of queues to perform garbage collection. The public queue is swapped with one of the private plurality of private queues if there are no tasks in the public queue.
-
公开(公告)号：US20150286566A1
公开(公告)日：2015-10-08
申请号：US14743285
申请日：2015-06-18
发明人： Kiyokuni Kawachiya , Tamiya Onodera
IPC分类号： G06F12/02
摘要： A method for reducing the cost of stack scanning in garbage collection (GC) includes, in the GC of the first-generation heap area, registering, in a nursery object reference list prepared for each thread, one or more addresses, within each stack, which each refer to a nursery object, and updating a scanning unnecessary area starting pointer such that the addresses listed in the nursery object reference list are included in the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer. The method further includes, in the next GC of the first-generation heap area, for the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer, performing the GC processing on the addresses included in the nursery object reference list.
摘要翻译： 一种降低垃圾收集（GC）中堆栈扫描成本的方法包括：在第一代堆区域的GC中，在为每个线程准备的托儿对象引用列表中，在每个堆栈内注册一个或多个地址， 其中每个都指托管对象，并且更新扫描不必要的区域开始指针，使得托管对象引用列表中列出的地址被包括在从堆栈的底部到由扫描不必要区域开始指针指向的地址的区域中 。 该方法还包括在第一代堆区域的下一个GC中，对于从堆叠底部到扫描不必要区域起始指针指向的地址的区域，对包含在托儿所中的地址执行GC处理 对象引用列表。
-
公开(公告)号：US11314640B2
公开(公告)日：2022-04-26
申请号：US14567526
申请日：2014-12-11
发明人： Kiyokuni Kawachiya , Tamiya Onodera
摘要： A method for reducing the cost of stack scanning in garbage collection (GC) includes, in the GC of the first-generation heap area, registering, in a nursery object reference list prepared for each thread, one or more addresses, within each stack, which each refer to a nursery object, and updating a scanning unnecessary area starting pointer such that the addresses listed in the nursery object reference list are included in the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer. The method further includes, in the next GC of the first-generation heap area, for the area from the bottom of the stack to the address pointed to by the scanning unnecessary area starting pointer, performing the GC processing on the addresses included in the nursery object reference list.
-
公开(公告)号：US20180113805A1
公开(公告)日：2018-04-26
申请号：US15299206
申请日：2016-10-20
IPC分类号： G06F12/02
摘要： A computer-implemented method and a computer processing system are provided for increasing memory density in a memory using heap contraction. The method includes dividing the heap into a plurality of work regions including a last region and other regions such the last region is larger in size than the other regions. The method further includes calculating a size of the heap contraction. The method also includes forming a pair of the last region and one of the other regions that has a largest free portion. The method additionally includes executing intra-table compaction and inter-table compaction on the heap. The method further includes contracting the last region by subtracting a prescribed space from the last region.
-
-
-
-
-
-
-
-
-
搜索结果
20 条记录 (耗时 0.018 秒)
