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

21. 发明授权

US06826583B1 Local allocation buffers for parallel garbage collection 有权
标题翻译：用于并行垃圾收集的本地分配缓冲区
公开(公告)号：US06826583B1
公开(公告)日：2004-11-30
申请号：US09697228
申请日：2000-10-25
申请人： Christine H. Flood , David L. Detlefs , Alexander T. Garthwaite
发明人： Christine H. Flood , David L. Detlefs , Alexander T. Garthwaite
IPC分类号： G06F1730
CPC分类号： G06F12/0269 , G06F12/0276 , Y10S707/99957
摘要： A multiprocessor, multiprogram, 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 atomic instructions. The heap is broken into a young and an old generation where semi-space copying employing local allocation buffers is used to collect the reachable objects in the young section, and for promoting objects from the young to the old generations, and parallel mark-compacting is used for collecting the old generation. Efficiency of collection is enhanced by use of card tables and linking objects, and overflow conditions are efficiently handled by linking using class pointers. The garbage collection termination using a global status word is employed.
摘要翻译：描述了一个多处理器，多路程序，世界垃圾收集程序。系统最初对根源进行分区，然后迭代地采用静态和动态的工作平衡。垃圾收集线程可以动态竞争初始分区。被描述为在线程之间提供动态负载平衡的工作窃取双端队列，其中争用减少。竞争由原子指令解决。堆被打破成一个年轻的老一代，使用本地分配缓冲区的半空间复制来收集年轻部分中可达到的对象，并且用于促进从年轻到老一代的对象，并行标记压缩是用于收集老一代。通过使用卡表和链接对象来增强收集的效率，并且通过使用类指针链接来有效地处理溢出条件。使用全局状态字的垃圾回收终止。

22. 发明授权

US6047125A Garbage collection system for improved use of memory by removal of reference conflicts 失效
标题翻译：垃圾收集系统通过消除参考冲突来改善记忆的使用
公开(公告)号：US6047125A
公开(公告)日：2000-04-04
申请号：US942292
申请日：1997-10-01
申请人： Ole Agesen , David L. Detlefs
发明人： Ole Agesen , David L. Detlefs
IPC分类号： G06F9/45 , G06F12/02 , G06F9/44
CPC分类号： G06F8/443 , G06F12/023 , G06F12/0253 , Y10S707/99952 , Y10S707/99953
摘要： In accordance with the present invention a method for modifying a sequence of instructions to improve memory management within a storage device during execution of the instructions, comprises the steps, performed by a processor, of (a) analyzing the sequence of instructions for a conflict indicating an undeterminable variable type, (b) determining the type of conflict, and (c) modifying the sequence of instructions to eliminate the conflict based on the determination.
摘要翻译：根据本发明，一种用于在执行指令期间修改指令序列以改善存储设备内的存储器管理的方法包括由处理器执行的步骤（a）分析用于冲突的冲突指令序列不确定的变量类型，（b）确定冲突的类型，以及（c）根据确定修改消除冲突的指令序列。

23. 发明授权

US08959501B2 Type and length abstraction for data types 有权
标题翻译：数据类型的类型和长度抽象
公开(公告)号：US08959501B2
公开(公告)日：2015-02-17
申请号：US12968148
申请日：2010-12-14
申请人： Carol Thompson Eidt , David L. Detlefs
发明人： Carol Thompson Eidt , David L. Detlefs
IPC分类号： G06F9/45 , G06F9/44 , G06F9/455
CPC分类号： G06F8/20 , G06F9/45516
摘要： Embodiments are directed to implementing a generic SIMD data type in software code. In an embodiment, a computer system accesses a portion of software code that includes an algorithm with a generic SIMD data type that includes a variable number of elements. The algorithm with the generic SIMD data type is to be processed by a specific processor that includes various specific hardware features. The computer system determines at runtime a portion of customized processor-specific code that is to be used with the specified processor based on the generic SIMD data type, wherein the runtime determination resolves the number of elements that are to be used with the specified processor. The computer system also processes the software code including the algorithm with the generic SIMD data type using the determined, customized processor-specific code.
摘要翻译：实施例涉及在软件代码中实现通用SIMD数据类型。在一个实施例中，计算机系统访问包括具有包括可变数目的元素的通用SIMD数据类型的算法的软件代码的一部分。具有通用SIMD数据类型的算法将由包括各种特定硬件特征的特定处理器处理。计算机系统在运行时确定将基于通用SIMD数据类型与指定处理器一起使用的定制处理器特定代码的一部分，其中，运行时确定解决将与指定处理器一起使用的元素的数量。计算机系统还使用确定的定制的处理器特定代码来处理包括具有通用SIMD数据类型的算法的软件代码。

