中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

7 records (took 0.018 seconds)

    SEQUENTIAL MEMORY ACCESS ON A HIGH PERFORMANCE COMPUTING SYSTEM
    2.
    发明申请
    SEQUENTIAL MEMORY ACCESS ON A HIGH PERFORMANCE COMPUTING SYSTEM 审中-公开

    公开(公告)号：US20190205205A1

    公开(公告)日：2019-07-04

    申请号：US15861381

    申请日：2018-01-03

    Applicant: Hewlett Packard Enterprise Development LP

    Inventor： Charles Johnson ,  Onkar Patil ,  Mesut Kuscu ,  Tuan Tran ,  Joseph Tucek ,  Harumi Kuno ,  Milind Chabbi ,  William Scherer

    IPC: G06F11/08 ,  G06F12/06 ,  G06F12/02

    Abstract: A high performance computing system including processing circuitry and a shared fabric memory is disclosed. The processing circuitry includes processors coupled to local storages. The shared fabric memory includes memory devices and is coupled to the processing circuitry. The shared fabric memory executes a first sweep of a stencil code by sequentially retrieving data stripes. Further, for each retrieved data stripe, a set of values of the retrieved data stripe are updated substantially simultaneously. For each retrieved data stripe, the updated set of values are stored in a free memory gap adjacent to the retrieved data stripe. For each retrieved data stripe, the free memory gap is advanced to an adjacent memory location. A sweep status indicator is incremented from the first sweep to a second sweep.

    READING BY USER-LEVEL PROCESSES
    5.
    发明申请
    READING BY USER-LEVEL PROCESSES 审中-公开

    公开(公告)号：US20180121371A1

    公开(公告)日：2018-05-03

    申请号：US15340173

    申请日：2016-11-01

    Applicant: Hewlett Packard Enterprise Development LP

    Inventor： Mark Lillibridge ,  Joseph Tucek

    IPC: G06F12/14 ,  G06F12/06

    CPC classification number: G06F12/1466 ,  G06F9/50 ,  G06F2212/1052

    Abstract: Examples described herein relate to a memory structure by a user-level process. In an example, a method includes mapping in a read mode, by a kernel, a memory structure and a lock associated with a portion of the memory structure into an address space of a user-level process based on the user-level process being untrusted. The user-level process reads the portion of the memory structure outside of the kernel and determines a state of the lock after the reading of the portion. A write to the portion during the reading of the portion is detected based on the state of the lock.

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

    公开(公告)号：US20170046096A1

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

    申请号：US15305389

    申请日：2014-04-24

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Goetz Graefe ,  Haris Volos ,  Hideaki Kimura ,  Harumi Kuno ,  Alistair Veitch ,  Joseph Tucek ,  Alvin AuYoung

    IPC: G06F3/06

    CPC classification number: G06F3/0644 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/0652 ,  G06F3/0673 ,  G06F12/1009

    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
    7.
    发明申请
    LATCH-FREE CONCURRENT SEARCHING 审中-公开
    无需同时搜索

    公开(公告)号：US20170004164A1

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

    申请号：US15107392

    申请日：2014-01-16

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Joseph Tucek ,  Mark Lillibridge ,  Harumi Kuno ,  Goetz Graefe

    IPC: G06F17/30

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

Patent Agency Ranking