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

21. 发明授权

US08375175B2 Fast and efficient reacquisition of locks for transactional memory systems 有权
标题翻译：快速有效地重新获取事务内存系统的锁
公开(公告)号：US08375175B2
公开(公告)日：2013-02-12
申请号：US12634640
申请日：2009-12-09
申请人： David Dice , Nir N. Shavit , Virendra J. Marathe
发明人： David Dice , Nir N. Shavit , Virendra J. Marathe
IPC分类号： G06F12/00
CPC分类号： G06F9/467
摘要： A system and method is disclosed for fast lock acquisition and release in a lock-based software transactional memory system. The method includes determining that a group of shared memory areas are likely to be accessed together in one or more atomic memory transactions executed by one or more threads of a computer program in a transactional memory system. In response to determining this, the system associates the group of memory areas with a single software lock that is usable by the transactional memory system to coordinate concurrent transactional access to the group of memory areas by the threads of the computer program. Subsequently, a thread of the program may gain access to a plurality of the memory areas of the group by acquiring the single software lock.
摘要翻译：公开了一种用于在基于锁的软件事务存储器系统中快速锁定获取和释放的系统和方法。该方法包括确定一组共享存储器区域可能一起被访问在由事务存储器系统中的计算机程序的一个或多个线程执行的一个或多个原子存储器事务中。响应于确定这一点，系统将该组存储器区域与由事务存储器系统可用的单个软件锁相关联，以协调由计算机程序的线程对存储器区域的并发事务访问。随后，程序的线程可以通过获取单个软件锁来访问该组的多个存储区域。

22. 发明申请

US20120204163A1 System and Method for Optimizing Software Transactional Memory Operations Using Static Caching of Memory Objects 有权
标题翻译：使用存储器对象的静态缓存优化软件事务内存操作的系统和方法
公开(公告)号：US20120204163A1
公开(公告)日：2012-08-09
申请号：US13023402
申请日：2011-02-08
申请人： Virendra J. Marathe , Aleksandar Dragojevic , Tito L. Autrey, III
发明人： Virendra J. Marathe , Aleksandar Dragojevic , Tito L. Autrey, III
IPC分类号： G06F9/45
CPC分类号： G06F8/4442
摘要： Systems and methods for optimizing transactional memory operations may employ static analysis of source code and static caching of memory objects to elide redundant transactional accesses. For example, a compiler (or an optimizer thereof) may be configured to analyze code that includes an atomic transaction to determine if any read accesses to shared memory locations are dominated by a previous read or write access to the same locations and/or any write accesses to shared memory locations are post-dominated by a subsequent write access to the same locations. Any access within a transaction that is determined to be redundant (e.g., any access other than the first read of a given shared memory location from within the transaction or the last write to a given shared memory location from within the transaction) may be replaced (by the compiler/optimizer) with a non-transactional access to a cached shadow copy of the shared memory location.
摘要翻译：用于优化事务性存储器操作的系统和方法可以采用源代码的静态分析和存储器对象的静态缓存来去除冗余事务访问。例如，编译器（或其优化器）可以被配置为分析包括原子事务的代码，以确定对共享存储器位置的任何读取访问是否受到对相同位置的先前读取或写入访问和/或任何写入对共享存储器位置的访问由后续的对相同位置的写入访问控制。确定为冗余的事务内的任何访问（例如，除了事务内的给定共享存储器位置的第一次读取之外的任何访问或者来自事务内的给定共享存储器位置的最后写入）可以被替换（通过编译器/优化器）对共享内存位置的缓存卷影副本进行非事务性访问。

23. 发明授权