24. 发明授权

US08533440B2 Accelerating parallel transactions using cache resident transactions 有权
标题翻译：使用缓存常驻事务来加速并行事务
公开(公告)号：US08533440B2
公开(公告)日：2013-09-10
申请号：US12638214
申请日：2009-12-15
申请人： Yosseff Levanoni , David L. Detlefs , Jan S. Gray
发明人： Yosseff Levanoni , David L. Detlefs , Jan S. Gray
IPC分类号： G06F12/00
CPC分类号： G06F9/466 , G06F9/526
摘要： Handling parallelism in transactions. A method includes beginning a cache resident transaction. The method further includes encountering a nested structured parallelism construct within the cache resident transaction. A determination is made as to whether the transaction would run faster serially in cache resident mode or faster parallel in software transactional memory mode for the overall transaction. In the software transactional memory mode, cache resident mode is used for one or more hierarchically lower nested transactions. The method further includes continuing the transaction in the mode determined.
摘要翻译：处理交易中的并行性。一种方法包括开始缓存常驻事务。该方法还包括在缓存驻留事务中遇到嵌套的结构化并行结构。确定在整个交易中，在高速缓存驻留模式下，交易是否会以更快的顺序运行，或者在软件事务性存储器模式下更快的并行运行。在软件事务内存模式中，缓存驻留模式用于一个或多个层次较低的嵌套事务。该方法还包括以确定的模式继续交易。

25. 发明申请

US20100275209A1 READER/WRITER LOCK WITH REDUCED CACHE CONTENTION 有权
标题翻译：读/写锁定与减少缓存的内容
公开(公告)号：US20100275209A1
公开(公告)日：2010-10-28
申请号：US12430903
申请日：2009-04-28
申请人： David L. Detlefs
发明人： David L. Detlefs
IPC分类号： G06F9/46 , G06F12/00 , G06F12/08
CPC分类号： G06F9/526 , G06F12/0842 , G06F2209/523
摘要： A scalable locking system is described herein that allows processors to access shared data with reduced cache contention to increase parallelism and scalability. The system provides a reader/writer lock implementation that uses randomization and spends extra space to spread possible contention over multiple cache lines. The system avoids updates to a single shared location in acquiring/releasing a read lock by spreading the lock count over multiple sub-counts in multiple cache lines, and hashing thread identifiers to those cache lines. Carefully crafted invariants allow the use of partially lock-free code in the common path of acquisition and release of a read lock. A careful protocol allows the system to reuse space allocated for a read lock for subsequent locking to avoid frequent reallocating of read lock data structures. The system also provides fairness for write-locking threads and uses object pooling techniques to make reduce costs associated with the lock data structures.
摘要翻译：这里描述了可扩展的锁定系统，其允许处理器以减少的高速缓存争用来访问共享数据，以增加并行性和可扩展性。该系统提供使用随机化的读/写器锁实现，并花费额外的空间来扩展多个缓存线上的可能争用。该系统通过在多个高速缓存行中扩展锁定计数超过多个子计数，并且将线程标识符散列到这些高速缓存行中，从而避免在获取/释放读取锁定时对单个共享位置进行更新。精心制作的不变量允许在获取和释放读锁的通用路径中使用部分无锁代码。一个谨慎的协议允许系统重用分配给读锁的空间，以便后续的锁定，以避免频繁重新分配读锁定数据结构。该系统还为写锁线程提供了公平性，并使用对象池技术来降低与锁数据结构相关的成本。

26. 发明授权

