专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050132374A1 Work stealing queues for parallel garbage collection 有权
标题翻译：并行垃圾收集工作窃取队列
公开(公告)号：US20050132374A1
公开(公告)日：2005-06-16
申请号：US10996508
申请日：2004-11-23
申请人： Christine Flood , David Detlefs , Nir Shavit , Xiaolan Zhang , Ole Agesen
发明人： Christine Flood , David Detlefs , Nir Shavit , Xiaolan Zhang , Ole Agesen
IPC分类号： G06F9/46 , G06F12/02 , G06F17/30
CPC分类号： G06F12/0276 , Y10S707/99953 , Y10S707/99957
摘要： A multiprocessor, multi-program, stop-the-world garbage collection program is described. The system initially over partitions the root sources, and then iteratively employs static and dynamic work balancing. Garbage collection threads compete dynamically for the initial partitions. Work stealing double-ended queues, where contention is reduced, are described to provide dynamic load balancing among the threads. Contention is resolved by using atomic instructions. The heap is broken into a young and an old generation where parallel semi-space copying is used to collect the young generation and parallel mark-compacting the old generation. Speed and efficiency of collection is enhanced by use of card tables and linking objects, and overflow conditions are efficiently handled by linking using class pointers. A garbage collection termination employs a global status word.
摘要翻译：描述了一个多处理器，多程序，停止世界的垃圾收集程序。系统最初对根源进行分区，然后迭代地采用静态和动态的工作平衡。垃圾收集线程可以动态竞争初始分区。被描述为在线程之间提供动态负载平衡的工作窃取双端队列，其中争用减少。竞争通过使用原子指令来解决。堆被打破成一个年轻和老一代，平行的半空间复制用于收集年轻一代和平行的标记压实老一代。通过使用卡表和链接对象来增强收集的速度和效率，并且通过使用类指针进行链接来有效地处理溢出条件。垃圾收集终端采用全局状态字。

2. 发明申请

US20070157214A1 Lock-free double-ended queue based on a dynamic ring 有权
标题翻译：基于动态环的无锁双端队列
公开(公告)号：US20070157214A1
公开(公告)日：2007-07-05
申请号：US11325209
申请日：2006-01-03
申请人： Paul Martin , Guy Steele , Christine Flood
发明人： Paul Martin , Guy Steele , Christine Flood
IPC分类号： G06F9/46
CPC分类号： G06F9/52 , G06F7/785 , G06F9/544
摘要： One embodiment of the present invention provides a system that facilitates performing operations on a lock-free double-ended queue (deque). This deque is implemented as a doubly-linked list of nodes formed into a ring, so that node pointers in one direction form an inner ring, and node pointers in the other direction form an outer ring. The deque has an inner hat, which points to a node next to the last occupied node along the inner ring, and an outer hat, which points to a node next to the last occupied node along the outer ring. The system uses a double compare-and-swap (DCAS) operation while performing pop and push operations onto either end of the deque, as well as growing and shrinking operations to change the number of nodes that are in the ring used by the deque.
摘要翻译：本发明的一个实施例提供一种有助于在无锁双端队列（deque）上执行操作的系统。该deque被实现为形成环的节点的双向链表，使得在一个方向上的节点指针形成内环，并且在另一方向上的节点指针形成外环。德克有一个内帽，它指向沿着内圈的最后一个占用节点旁边的一个节点，以及一个外帽，它指向沿着外圈的最后占用节点旁边的一个节点。系统使用双重比较和交换（DCAS）操作，同时在deque的任一端执行弹出和推送操作，以及增长和缩小操作以更改由deque使用的环中的节点数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式