Atomic operations for fabric shared memories

    公开(公告)号:US10929293B2

    公开(公告)日:2021-02-23

    申请号:US15967188

    申请日:2018-04-30

    Abstract: A system includes a plurality of processes, a network fabric, and a shared memory accessible by the plurality of processes over the network fabric, the shared memory to store a plurality of elements of a data structure. A first process is designated as being allowed to update a target variable stored in the shared memory, and a second process of the plurality of processes writes a request for an atomic operation to a first region in the shared memory. The first process is responsive to the request to perform the atomic operation that updates the target variable, and write a result including a value of the updated target variable to a second region in the shared memory, the second region readable by the second process, the request and the result being elements of the data structure.

    Data update of shared fabric memory in a high performance computing system

    公开(公告)号:US10565037B2

    公开(公告)日:2020-02-18

    申请号:US15847067

    申请日:2017-12-19

    Abstract: A high performance computing system that includes a shared fabric memory and a plurality of processors is disclosed. A first processor is coupled to a local storage and executes a first process that, in combination with other processes, causes the plurality of processors to perform certain actions including transferring, from the shared fabric memory to the local storage, a first value corresponding to a first cell of a first set of cells and a first sweep of a stencil code. The actions further include transferring, from a first logical partition in the shared fabric memory associated with the first cell to the local storage, a second value corresponding to a second cell related to the first cell and not in the first set of cells. Further, these actions include updating, by the first process, the first value based on at least the first value and the second value.

    FAILURE INDICATION IN SHARED MEMORY
    3.
    发明申请

    公开(公告)号:US20180293144A1

    公开(公告)日:2018-10-11

    申请号:US15764040

    申请日:2015-09-24

    Abstract: In some examples, a node of a computing system may include a failure identification engine and a failure response engine. The failure identification engine may identify a failure condition for a system function of the node and the failure response engine may store a failure indication in a shared memory to trigger takeover of the system function by a different node of the computing system.

    OPERATIONS ON DATA FOR COMMANDS IN INTERACTIVE PROGRAMMING SESSIONS

    公开(公告)号:US20240406251A1

    公开(公告)日:2024-12-05

    申请号:US18494960

    申请日:2023-10-26

    Abstract: In some examples, a system having a plurality of computer nodes receives a command based on program code of a program being developed in an interactive programming session. The system distributes data items from a network-attached memory to a distributed data object having data in node memories of the plurality of computer nodes. A dataset manager performs an operation specified by the command on the distributed data object, the operation executed in parallel on the plurality of computer nodes. The dataset manager produces derived data generated by the operation on the distributed data object, the derived data accessible by a programmer in the interactive programming session.

    ATOMIC OPERATIONS FOR FABRIC SHARED MEMORIES

    公开(公告)号:US20190332529A1

    公开(公告)日:2019-10-31

    申请号:US15967188

    申请日:2018-04-30

    Abstract: A system includes a plurality of processes, a network fabric, and a shared memory accessible by the plurality of processes over the network fabric, the shared memory to store a plurality of elements of a data structure. A first process is designated as being allowed to update a target variable stored in the shared memory, and a second process of the plurality of processes writes a request for an atomic operation to a first region in the shared memory. The first process is responsive to the request to perform the atomic operation that updates the target variable, and write a result including a value of the updated target variable to a second region in the shared memory, the second region readable by the second process, the request and the result being elements of the data structure.

    STRUCTURING PAGE IMAGES IN A MEMORY
    8.
    发明申请
    STRUCTURING PAGE IMAGES IN A MEMORY 审中-公开
    在记忆体中构造页面图像

    公开(公告)号:US20170046096A1

    公开(公告)日:2017-02-16

    申请号:US15305389

    申请日:2014-04-24

    Abstract: Approaches for structuring a plurality of page images in-memory are described in various examples of the present disclosure. In one example, a unique page identifier provided within a reference page image is identified. The unique page identifier is associated with a target page image stored in-memory. Once identified, the page identifier associated with the target page image is replaced with a location specific identifier of the target page image, wherein the location specific identifier is based on an in-memory location of the target page image.

    Abstract translation: 在本公开的各种示例中描述了用于构造存储器中的多个页面图像的方法。 在一个示例中,识别在参考页面图像内提供的唯一页面标识符。 独特的页面标识符与存储在内存中的目标页面图像相关联。 一旦被识别,与目标页面图像相关联的页面标识符被目标页面图像的位置特定标识符替换,其中位置特定标识符基于目标页面图像的存储器内位置。

    LATCH-FREE CONCURRENT SEARCHING
    9.
    发明申请
    LATCH-FREE CONCURRENT SEARCHING 审中-公开
    无需同时搜索

    公开(公告)号:US20170004164A1

    公开(公告)日:2017-01-05

    申请号:US15107392

    申请日:2014-01-16

    CPC classification number: G06F16/2343 G06F16/2315 G06F16/2455 G06F16/9027

    Abstract: Systems and methods associated with latch-free searching are disclosed. One example method includes receiving a key identifying data to be retrieved from a tree-based data structure. The method also includes performing a concurrent, latch-free search of the tree-based data structure until a leaf node is reached. The method also includes validating the leaf node. The method also includes retreading a portion of the search if the leaf node fails validation.

    Abstract translation: 公开了与无闩锁搜索相关联的系统和方法。 一个示例性方法包括从基于树的数据结构接收识别要检索的数据的密钥。 该方法还包括执行基于树的数据结构的并发的,无闩锁的搜索,直到到达叶节点。 该方法还包括验证叶节点。 该方法还包括如果叶节点验证失败,则重新搜索搜索的一部分。

    DATA UPDATE IN A HIGH PERFORMANCE COMPUTING SYSTEM

    公开(公告)号:US20190187924A1

    公开(公告)日:2019-06-20

    申请号:US15847067

    申请日:2017-12-19

    Abstract: A high performance computing system that includes a shared fabric memory and a plurality of processors is disclosed. A first processor is coupled to a local storage and executes a first process that, in combination with other processes, causes the plurality of processors to perform certain actions including transferring, from the shared fabric memory to the local storage, a first value corresponding to a first cell of a first set of cells and a first sweep of a stencil code. The actions further include transferring, from a first logical partition in the shared fabric memory associated with the first cell to the local storage, a second value corresponding to a second cell related to the first cell and not in the first set of cells. Further, these actions include updating, by the first process, the first value based on at least the first value and the second value.

Patent Agency Ranking