US07805467B2 Code preparation technique employing lock-free pointer operations 有权
标题翻译：采用无锁指针操作的代码准备技术
公开(公告)号：US07805467B2
公开(公告)日：2010-09-28
申请号：US11343678
申请日：2006-01-30
申请人： Mark S. Moir , David L. Detlefs , Simon Doherty , Maurice P. Herlihy , Victor M. Luchangco , Paul A. Martin , Guy L. Steele, Jr.
发明人： Mark S. Moir , David L. Detlefs , Simon Doherty , Maurice P. Herlihy , Victor M. Luchangco , Paul A. Martin , Guy L. Steele, Jr.
IPC分类号： G06F12/00
CPC分类号： G06F12/0261 , G06F9/46 , G06F9/526
摘要： A methodology has been discovered for transforming garbage collection-dependent algorithms, shared object implementations and/or concurrent software mechanisms into a form that does not presume the existence of an independent, or execution environment provided, garbage collector. Algorithms, shared object implementations and/or mechanisms designed or transformed using techniques described herein provide explicit reclamation of storage using lock-free pointer operations. Transformations can be applied to lock-free algorithms and shared object implementations and preserve lock-freedom of such algorithms and implementations. As a result, existing and future lock-free algorithms and shared object implementations that depend on a garbage-collected execution environment can be exploited in environments that do not provide garbage collection. Furthermore, algorithms and shared object implementations that employ explicit reclamation of storage using lock-free pointer operations such as described herein may be employed in the implementation of a garbage collector itself.
摘要翻译：已经发现了一种方法，用于将垃圾回收依赖算法，共享对象实现和/或并发软件机制转换为不假定存在独立或执行环境（垃圾收集器）的形式。使用本文描述的技术设计或变换的算法，共享对象实现和/或机制使用无锁指针操作来提供存储的显式回收。转换可以应用于无锁算法和共享对象实现，并保持这种算法和实现的锁定自由度。因此，依赖于垃圾回收执行环境的现有和将来的无锁算法和共享对象实现可以在不提供垃圾回收的环境中被利用。此外，使用如本文所述的无锁定指针操作的使用显式回收存储的算法和共享对象实现可以用于实现垃圾收集器本身。

27. 发明申请

US20100228929A1 EXPEDITED COMPLETION OF A TRANSACTION IN STM 审中-公开
标题翻译：在STM中进行交易的预期完成
公开(公告)号：US20100228929A1
公开(公告)日：2010-09-09
申请号：US12400209
申请日：2009-03-09
申请人： David L. Detlefs , Yosseff Levanoni , Weirong Zhu , Dana Groff , Alexander Dadiomov
发明人： David L. Detlefs , Yosseff Levanoni , Weirong Zhu , Dana Groff , Alexander Dadiomov
IPC分类号： G06F12/02
CPC分类号： G06F9/467
摘要： A software transactional memory system is provided that provides privatization safety. The system identifies situations where the completion of a transaction may be expedited because a privatization artifact will not occur. The system determines whether a privatization artifact may occur using a read and write set intersection test, transactional variables, pessimistic locks, or declared privatizing transactions. If a privatization artifact will not occur for a transaction, then the system may allow the transaction to complete prior to one or more earlier transactions.
摘要翻译：提供了提供私有化安全性的软件事务内存系统。系统识别事务的完成可能因为私有化工件不会发生而加快的情况。系统使用读写集合交集测试，事务变量，悲观锁或已声明的私有化事务来确定私有化工件是否可能发生。如果事务不会发生私有化工件，则系统可能允许事务在一个或多个较早的事务之前完成。

28. 发明授权

