会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Code preparation technique employing lock-free pointer operations
    • 采用无锁指针操作的代码准备技术
    • US07805467B2
    • 2010-09-28
    • US11343678
    • 2006-01-30
    • Mark S. MoirDavid L. DetlefsSimon DohertyMaurice P. HerlihyVictor M. LuchangcoPaul A. MartinGuy L. Steele, Jr.
    • Mark S. MoirDavid L. DetlefsSimon DohertyMaurice P. HerlihyVictor M. LuchangcoPaul A. MartinGuy L. Steele, Jr.
    • G06F12/00
    • G06F12/0261G06F9/46G06F9/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.
    • 已经发现了一种方法,用于将垃圾回收依赖算法,共享对象实现和/或并发软件机制转换为不假定存在独立或执行环境(垃圾收集器)的形式。 使用本文描述的技术设计或变换的算法,共享对象实现和/或机制使用无锁指针操作来提供存储的显式回收。 转换可以应用于无锁算法和共享对象实现,并保持这种算法和实现的锁定自由度。 因此,依赖于垃圾回收执行环境的现有和将来的无锁算法和共享对象实现可以在不提供垃圾回收的环境中被利用。 此外,使用如本文所述的无锁定指针操作的使用显式回收存储的算法和共享对象实现可以用于实现垃圾收集器本身。
    • 9. 发明申请
    • PARALLEL NESTED TRANSACTIONS
    • 并行交易
    • US20100325630A1
    • 2010-12-23
    • US12490287
    • 2009-06-23
    • Christine H. FloodVictor M. LuchangcoJan-Willem Maessen
    • Christine H. FloodVictor M. LuchangcoJan-Willem Maessen
    • G06F9/46
    • G06F9/466
    • A system for managing transactions, including a first reference cell associated with a starting value for a first variable, a first thread having an outer atomic transaction including a first instruction to write a first value to the first variable, a second thread, executing in parallel with the first thread, having an inner atomic transaction including a second instruction to write a second value to the first variable, where the inner atomic transaction is nested within the outer atomic transaction, a first value node created by the outer atomic transaction and storing the first value in response to execution of the first instruction, and a second value node created by the inner atomic transaction, storing the second value in response to execution of the second instruction, and having a previous node pointer referencing the first value node.
    • 一种用于管理事务的系统,包括与第一变量的起始值相关联的第一参考单元,具有包含向第一变量写入第一值的第一指令的外部原子事务的第一线程,并行执行的第二线程 具有第一线程,具有包含向第一变量写入第二值的第二指令的内部原子事务,其中内部原子事务嵌套在外部原子事务内,由外部原子事务创建的第一个值节点并存储 响应于第一指令的执行的第一值和由内部原子事务创建的第二值节点,响应于第二指令的执行存储第二值,并且具有引用第一值节点的先前节点指针。
    • 10. 发明申请
    • SCALABLE READER-WRITER LOCK
    • 可扩展读写器锁定
    • US20100241774A1
    • 2010-09-23
    • US12406890
    • 2009-03-18
    • Marek K. OlszewskiYosef LevVictor M. Luchangco
    • Marek K. OlszewskiYosef LevVictor M. Luchangco
    • G06F13/14G06F12/14
    • G06F9/52
    • A reader-writer lock is provided that scales to accommodate multiple readers without contention. The lock comprises a hierarchical C-SNZI (Conditioned Scalable Non-Zero Indicator) structure that scales with the number readers seeking simultaneous acquisition of the lock. All readers that have joined the C-SNZI structure share concurrent acquisition, and additional readers may continue to join until the structure is disabled. The lock may be disabled by a writer, at which time subsequent readers will wait (e.g., in a wait queue) until the lock is again available. The C-SNZI structure may be implemented in a lockword or in reader entries within a wait queue. If implemented in reader entries of a wait queue, the lockword may be omitted, and new readers arriving at the queue may be able join an existing reader entry even if the reader entry is not at the tail of the queue.
    • 提供了读写器锁,可以扩展以适应多个读卡器而无需争用。 该锁包括分级C-SNZI(条件可扩展非零指示符)结构,其数字读取器寻求同时获取锁定。 加入C-SNZI结构的所有读者都会共享并购,另外读者也可以继续加入,直到结构被禁用。 锁可以被写入器禁用,随后的读取器将等待(例如,在等待队列中),直到锁再次可用。 C-SNZI结构可以以锁字或者在等待队列内的读取器条目中实现。 如果在等待队列的读取器条目中实现,则可以省略锁字,并且即使读取器条目不在队列的尾部,到达队列的新读取器也可以加入现有的读取器条目。