公开(公告)号：US20210342202A1

公开(公告)日：2021-11-04

申请号：US17378488

申请日：2021-07-16

Applicant: Oracle International Corporation

Inventor： Yosef Lev ,  Victor M. Luchangco ,  David Dice ,  Alex Kogan ,  Timothy L. Harris ,  Pantea Zardoshti

IPC: G06F9/52 ,  G06F9/54

Abstract: A first data accessor acquires a lock associated with a critical section. The first data accessor initiates a help session associated with a first operation of the critical section. In the help session, a second data accessor (which has not acquired the first lock) performs one or more sub-operations of the first operation. The first data accessor releases the lock after at least the first operation has been completed.

公开(公告)号：US20150269008A1

公开(公告)日：2015-09-24

申请号：US14733908

申请日：2015-06-08

Applicant: Oracle International Corporation

Inventor： Mark S. Moir ,  Victor M. Luchangco ,  Maurice Herlihy

IPC: G06F9/52 ,  G06F12/14

CPC classification number: G06F9/526 ,  G06F9/466 ,  G06F9/467 ,  G06F12/1475 ,  G06F2212/1052

Abstract: We teach a powerful approach that greatly simplifies the design of non-blocking mechanisms and data structures, in part by, largely separate the issues of correctness and progress. At a high level, our methodology includes designing an “obstruction-free” implementation of the desired mechanism or data structure, which may then be combined with a contention management mechanism whose role is to facilitate the conditions under which progress of the obstruction-free implementation is assured. In general, the contention management mechanism is separable semantically from an obstruction-free concurrent shared/sharable object implementation to which it is/may be applied. In some cases, the contention management mechanism may actually be coded separately from the obstruction-free implementation. We elaborate herein on the notions of obstruction-freedom and contention management, and various possibilities for combining the two. In addition, we include description of some exemplary applications to particular concurrent software mechanisms and data structure implementations.

Abstract translation: 我们教授一种强大的方法，大大简化了非阻塞机制和数据结构的设计，部分原因是在很大程度上分离了正确性和进度的问题。 在高层次上，我们的方法包括设计一个“无障碍”的所需机制或数据结构的实现，然后将其与竞争管理机制结合起来，其作用是促进无障碍执行进展的条件 放心 一般来说，争用管理机制在语义上与可以应用于其的无障碍并发共享/可共享对象实现是可分离的。 在某些情况下，争用管理机制实际上可以与无障碍的实现分开编码。 我们在这里阐述了阻挠自由和争论管理的概念，以及结合两者的各种可能性。 此外，我们将特定并发软件机制和数据结构实现的一些示例性应用程序的描述。

公开(公告)号：US20140282574A1

公开(公告)日：2014-09-18

申请号：US14047749

申请日：2013-10-07

Applicant: Oracle International Corporation

Inventor： Virendra J. Marathe ,  Yosef Lev ,  Victor M. Luchangco

IPC: G06F9/48

CPC classification number: G06F9/4881

Abstract: Systems and methods for implementing constrained data-driven parallelism may provide programmers with mechanisms for controlling the execution order and/or interleaving of tasks spawned during execution. For example, a programmer may define a task group that includes a single task, and the single task may define a direct or indirect trigger that causes another task to be spawned (e.g., in response to a modification of data specified in the trigger). Tasks spawned by a given task may be added to the same task group as the given task. A deferred keyword may control whether a spawned task is to be executed in the current execution phase or its execution is to be deferred to a subsequent execution phase for the task group. Execution of all tasks executing in the current execution phase may need to be complete before the execution of tasks in the next phase can begin.

Abstract translation: 用于实现约束的数据驱动并行性的系统和方法可以为程序员提供用于控制在执行期间产生的任务的执行顺序和/或交错的机制。 例如，程序员可以定义包括单个任务的任务组，并且单个任务可以定义导致另一任务被产生的直接或间接触发（例如，响应于在触发器中指定的数据的修改）。 给定任务产生的任务可以添加到与给定任务相同的任务组。 延迟关键字可以控制是否在当前执行阶段执行产生的任务，否则将其执行推迟到任务组的后续执行阶段。 执行当前执行阶段中执行的所有任务可能需要在下一阶段的任务执行开始之前完成。

公开(公告)号：US09342380B2

公开(公告)日：2016-05-17

申请号：US13784965

申请日：2013-03-05

Applicant: Oracle International Corporation

Inventor： David Dice ,  Yosef Lev ,  Yujie Liu ,  Victor M. Luchangco ,  Mark S. Moir

IPC: G06F12/00 ,  G06F9/52 ,  G06F9/46

CPC classification number: G06F9/467 ,  G06F9/5027 ,  G06F9/528 ,  G06F2209/523

