中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

64 records (took 0.023 seconds)

    Scheduling policy for queues in a non-volatile solid-state storage
    21.
    发明授权
    Scheduling policy for queues in a non-volatile solid-state storage 有权
    在非易失性固态存储中排队的调度策略

    公开(公告)号：US09501244B2

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

    申请号：US14523719

    申请日：2014-10-24

    Applicant: Pure Storage, Inc.

    Inventor： John Hayes ,  Shantanu Gupta ,  John Davis ,  Brian Gold ,  Zhangxi Tan

    IPC: G06F3/06 ,  G06F12/02 ,  G06F13/16

    CPC classification number: G06F3/0619 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0623 ,  G06F3/0647 ,  G06F3/0652 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0679 ,  G06F3/0685 ,  G06F3/0688 ,  G06F11/1076 ,  G06F12/0246 ,  G06F12/1009 ,  G06F13/1626 ,  G06F2206/1014 ,  G06F2212/2022 ,  G06F2212/7201 ,  H03M13/154

    Abstract: A method of applying scheduling policies is provided. The method includes distributing user data throughout a plurality of storage nodes through erasure coding, wherein the plurality of storage nodes are housed within a single chassis coupling the storage nodes as a cluster. The method includes receiving operations relating to a non-volatile memory of one of the plurality of storage nodes into a plurality of operation queues. The method includes evaluating each of the operations in the plurality of operation queues as to benefit to the non-volatile solid-state storage according to a plurality of policies. For each channel of a plurality of channels coupling the operation queues to the non-volatile memory, the method includes iterating a selection and an execution of a next operation from the plurality of operation queues, with each next operation having a greater benefit than at least a subset of operations remaining in the operation queues.

    Abstract translation: 提供了一种应用调度策略的方法。 该方法包括通过擦除编码在多个存储节点中分配用户数据，其中多个存储节点被容纳在将存储节点耦合为一个簇的单个机架中。 该方法包括将与多个存储节点之一的非易失性存储器相关的操作接收到多个操作队列中。 该方法包括评估多个操作队列中的每个操作，以便根据多个策略使非易失性固态存储器受益。 对于将操作队列耦合到非易失性存储器的多个通道中的每个通道，该方法包括从多个操作队列中迭代选择和执行下一操作，其中每个下一操作具有比至少 操作队列中剩余的一组操作。

    Scheduling Policy for Queues in a Non-Volatile Solid-State Storage
    22.
    发明申请
    Scheduling Policy for Queues in a Non-Volatile Solid-State Storage 审中-公开
    非易失性固态存储中队列的调度策略

    公开(公告)号：US20160004479A1

    公开(公告)日：2016-01-07

    申请号：US14523719

    申请日：2014-10-24

    Applicant: Pure Storage, Inc.

    Inventor： John Hayes ,  Shantanu Gupta ,  John Davis ,  Brian Gold ,  Zhangxi Tan

    IPC: G06F3/06

    CPC classification number: G06F3/0619 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0623 ,  G06F3/0647 ,  G06F3/0652 ,  G06F3/0659 ,  G06F3/067 ,  G06F3/0679 ,  G06F3/0685 ,  G06F3/0688 ,  G06F11/1076 ,  G06F12/0246 ,  G06F12/1009 ,  G06F13/1626 ,  G06F2206/1014 ,  G06F2212/2022 ,  G06F2212/7201 ,  H03M13/154

    Abstract: A method of applying scheduling policies is provided. The method includes distributing user data throughout a plurality of storage nodes through erasure coding, wherein the plurality of storage nodes are housed within a single chassis coupling the storage nodes as a cluster. The method includes receiving operations relating to a non-volatile memory of one of the plurality of storage nodes into a plurality of operation queues. The method includes evaluating each of the operations in the plurality of operation queues as to benefit to the non-volatile solid-state storage according to a plurality of policies. For each channel of a plurality of channels coupling the operation queues to the non-volatile memory, the method includes iterating a selection and an execution of a next operation from the plurality of operation queues, with each next operation having a greater benefit than at least a subset of operations remaining in the operation queues.

    Abstract translation: 提供了一种应用调度策略的方法。 该方法包括通过擦除编码在多个存储节点中分配用户数据，其中多个存储节点被容纳在将存储节点耦合为一个簇的单个机架中。 该方法包括将与多个存储节点之一的非易失性存储器相关的操作接收到多个操作队列中。 该方法包括评估多个操作队列中的每个操作，以便根据多个策略使非易失性固态存储器受益。 对于将操作队列耦合到非易失性存储器的多个通道中的每个通道，该方法包括从多个操作队列中迭代选择和执行下一操作，其中每个下一操作具有比至少 操作队列中剩余的一组操作。

    Nonrepeating identifiers in an address space of a non-volatile solid-state storage
    23.
    发明授权
    Nonrepeating identifiers in an address space of a non-volatile solid-state storage 有权
    非易失性固态存储器的地址空间中的非重复标识符

    公开(公告)号：US09110789B1

    公开(公告)日：2015-08-18

    申请号：US14519004

    申请日：2014-10-20

    Applicant: Pure Storage, Inc.

    Inventor： John Hayes ,  Shantanu Gupta ,  John Davis ,  Brian Gold ,  Zhangxi Tan

    IPC: G06F12/00 ,  G06F13/00 ,  G06F12/02

    CPC classification number: G06F12/0246 ,  G06F3/061 ,  G06F3/0638 ,  G06F3/0683 ,  G06F3/0688 ,  G06F2212/7201

    Abstract: A method of applying an address space to data storage in a non-volatile solid-state storage is provided. The method includes receiving a plurality of portions of user data for storage in the non-volatile solid-state storage and assigning to each successive one of the plurality of portions of user data one of a plurality of sequential, nonrepeating addresses of an address space. The address range of the address space exceeds a maximum number of addresses expected to be applied during a lifespan of the non-volatile solid-state storage. The method includes writing each of the plurality of portions of user data to the non-volatile solid-state storage such that each of the plurality of portions of user data is identified and locatable for reading via the one of the plurality of sequential, nonrepeating addresses of the address space.

    Abstract translation: 提供了一种将地址空间应用于非易失性固态存储器中的数据存储的方法。 该方法包括接收多个用户数据部分以存储在非易失性固态存储器中，并且向用户数据的多个部分中的每个连续的一个部分分配地址空间的多个顺序的不重复的地址之一。 地址空间的地址范围超过在非易失性固态存储器的寿命期间期望应用的最大地址数量。 该方法包括将用户数据的多个部分中的每一个写入到非易失性固态存储器中，使得用户数据的多个部分中的每一个被识别并可定位用于通过多个顺序的非重复地址中的一个进行读取 的地址空间。

    Maintaining coherency in a distributed system
    24.
    发明授权
    Maintaining coherency in a distributed system 有权

    公开(公告)号：US12282799B2

    公开(公告)日：2025-04-22

    申请号：US17552606

    申请日：2021-12-16

    Applicant: PURE STORAGE, INC.

    Inventor： John Hayes ,  Brian Gold ,  Shantanu Gupta ,  Robert Lee ,  Hari Kannan

    IPC: G06F16/00 ,  G06F3/06 ,  G06F9/46 ,  G06F12/0802 ,  G06F12/0868 ,  G06F13/16 ,  G06F16/10

    Abstract: A method for a transactional commit in a storage unit is provided. The method includes receiving a logical record from a storage node into a transaction engine of a storage unit of the storage node and writing the logical record into a data structure of the transaction engine. The method includes writing, to a command queue of the transaction engine, an indication to perform an atomic update using the logical record and transferring each portion of the logical record from the data structure of the transaction engine to non-persistent memory of the storage unit as a committed transaction. A storage unit for a storage system is also provided.

    Enabling data portability between systems
    25.
    发明授权
    Enabling data portability between systems 有权

    公开(公告)号：US12079222B1

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

    申请号：US17160623

    申请日：2021-01-28

    Applicant: PURE STORAGE, INC.

    Inventor： Emily Potyraj ,  Joshua Robinson ,  Brian Gold

    IPC: G06F16/2457 ,  G06F16/248 ,  G06F16/27

    CPC classification number: G06F16/24573 ,  G06F16/248 ,  G06F16/275

    Abstract: Enabling data portability between systems, including: submitting, to a cloud-based metadata store storing metadata describing data stored in a plurality of storage systems each coupled for data communications with a corresponding on-premises cloud infrastructure of a plurality of on-premises cloud infrastructures, a query; selecting a subset of the data responsive to the query and stored in at least one first storage system coupled to at least one first on-premises cloud infrastructure; and storing, from the at least one first storage system to a second storage system coupled to a second on-premises cloud infrastructure, the subset of the data responsive to the query.

    Storage layer data obfuscation
    28.
    发明授权
    Storage layer data obfuscation 有权

    公开(公告)号：US11455409B2

    公开(公告)日：2022-09-27

    申请号：US16175221

    申请日：2018-10-30

    Applicant: PURE STORAGE, INC.

    Inventor： James Fisher ,  Brian Gold ,  Taylor Ericson ,  Ronald Karr

    IPC: G06F16/20 ,  G06F21/62 ,  G06F3/06 ,  G06F16/21 ,  G06F16/22

    Abstract: Storage layer data obfuscation, including: determining a subset of a dataset to obfuscate in accordance with a security policy; generating, based at least in part on the security policy, an obfuscated snapshot of the dataset that is representative of the dataset with the subset of the dataset obfuscated; and sending, to a target computer system, the obfuscated snapshot from which a restored version of the dataset includes the subset of the dataset obfuscated.

Patent Agency Ranking