US07984444B1 Composite abortable locks 有权
标题翻译：复合材料不可逾越的锁
公开(公告)号：US07984444B1
公开(公告)日：2011-07-19
申请号：US11226949
申请日：2005-09-15
申请人： Nir N. Shavit , Mark S. Moir , Virendra J. Marathe
发明人： Nir N. Shavit , Mark S. Moir , Virendra J. Marathe
IPC分类号： G06F9/46 , G06F12/00
CPC分类号： G06F9/526
摘要： A lock implementation has properties of both backoff locks and queue locks. Such a “composite” lock is abortable and is provided with a constant number of preallocated nodes. A thread requesting the lock selects one of the nodes, attempts to acquire the selected node, and, if successful, inserts the selected node in a wait-queue for the lock. Because there is only a constant number of nodes for the wait-queue, all requesting threads may not be queued. Requesting threads unable to successfully acquire a selected node may backoff and retry selecting and acquiring a node. A node at the front of the wait-queue holds the lock.
摘要翻译：锁实现具有回退锁和队列锁的属性。这样的“复合”锁是不可中止的，并且具有恒定数量的预分配节点。请求锁的线程选择一个节点，尝试获取所选择的节点，如果成功，则将所选节点插入到等待队列中。因为等待队列中只有一定数量的节点，所有请求的线程可能不会排队。请求线程无法成功获取所选节点可以退避并重试选择和获取节点。等待队列前面的节点保存锁。

24. 发明申请

US20110138135A1 Fast and Efficient Reacquisition of Locks for Transactional Memory Systems 有权
标题翻译：快速有效地重新获取事务内存系统的锁
公开(公告)号：US20110138135A1
公开(公告)日：2011-06-09
申请号：US12634640
申请日：2009-12-09
申请人： David Dice , Nir N. Shavit , Virendra J. Marathe
发明人： David Dice , Nir N. Shavit , Virendra J. Marathe
IPC分类号： G06F12/14 , G06F12/00
CPC分类号： G06F9/467
摘要： A system and method is disclosed for fast lock acquisition and release in a lock-based software transactional memory system. The method includes determining that a group of shared memory areas are likely to be accessed together in one or more atomic memory transactions executed by one or more threads of a computer program in a transactional memory system. In response to determining this, the system associates the group of memory areas with a single software lock that is usable by the transactional memory system to coordinate concurrent transactional access to the group of memory areas by the threads of the computer program. Subsequently, a thread of the program may gain access to a plurality of the memory areas of the group by acquiring the single software lock.
摘要翻译：公开了一种用于在基于锁的软件事务存储器系统中快速锁定获取和释放的系统和方法。该方法包括确定一组共享存储器区域可能一起被访问在由事务存储器系统中的计算机程序的一个或多个线程执行的一个或多个原子存储器事务中。响应于确定这一点，系统将该组存储器区域与由事务存储器系统可用的单个软件锁相关联，以协调由计算机程序的线程对存储器区域的并发事务访问。随后，程序的线程可以通过获取单个软件锁来访问该组的多个存储区域。

25. 发明授权

US08677331B2 Lock-clustering compilation for software transactional memory 有权
标题翻译：软件事务内存的锁聚类编译
公开(公告)号：US08677331B2
公开(公告)日：2014-03-18
申请号：US13250369
申请日：2011-09-30
申请人： Virendra J. Marathe , David Dice
发明人： Virendra J. Marathe , David Dice
IPC分类号： G06F9/45 , G06F9/44
CPC分类号： G06F9/467 , G06F8/443 , G06F8/457 , G06F9/526
摘要： A lock-clustering compiler is configured to compile program code for a software transactional memory system. The compiler determines that a group of data structures are accessed together within one or more atomic memory transactions defined in the program code. In response to determining that the group is accessed together, the compiler creates an executable version of the program code that includes clustering code, which is executable to associate the data structures of the group with the same software transactional memory lock. The lock is usable by the software transactional memory system to coordinate concurrent transactional access to the group of data structures by multiple concurrent threads.
摘要翻译：锁集群编译器被配置为编译软件事务存储器系统的程序代码。编译器确定一组数据结构在程序代码中定义的一个或多个原子存储器事务中被一起访问。响应于确定组被一起访问，编译器创建包括可以将该组的数据结构与相同的软件事务存储器锁相关联的聚类代码的程序代码的可执行版本。该锁可由软件事务内存系统使用，以通过多个并发线程协调对数据结构组的并发事务访问。

26. 发明申请