Abstract: Transactional reader-writer locks may leverage available hardware transactional memory (HTM) to simplify the procedures of the reader-writer lock algorithm and to eliminate a requirement for type stable memory An HTM-based reader-writer lock may include an ordered list of client-provided nodes, each of which represents a thread that holds (or desires to acquire) the lock, and a tail pointer. The locking and unlocking procedures invoked by readers and writers may access the tail pointer or particular ones of the nodes in the list using various combinations of transactions and non-transactional accesses to insert nodes into the list or to remove nodes from the list. A reader or writer that owns a node at the head of the list (or a reader whose node is preceded in the list only by other readers' nodes) may access a critical section of code or shared resource.

Abstract translation: 事务读写器锁可以利用可用的硬件事务存储器（HTM）来简化读写器锁定算法的过程，并消除对类型稳定存储器的要求基于HTM的读写器锁可以包括客户端 - 提供的节点，每个节点表示一个保存（或希望获取）锁的线程和一个尾部指针。 读者和作者调用的锁定和解锁过程可以使用事务和非事务性访问的各种组合来访问列表中的尾部指针或特定节点，以将节点插入到列表中或从列表中删除节点。 在列表头部拥有一个节点的阅读器或写入器（或者只有其他读取器节点在其列表中的节点之前的读取器）可以访问代码或共享资源的关键部分。

公开(公告)号：US09727369B2

公开(公告)日：2017-08-08

申请号：US15156110

申请日：2016-05-16

Applicant: Oracle International Corporation

Inventor： David Dice ,  Yosef Lev ,  Yujie Liu ,  Victor M. Luchangco ,  Mark S. Moir

IPC: G06F12/00 ,  G06F9/46 ,  G06F9/52 ,  G06F9/50

CPC classification number: G06F9/467 ,  G06F9/5027 ,  G06F9/528 ,  G06F2209/523

Abstract: Transactional reader-writer locks may leverage available hardware transactional memory (HTM) to simplify the procedures of the reader-writer lock algorithm and to eliminate a requirement for type stable memory An HTM-based reader-writer lock may include an ordered list of client-provided nodes, each of which represents a thread that holds (or desires to acquire) the lock, and a tail pointer. The locking and unlocking procedures invoked by readers and writers may access the tail pointer or particular ones of the nodes in the list using various combinations of transactions and non-transactional accesses to insert nodes into the list or to remove nodes from the list. A reader or writer that owns a node at the head of the list (or a reader whose node is preceded in the list only by other readers' nodes) may access a critical section of code or shared resource.

公开(公告)号：US20170075720A1

公开(公告)日：2017-03-16

申请号：US15263123

申请日：2016-09-12

Applicant: Oracle International Corporation

Inventor： Alex Kogan ,  Victor M. Luchangco ,  Yosef Lev ,  Trevor Brown

IPC: G06F9/46 ,  G06F9/50 ,  G06F9/48

CPC classification number: G06F9/528 ,  G06F9/5027 ,  H04Q3/54541

Abstract: Socket scheduling modes may prevent non-uniform memory access effects from negatively affecting performance of synchronization mechanisms utilizing hardware transactional memory. Each mode may indicate whether a thread may execute a critical section on a particular socket. For example, under transitional lock elision, locks may include a mode indicating whether threads may acquire or elide the lock on a particular socket. Different modes may be used alternately to prevent threads from starving. A thread may only execute a critical section on a particular socket if allowed by the current mode. Otherwise, threads may block until allowed to execute the critical section, such as after the current mode changes. A profiling session may, for a running workload, iterate over all possible modes, measuring statistics pertaining to the execution of critical sections (e.g., the number of lock acquisitions and/or elisions), to determine the best performing modes for the particular workload.

Abstract translation: 套接字调度模式可以防止不均匀的存储器访问效应不利地影响利用硬件事务存储器的同步机制的性能。 每个模式可以指示线程是否可以在特定的套接字上执行关键部分。 例如，在过渡锁定检测下，锁可以包括指示线程是否可以获取或删除特定套接字上的锁的模式。 可以交替使用不同的模式来防止线程饥饿。 线程只能在当前模式允许的情况下执行特定套接字上的关键部分。 否则，线程可能会阻塞，直到允许执行关键部分，例如当前模式更改后。 对于运行的工作负载，分析会话可以迭代所有可能的模式，测量关于关键部分的执行的统计数据（例如，锁获取和/或删除的数量），以确定特定工作负载的最佳执行模式。

公开(公告)号：US20160259663A1

公开(公告)日：2016-09-08

申请号：US15156110

申请日：2016-05-16

Applicant: Oracle International Corporation

Inventor： David Dice ,  Yosef Lev ,  Yujie Liu ,  Victor M. Luchangco ,  Mark S. Moir

IPC: G06F9/46 ,  G06F9/50

CPC classification number: G06F9/467 ,  G06F9/5027 ,  G06F9/528 ,  G06F2209/523

Abstract: Transactional reader-writer locks may leverage available hardware transactional memory (HTM) to simplify the procedures of the reader-writer lock algorithm and to eliminate a requirement for type stable memory An HTM-based reader-writer lock may include an ordered list of client-provided nodes, each of which represents a thread that holds (or desires to acquire) the lock, and a tail pointer. The locking and unlocking procedures invoked by readers and writers may access the tail pointer or particular ones of the nodes in the list using various combinations of transactions and non-transactional accesses to insert nodes into the list or to remove nodes from the list. A reader or writer that owns a node at the head of the list (or a reader whose node is preceded in the list only by other readers' nodes) may access a critical section of code or shared resource.

Abstract translation: 事务读写器锁可以利用可用的硬件事务存储器（HTM）来简化读写器锁定算法的过程，并消除对类型稳定存储器的要求基于HTM的读写器锁可以包括客户端 - 提供的节点，每个节点表示一个保存（或希望获取）锁的线程和一个尾部指针。 读者和作者调用的锁定和解锁过程可以使用事务和非事务性访问的各种组合来访问列表中的尾部指针或特定节点，以将节点插入到列表中或从列表中删除节点。 在列表头部拥有一个节点的阅读器或写入器（或者只有其他读取器节点在其列表中的节点之前的读取器）可以访问代码或共享资源的关键部分。

公开(公告)号：US09323586B2

公开(公告)日：2016-04-26

申请号：US14733908

申请日：2015-06-08

Applicant: Oracle International Corporation

Inventor： Mark S. Moir ,  Victor M. Luchangco ,  Maurice Herlihy

IPC: G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F9/52 ,  G06F9/46 ,  G06F12/14

CPC classification number: G06F9/526 ,  G06F9/466 ,  G06F9/467 ,  G06F12/1475 ,  G06F2212/1052

Abstract: We teach a powerful approach that greatly simplifies the design of non-blocking mechanisms and data structures, in part by, largely separate the issues of correctness and progress. At a high level, our methodology includes designing an “obstruction-free” implementation of the desired mechanism or data structure, which may then be combined with a contention management mechanism whose role is to facilitate the conditions under which progress of the obstruction-free implementation is assured. In general, the contention management mechanism is separable semantically from an obstruction-free concurrent shared/sharable object implementation to which it is/may be applied. In some cases, the contention management mechanism may actually be coded separately from the obstruction-free implementation. We elaborate herein on the notions of obstruction-freedom and contention management, and various possibilities for combining the two. In addition, we include description of some exemplary applications to particular concurrent software mechanisms and data structure implementations.

公开(公告)号：US20140258645A1

公开(公告)日：2014-09-11

申请号：US13784965

申请日：2013-03-05

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： David Dice ,  Yosef Lev ,  Yujie Liu ,  Victor M. Luchangco ,  Mark S. Moir

IPC: G06F12/14

CPC classification number: G06F9/467 ,  G06F9/5027 ,  G06F9/528 ,  G06F2209/523

Abstract: Transactional reader-writer locks may leverage available hardware transactional memory (HTM) to simplify the procedures of the reader-writer lock algorithm and to eliminate a requirement for type stable memory An HTM-based reader-writer lock may include an ordered list of client-provided nodes, each of which represents a thread that holds (or desires to acquire) the lock, and a tail pointer. The locking and unlocking procedures invoked by readers and writers may access the tail pointer or particular ones of the nodes in the list using various combinations of transactions and non-transactional accesses to insert nodes into the list or to remove nodes from the list. A reader or writer that owns a node at the head of the list (or a reader whose node is preceded in the list only by other readers' nodes) may access a critical section of code or shared resource.

Abstract translation: 事务读写器锁可以利用可用的硬件事务存储器（HTM）来简化读写器锁定算法的过程，并消除对类型稳定存储器的要求基于HTM的读写器锁可以包括客户端 - 提供的节点，每个节点表示一个保存（或希望获取）锁的线程和一个尾部指针。 读者和作者调用的锁定和解锁过程可以使用事务和非事务性访问的各种组合来访问列表中的尾部指针或特定节点，以将节点插入到列表中或从列表中删除节点。 在列表头部拥有一个节点的阅读器或写入器（或者只有其他读取器节点在其列表中的节点之前的读取器）可以访问代码或共享资源的关键部分。

公开(公告)号：US20240086261A1

公开(公告)日：2024-03-14

申请号：US18515027

申请日：2023-11-20

Applicant: Oracle International Corporation

Inventor： Yosef Lev ,  Victor M. Luchangco ,  David Dice ,  Alex Kogan ,  Timothy L. Harris ,  Pantea Zardoshti

IPC: G06F9/52 ,  G06F9/54

CPC classification number: G06F9/526 ,  G06F9/524 ,  G06F9/542

Abstract: A first data accessor acquires a lock associated with a critical section. The first data accessor initiates a help session associated with a first operation of the critical section. In the help session, a second data accessor (which has not acquired the first lock) performs one or more sub-operations of the first operation. The first data accessor releases the lock after at least the first operation has been completed.