中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

354 records (took 0.024 seconds)

    ADAPTIVE RAID FOR AN SSD ENVIRONMENT
    191.
    发明申请
    ADAPTIVE RAID FOR AN SSD ENVIRONMENT 有权
    适用于SSD环境的自适应RAID

    公开(公告)号：US20140317447A1

    公开(公告)日：2014-10-23

    申请号：US14283628

    申请日：2014-05-21

    Applicant: PURE Storage, Inc.

    Inventor： John Colgrove ,  John Hayes ,  Bo Hong ,  Ethan Miller

    IPC: G06F11/10 ,  G06F3/06

    CPC classification number: G06F11/108 ,  G06F3/0619 ,  G06F3/0646 ,  G06F3/0688 ,  G06F11/1008 ,  G06F11/1068 ,  G06F11/1076

    Abstract: A system and method for adaptive RAID geometries. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array is configured to determine a first RAID layout for use in storing data, and write a first RAID stripe to the device group according to the first RAID layout. In response to detecting a first condition, the controller is configured to determine a second RAID layout which is different from the first RAID layout, and write a second RAID stripe to the device group according to the second layout, whereby the device group concurrently stores data according to both the first RAID layout and the second RAID layout.

    Abstract translation: 用于自适应RAID几何的系统和方法。 计算机系统包括经由网络彼此耦合的客户端计算机和数据存储阵列。 数据存储阵列利用固态驱动器和闪存单元进行数据存储。 数据存储阵列中的存储控制器被配置为确定用于存储数据的第一RAID布局，并且根据第一RAID布局向设备组写入第一RAID条带。 响应于检测到第一条件，控制器被配置为确定与第一RAID布局不同的第二RAID布局，并且根据第二布局向设备组写入第二RAID条带，由此设备组同时存储数据 根据第一个RAID布局和第二个RAID布局。

    VARIABLE LENGTH ENCODING IN A STORAGE SYSTEM
    192.
    发明申请
    VARIABLE LENGTH ENCODING IN A STORAGE SYSTEM 有权
    存储系统中可变长度编码

    公开(公告)号：US20140304489A1

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

    申请号：US14312093

    申请日：2014-06-23

    Applicant: PURE Storage, Inc.

    Inventor： John Colgrove ,  John Hayes ,  Ethan Miller

    IPC: G06F12/10

    CPC classification number: G06F12/1009 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/0688 ,  G06F12/1036 ,  G06F2212/657

    Abstract: A system and method for maintaining a mapping table in a data storage subsystem. A data storage subsystem supports multiple mapping tables including a plurality of entries. Each of the entries comprise a tuple including a key. A data storage controller is configured to encode each tuple in the mapping table using a variable length encoding. Additionally, the mapping table may be organized as a plurality of time ordered levels, with each level including one or more mapping table entries. Further, a particular encoding of a plurality of encodings for a given tuple may be selected based at least in part on a size of the given tuple as unencoded, a size of the given tuple as encoded, and a time to encode the given tuple.

    Abstract translation: 一种用于在数据存储子系统中维护映射表的系统和方法。 数据存储子系统支持包括多个条目的多个映射表。 每个条目包括包括密钥的元组。 数据存储控制器被配置为使用可变长度编码对映射表中的每个元组进行编码。 另外，映射表可以被组织为多个时间有序的级别，其中每个级别包括一个或多个映射表条目。 此外，可以至少部分地基于给定元组的大小作为未编码，被编码的给定元组的大小和对给定元组进行编码的时间来选择给定元组的多个编码的特定编码。

    SCHEDULING OF REACTIVE I/O OPERATIONS IN A STORAGE ENVIRONMENT
    193.
    发明申请
    SCHEDULING OF REACTIVE I/O OPERATIONS IN A STORAGE ENVIRONMENT 审中-公开
    在存储环境中调度反应性I / O操作

    公开(公告)号：US20140229673A1

    公开(公告)日：2014-08-14

    申请号：US14260059

    申请日：2014-04-23

    Applicant: PURE Storage, Inc.

    Inventor： John Colgrove ,  John Hayes ,  Bo Hong ,  Feng Wang ,  Ethan Miller ,  Craig Harmer

    IPC: G06F3/06

    CPC classification number: G06F3/0611 ,  G06F3/061 ,  G06F3/0613 ,  G06F3/0617 ,  G06F3/0634 ,  G06F3/0659 ,  G06F3/0665 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/0751 ,  G06F11/076 ,  G06F11/1076

    Abstract: A system and method for effectively scheduling read and write operations among a plurality of solid-state storage devices. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array comprises an I/O scheduler. The characteristics of corresponding storage devices are used to schedule I/O requests to the storage devices in order to maintain relatively consistent response times at predicted times. Should a device exhibit an unscheduled behavior which may be indicative of the device being in an unknown state, the scheduler may schedule one or more reactive operations on the device configured to cause the device to enter a known state.

    Abstract translation: 一种用于在多个固态存储设备之间有效地调度读取和写入操作的系统和方法。 计算机系统包括经由网络彼此耦合的客户端计算机和数据存储阵列。 数据存储阵列利用固态驱动器和闪存单元进行数据存储。 数据存储阵列中的存储控制器包括I / O调度器。 相应的存储设备的特性用于将I / O请求调度到存储设备，以便在预测时间内保持相对一致的响应时间。 如果设备呈现可能指示设备处于未知状态的非计划行为，则调度器可以对被配置为使设备进入已知状态的设备上的一个或多个无效操作进行调度。

    FRACTAL LAYOUT OF DATA BLOCKS ACROSS MULTIPLE DEVICES
    194.
    发明申请
    FRACTAL LAYOUT OF DATA BLOCKS ACROSS MULTIPLE DEVICES 有权
    数据块的分割布局多个设备

    公开(公告)号：US20140215155A1

    公开(公告)日：2014-07-31

    申请号：US14243421

    申请日：2014-04-02

    Applicant: PURE Storage, Inc.

    Inventor： Ethan Miller ,  John Colgrove ,  John Hayes ,  Cary Sandvig

    IPC: G06F3/06

    CPC classification number: G06F3/0608 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/0664 ,  G06F3/0665 ,  G06F3/0683 ,  G06F3/0689 ,  G06F12/00 ,  G06F12/0292 ,  G06F12/06 ,  G06F12/10 ,  G06F12/1009 ,  G06F12/1027 ,  G06F2212/1044

    Abstract: A system, method, and computer-readable storage medium for mapping block numbers within a region to physical locations within a storage system. Block numbers are mapped within a region according to a fractal-based space-filling curve. If the region is not a 2k by 2k square, then the region is broken up into one or more 2k by 2k squares. Any remaining sub-region is centered within a 2k by 2k square, the 2k by 2k square is numbered using a fractal-based space-filling curve, and then the sub-region is renumbered by assigning numbers based on the order of the original block numbers of the sub-region.

    Abstract translation: 一种用于将区域内的块号映射到存储系统内的物理位置的系统，方法和计算机可读存储介质。 块号根据基于分形的空间填充曲线在一个区域内映射。 如果该区域不是2k乘2k平方，那么该区域被分解成一个或多个2k乘2k的正方形。 任何剩余的子区域居中在2k×2k平方的范围内，使用基于分形的空间填充曲线编号2k×2k平方，然后通过基于原始块的顺序分配编号来重新编号子区域 子区域的数量。

    MULTI-DRIVE COOPERATION TO GENERATE AN ENCRYPTION KEY
    196.
    发明申请
    MULTI-DRIVE COOPERATION TO GENERATE AN ENCRYPTION KEY 有权
    多媒体合作生成加密密钥

    公开(公告)号：US20140089683A1

    公开(公告)日：2014-03-27

    申请号：US13627444

    申请日：2012-09-26

    Applicant: PURE STORAGE, INC.

    Inventor： Ethan Miller ,  John Colgrove ,  John Hayes

    IPC: G06F21/24

    CPC classification number: H04L63/061 ,  G06F21/78 ,  G06F2221/2107 ,  G06F2221/2131 ,  H04L9/085

    Abstract: A system, method, and computer-readable storage medium for protecting a set of storage devices using a secret sharing scheme. The data of each storage device is encrypted with a key, and the key is encrypted based on a shared secret and a device-specific value. Each storage device stores a share and its encrypted key, and if a number of storage devices above a threshold are available, then the shared secret can be reconstructed from the shares and used to decrypt the encrypted keys. Otherwise, the secret cannot be reconstructed if less than the threshold number of storage devices are accessible, and then data on the storage devices will be unreadable.

    Abstract translation: 一种用于使用秘密共享方案保护一组存储设备的系统，方法和计算机可读存储介质。 每个存储设备的数据用密钥加密，密钥根据共享密钥和设备特定值进行加密。 每个存储设备存储共享及其加密密钥，并且如果高于阈值的多个存储设备可用，则可以从共享中重建共享密钥并用于对加密的密钥进行解密。 否则，如果小于阈值数量的存储设备可访问，则无法重建秘密，然后存储设备上的数据将无法读取。

    SCHEDULING OF RECONSTRUCTIVE I/O READ OPERATIONS IN A STORAGE ENVIRONMENT
    197.
    发明申请
    SCHEDULING OF RECONSTRUCTIVE I/O READ OPERATIONS IN A STORAGE ENVIRONMENT 有权
    在存储环境中调度重写I / O读操作

    公开(公告)号：US20140075115A1

    公开(公告)日：2014-03-13

    申请号：US14083161

    申请日：2013-11-18

    Applicant: PURE Storage, Inc.

    Inventor： John Colgrove ,  John Hayes ,  Bo Hong ,  Feng Wang ,  Ethan Miller ,  Craig Harmer

    IPC: G06F3/06

    CPC classification number: G06F3/0619 ,  G06F3/061 ,  G06F3/0613 ,  G06F3/0646 ,  G06F3/0659 ,  G06F3/0665 ,  G06F3/0688 ,  G06F3/0689 ,  G06F11/0727 ,  G06F11/0751 ,  G06F11/1076 ,  G06F12/0804 ,  G06F2003/0697

    Abstract: A system and method for effectively scheduling read and write operations among a plurality of solid-state storage devices. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array comprises an I/O scheduler. The storage controller is configured to receive a read request targeted to the data storage medium, and identify at least a first storage device of the plurality of storage devices which contains data targeted by the read request. In response to either detecting or predicting the first storage device will exhibit variable performance, the controller is configured to generate a reconstruct read request configured to obtain the data from one or more devices of the plurality of storage devices other than the first storage device.

    Abstract translation: 一种用于在多个固态存储设备之间有效地调度读取和写入操作的系统和方法。 计算机系统包括经由网络彼此耦合的客户端计算机和数据存储阵列。 数据存储阵列利用固态驱动器和闪存单元进行数据存储。 数据存储阵列中的存储控制器包括I / O调度器。 存储控制器被配置为接收针对数据存储介质的读取请求，并且识别包含读取请求所针对的数据的多个存储设备中的至少第一存储设备。 响应于检测或预测第一存储设备将呈现可变性能，控制器被配置为生成重构读取请求，其被配置为从除第一存储设备之外的多个存储设备中的一个或多个设备获得数据。

    Low latency reads using cached deduplicated data
    199.
    发明授权
    Low latency reads using cached deduplicated data 有权

    公开(公告)号：US12141058B2

    公开(公告)日：2024-11-12

    申请号：US18306205

    申请日：2023-04-24

    Applicant: PURE STORAGE, INC.

    Inventor： John Colgrove ,  John Hayes ,  Ethan Miller ,  Feng Wang

    IPC: G06F12/10 ,  G06F3/06 ,  G06F12/02 ,  G06F12/0802 ,  G06F12/1009

    Abstract: Methods, computer systems, and computer readable medium are described for low latency reads using cached deduplicated data, including: receiving a request to read data from a storage system; query, using a generated hash value associated with the request to read data, one or more deduplication tables that corresponds to the hash value; and responsive to determining that the one or more deduplication tables includes an entry that corresponds to the hash value, using a mapping contained in the entry to perform the requested to read data, wherein the mapping includes a pointer to a physical location where at least a portion of the data is stored.

    Heterogenous memory accommodating multiple erasure codes
    200.
    发明授权
    Heterogenous memory accommodating multiple erasure codes 有权

    公开(公告)号：US12066895B2

    公开(公告)日：2024-08-20

    申请号：US18175422

    申请日：2023-02-27

    Applicant: PURE STORAGE, INC.

    Inventor： John Hayes ,  John Colgrove ,  Robert Lee ,  Igor Ostrovsky ,  Joshua Robinson

    IPC: G06F11/00 ,  G06F11/10 ,  G06F11/14

    CPC classification number: G06F11/1076 ,  G06F11/108 ,  G06F11/1088 ,  G06F11/1096 ,  G06F11/1415

    Abstract: A method for proactively rebuilding user data in a plurality of storage nodes of a storage cluster is provided. The method includes distributing user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can read the user data, using erasure coding, despite loss of two of the storage nodes. The method includes determining that one of the storage nodes is unreachable and determining to rebuild the user data for the one of the storage nodes that is unreachable. The method includes reading the user data across a remainder of the plurality of storage nodes, using the erasure coding and writing the user data across the remainder of the plurality of storage nodes, using the erasure coding. A plurality of storage nodes within a single chassis that can proactively rebuild the user data stored within the storage nodes is also provided.

Patent Agency Ranking