US20130290583A1 System and Method for NUMA-Aware Locking Using Lock Cohorts 有权
标题翻译：使用锁定队列进行NUMA感知锁定的系统和方法
公开(公告)号：US20130290583A1
公开(公告)日：2013-10-31
申请号：US13458871
申请日：2012-04-27
申请人： David Dice , Virendra J. Marathe , Nir N. Shavit
发明人： David Dice , Virendra J. Marathe , Nir N. Shavit
IPC分类号： G06F13/14
CPC分类号： G06F9/526
摘要： The system and methods described herein may be used to implement NUMA-aware locks that employ lock cohorting. These lock cohorting techniques may reduce the rate of lock migration by relaxing the order in which the lock schedules the execution of critical code sections by various threads, allowing lock ownership to remain resident on a single NUMA node longer than under strict FIFO ordering, thus reducing coherence traffic and improving aggregate performance. A NUMA-aware cohort lock may include a global shared lock that is thread-oblivious, and multiple node-level locks that provide cohort detection. The lock may be constructed from non-NUMA-aware components (e.g., spin-locks or queue locks) that are modified to provide thread-obliviousness and/or cohort detection. Lock ownership may be passed from one thread that holds the lock to another thread executing on the same NUMA node without releasing the global shared lock.
摘要翻译：本文描述的系统和方法可以用于实现采用锁定队列的NUMA感知锁。这些锁定队列技术可以通过放松锁定通过各种线程调度关键代码段的执行顺序来降低锁定迁移速率，从而允许锁定所有权保持驻留在单个NUMA节点上比在严格FIFO排序之前更长时间，从而减少一致性流量和提高总体性能。 NUMA感知的群组锁可能包括线程忽略的全局共享锁和提供队列检测的多个节点级锁。锁可以由修改为提供线程忽略性和/或队列检测的非NUMA感知组件（例如，旋转锁或队列锁）构建。锁定所有权可以从保存锁的一个线程传递到在同一NUMA节点上执行的另一个线程，而不会释放全局共享锁。

27. 发明申请

US20130086348A1 Lock-Clustering Compilation for Software Transactional Memory 有权
标题翻译：软件事务内存锁集群编译
公开(公告)号：US20130086348A1
公开(公告)日：2013-04-04
申请号：US13250369
申请日：2011-09-30
申请人： Virendra J. Marathe , David Dice
发明人： Virendra J. Marathe , David Dice
IPC分类号： G06F12/14
CPC分类号： G06F9/467 , G06F8/443 , G06F8/457 , G06F9/526
摘要： A lock-clustering compiler is configured to compile program code for a software transactional memory system. The compiler determines that a group of data structures are accessed together within one or more atomic memory transactions defined in the program code. In response to determining that the group is accessed together, the compiler creates an executable version of the program code that includes clustering code, which is executable to associate the data structures of the group with the same software transactional memory lock. The lock is usable by the software transactional memory system to coordinate concurrent transactional access to the group of data structures by multiple concurrent threads.
摘要翻译：锁集群编译器被配置为编译软件事务存储器系统的程序代码。编译器确定一组数据结构在程序代码中定义的一个或多个原子存储器事务中被一起访问。响应于确定组被一起访问，编译器创建包括可以将该组的数据结构与相同的软件事务存储器锁相关联的聚类代码的程序代码的可执行版本。该锁可由软件事务内存系统使用，以通过多个并发线程协调对数据结构组的并发事务访问。

28. 发明授权

US07689788B2 System and method for executing transactions 有权
标题翻译：用于执行事务的系统和方法
公开(公告)号：US07689788B2
公开(公告)日：2010-03-30
申请号：US11656843
申请日：2007-01-23
申请人： Mark S. Moir , Virendra J. Marathe
发明人： Mark S. Moir , Virendra J. Marathe
IPC分类号： G06F12/00
CPC分类号： G06F9/466
摘要： A method for executing transactions including obtaining a memory location required by a first transaction, where the first transaction is identified using a first transaction identification and a first transaction version; determining a second transaction with ownership of a memory group including the memory location, where the second transaction is identified using a second transaction identification and a second transaction version; copying an intermediate value associated with the memory group from the second transaction into transactional metadata associated with the first transaction; changing ownership of the memory group to the first transaction; and committing the first transaction.
摘要翻译：一种用于执行交易的方法，包括获得第一交易所需的存储位置，其中使用第一交易标识和第一交易版本识别所述第一交易; 确定包括所述存储器位置的存储器组的所有权的第二事务，其中使用第二事务标识和第二事务版本识别所述第二事务; 将与所述存储器组相关联的中间值从所述第二事务复制到与所述第一事务相关联的事务元数据; 将内存组的所有权更改为第一笔交易; 并提交第一笔交易。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式