公开(公告)号：US20160342351A1

公开(公告)日：2016-11-24

申请号：US15113824

申请日：2014-01-23

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Sheng Li ,  Jishen Zhao ,  Jichuan Chang ,  Parthasarathy Ranganathan ,  Alistair Veitch ,  Kevin T. Lim ,  Mark Lillibridge

IPC: G06F3/06

CPC classification number: G06F3/0619 ,  G06F3/0658 ,  G06F3/0659 ,  G06F3/0679 ,  G06F11/1471 ,  G06F11/1474 ,  G06F2201/805 ,  G11B27/36

Abstract: A technique includes acquiring a plurality of write requests from at least one memory controller and logging information associated with the plurality of write requests in persistent storage. The technique includes applying the plurality of write requests atomically as a group to persistent storage.

Abstract translation: 一种技术包括从至少一个存储器控制器获取多个写入请求，并在永久存储器中记录与多个写入请求相关联的信息。 该技术包括将多个写请求作为一组原子地应用于持久存储。

公开(公告)号：US10650169B2

公开(公告)日：2020-05-12

申请号：US15573081

申请日：2015-09-14

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Liqun Chen ,  Chris I. Dalton ,  Fraser Dickin ,  Mark Lillibridge ,  Simon Kai Ying Shiu

IPC: G06F11/30 ,  G06F12/14 ,  G06F21/79 ,  H04L9/08 ,  G06F21/60

Abstract: There is provided an example memory system comprising a plurality of memory modules, each memory module comprising a persistent memory to store root key information and encrypted primary data; a volatile memory to store a working key for encrypting data, the encrypted primary data stored in the persistent memory being encrypted using the working key; and a control unit to provide load and store access to the primary data. The memory system further comprises a working key recovery mechanism to retrieve first root key information from a first module and second root key information from a second module; and compute the working key for a given module based on the retrieved first root key information and the retrieved second root key information.

公开(公告)号：US10360206B2

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

申请号：US15107392

申请日：2014-01-16

Applicant: Hewlett Packard Enterprise Development LP

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

IPC: G06F17/00 ,  G06F16/23 ,  G06F16/901 ,  G06F16/2455

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.

公开(公告)号：US20180204024A1

公开(公告)日：2018-07-19

申请号：US15746494

申请日：2015-07-29

Applicant: Hewlett Packard Enterprise Development Lp

Inventor： Mark Lillibridge ,  Paolo Faraboschi ,  Chris I. Dalton

IPC: G06F21/70 ,  G06F3/06 ,  G06F21/53 ,  G06F21/74

CPC classification number: G06F21/70 ,  G06F3/0622 ,  G06F3/0659 ,  G06F3/0673 ,  G06F21/53 ,  G06F21/74

Abstract: Techniques for a firewall to determine access to a portion of memory are provided. In one aspect, an access request to access a portion of memory within a pool of shared memory may be received at a firewall. The firewall may determine whether the access request to access the portion of memory is allowed. The access request may be allowed to proceed based on the determination. The operation of the firewall may not utilize address translation.

公开(公告)号：US20180165479A1

公开(公告)日：2018-06-14

申请号：US15573081

申请日：2015-09-14

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Liqun Chen ,  Chris I. Dalton ,  Fraser Dickin ,  Mark Lillibridge ,  Simon Kai Ying Shiu

IPC: G06F21/79 ,  G06F12/14 ,  G06F21/60 ,  H04L9/08

CPC classification number: G06F21/79 ,  G06F12/1408 ,  G06F21/602 ,  H04L9/0819 ,  H04L9/0836 ,  H04L9/0894

Abstract: There is provided an example memory system comprising a plurality of memory modules, each memory module comprising a persistent memory to store root key information and encrypted primary data; a volatile memory to store a working key for encrypting data, the encrypted primary data stored in the persistent memory being encrypted using the working key; and a control unit to provide load and store access to the primary data. The memory system further comprises a working key recovery mechanism to retrieve first root key information from a first module and second root key information from a second module; and compute the working key for a given module based on the retrieved first root key information and the retrieved second root key information.

公开(公告)号：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.

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