US07779054B1 Heuristic-based resumption of fully-young garbage collection intervals 有权
标题翻译：基于启发式的恢复全年垃圾收集间隔
公开(公告)号：US07779054B1
公开(公告)日：2010-08-17
申请号：US11239992
申请日：2005-09-30
申请人： Antonios Printezis , David L. Detlefs
发明人： Antonios Printezis , David L. Detlefs
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F12/0276
摘要： A method for heuristic-based resumption of fully-young garbage collection intervals comprises allocating memory to objects within one or more regions of a heap partitioned into a plurality of regions, and classifying each heap region as belonging to a category of a plurality of categories based at least in part on the recency of allocation of objects within the regions. The method may further comprise determining, using a garbage collection efficiency metric, whether regions belonging to a first category of the plurality of categories are to be excluded from a collection set of a particular garbage collection interval on the heap. In response to determining that the first category of regions is to be excluded, the method may comprise selecting a collection set that does not include any regions of the first category, and reclaiming memory from that collection set.
摘要翻译：一种用于基于启发式恢复全年垃圾收集间隔的方法包括：将存储器分配给划分成多个区域的堆的一个或多个区域内的对象，并将每个堆区域分类为属于多个类别的类别至少部分地是区域内对象的分配情况。该方法还可以包括：使用垃圾收集效率度量来确定属于多个类别的第一类别的区域是否将从堆上的特定垃圾收集间隔的集合集中排除。响应于确定要排除第一类别的区域，该方法可以包括选择不包括第一类别的任何区域的收集集合，以及从该集合集合回收存储器。

29. 发明申请

US20090327291A1 PRIMITIVES FOR SOFTWARE TRANSACTIONAL MEMORY 有权
标题翻译：软件交易记忆的原则
公开(公告)号：US20090327291A1
公开(公告)日：2009-12-31
申请号：US12163402
申请日：2008-06-27
申请人： Yosseff Levanoni , David L. Detlefs , Michael M. Magruder , Vinod K. Grover
发明人： Yosseff Levanoni , David L. Detlefs , Michael M. Magruder , Vinod K. Grover
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F9/528
摘要： Software transactional memory (STM) primitives are provided that allow the results of prior open calls to be used by subsequent open calls either as-is or through another STM primitive that consumes the results of the previous invocation. The STM primitives are configured to ensure that the address of a shadow copy representing a memory location will not changed across a wide range of operations and thereby enable re-use of the shadow copy.
摘要翻译：提供了软件事务存储器（STM）原语，其允许先前的打开调用的结果被按照原样或通过消耗先前调用的结果的另一个STM原语的后续打开调用来使用。 STM原语配置为确保表示内存位置的卷影副本的地址不会在广泛的操作范围内发生变化，从而可以重新使用卷影副本。

30. 发明授权

US07539849B1 Maintaining a double-ended queue in a contiguous array with concurrent non-blocking insert and remove operations using a double compare-and-swap primitive 有权
标题翻译：在具有并发的非阻塞插入和删除操作的连续数组中维护双端口队列，使用双重比较和交换原语
公开(公告)号：US07539849B1
公开(公告)日：2009-05-26
申请号：US09547288
申请日：2000-04-11
申请人： Nir N. Shavit , Ole Agesen , David L. Detlefs , Christine H. Flood , Alexander T. Garthwaite , Paul A. Martin , Guy L. Steele, Jr.
发明人： Nir N. Shavit , Ole Agesen , David L. Detlefs , Christine H. Flood , Alexander T. Garthwaite , Paul A. Martin , Guy L. Steele, Jr.
IPC分类号： G06F7/06
CPC分类号： G06F9/52 , G06F9/544 , Y10S707/99942
摘要： An array-based concurrent shared object implementation has been developed that provides non-blocking and linearizable access to the concurrent shared object. In an application of the underlying techniques to a deque, the array-based algorithm allows uninterrupted concurrent access to both ends of the deque, while returning appropriate exceptions in the boundary cases when the deque is empty or full. An interesting characteristic of the concurrent deque implementation is that a processor can detect these boundary cases, e.g., determine whether the array is empty or full, without checking the relative locations of the two end pointers in an atomic operation.
摘要翻译：已经开发了一种基于数组的并发共享对象实现，它提供对并发共享对象的非阻塞和线性化访问。在将Deck的基础技术应用于deque时，基于阵列的算法允许对deque两端进行不间断的并发访问，同时在deque为空或满时在边界情况下返回适当的异常。并发deque实现的一个有趣的特征是，处理器可以检测这些边界情况，例如，确定阵列是空还是满，而不检查原子操作中两个终端指针的相对位置。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式