中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

17 records (took 0.026 seconds)

    RECOVERING DATA WITHIN A UNIFIED STORAGE ELEMENT
    1.
    发明申请
    RECOVERING DATA WITHIN A UNIFIED STORAGE ELEMENT 审中-公开

    公开(公告)号：US20180357019A1

    公开(公告)日：2018-12-13

    申请号：US15966025

    申请日：2018-04-30

    Applicant: Pure Storage, Inc.

    Inventor： RONALD KARR ,  CONSTANTINE SAPUNTZAKIS ,  MARK MCAULIFFE ,  FARHAN ABROL ,  NEIL VACHHARAJANI ,  TIMOTHY BRENNAN

    IPC: G06F3/06 ,  G06F11/14

    Abstract: Staging data on a storage element integrating fast durable storage and bulk durable storage, including: receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique.

    Path Management For Container Clusters That Access Persistent Storage
    3.
    发明申请
    Path Management For Container Clusters That Access Persistent Storage 有权

    公开(公告)号：US20220217049A1

    公开(公告)日：2022-07-07

    申请号：US17701321

    申请日：2022-03-22

    Applicant: PURE STORAGE, INC.

    Inventor： TAHER VOHRA ,  PATRICK EAST ,  NEIL VACHHARAJANI

    IPC: H04L41/0893 ,  H04L41/22 ,  G06F3/06 ,  H04L45/24 ,  H04L67/1097 ,  H04L41/12 ,  H04L41/0803

    Abstract: Path management for container clusters that access persistent storage, including: configuring a container cluster to issue input/output (‘I/O’) operations to a storage system that provides persistent storage resources to the container cluster via a set of one or more data communications paths between the container cluster and the storage system; detecting a change to one or more data communications paths between the container cluster and the storage system; selecting, in dependence upon a path selection policy, an updated set of one or more data communications paths between the container cluster and the storage system to utilize for issuing I/O operations from the container cluster to the storage system; and issuing, from the container cluster to the storage system, I/O operations using the updated set of data communications paths.

    PRE-SCANNED DATA FOR OPTIMIZED BOOT
    4.
    发明申请
    PRE-SCANNED DATA FOR OPTIMIZED BOOT 有权

    公开(公告)号：US20220066786A1

    公开(公告)日：2022-03-03

    申请号：US17522714

    申请日：2021-11-09

    Applicant: PURE STORAGE, INC.

    Inventor： MARCO SANVIDO ,  RICHARD HANKINS ,  MARK McAULIFFE ,  HUIHUI CHENG ,  NIDHI DOSHI ,  NAVEEN NEELAKANTAM ,  NEIL VACHHARAJANI

    IPC: G06F9/4401 ,  G06F12/02

    Abstract: A system and method for efficiently starting up a plurality of solid-state storage devices. A computing system includes one or more storage devices storing data in multiple allocation units (AUs). In a boot region, a data storage controller maintains an AU management set that identifies a state of various AUs in the system. In various embodiments, the management set includes an identification of a subset of free AUs, transitional AU, unincorporated AUs, and speculative AUs. At various times, information corresponding to the AU management set is stored to non-volatile storage. During a boot sequence, the AU management set information is accessed and the identified AUs are searched to identify allocated AUs rather than performing a search of all of the AUs in the system.

    Using Mirrored Copies For Data Availability
    6.
    发明公开
    Using Mirrored Copies For Data Availability 审中-公开

    公开(公告)号：US20230267054A1

    公开(公告)日：2023-08-24

    申请号：US18310001

    申请日：2023-05-01

    Applicant: PURE STORAGE, INC.

    Inventor： MARK McAULIFFE ,  NEIL VACHHARAJANI ,  FARHAN ABROL

    IPC: G06F11/20 ,  H04L67/1097 ,  G06F11/14 ,  G06F11/07

    CPC classification number: G06F11/2058 ,  G06F11/2094 ,  G06F11/2023 ,  H04L67/1097 ,  G06F11/1441 ,  G06F11/076 ,  G06F11/0727 ,  G06F11/2064

    Abstract: Ensuring resiliency to storage device failures in a storage system, including: determining a number of storage device failures within a particular write group that are to be tolerated by the storage system; for a plurality of datasets stored within the storage system, writing each dataset to at least a predetermined number of storage devices within the particular write group, wherein the predetermined number of storage devices is greater than the number of storage device failures within the particular write group that are to be tolerated by the storage system; and responsive to recovering from a system interruption: determining a number of readable storage devices that contain a copy of the dataset; and if the number of readable storage devices that contain a copy of the dataset is not greater than the number of failures that are to be tolerated, writing the dataset to one or more additional storage devices.

    Cloud-Based User Authorization Control For Storage System Access
    7.
    发明申请
    Cloud-Based User Authorization Control For Storage System Access 有权

    公开(公告)号：US20230068106A1

    公开(公告)日：2023-03-02

    申请号：US18053402

    申请日：2022-11-08

    Applicant: PURE STORAGE, INC.

    Inventor： JIMMY T. HU ,  BENJAMIN BOROWIEC ,  ETHAN MILLER ,  TERENCE NOONAN ,  CONSTANTINE SAPUNTZAKIS ,  NEIL VACHHARAJANI ,  DAQUAN ZUO

    IPC: H04L9/40 ,  H04L9/32 ,  G06F9/455 ,  H04L67/1097

    Abstract: Providing authorization and authentication in a cloud for a user of a storage array includes: receiving, by a storage array access module from a client-side array services module, a token representing authentication of user credentials and authorized access privileges defining one or more storage array services accessible by the user, where the token is generated by a cloud-based security module upon authentication of the user credentials and identification of authorized access privileges for the user; receiving, by the storage array access module from the user, a user access request to one or more storage array services; and determining, by the storage array access module, whether to grant the user access request in dependence upon the authorized access privileges represented by the token.

    Dataset Space Reclamation
    8.
    发明申请
    Dataset Space Reclamation 有权

    公开(公告)号：US20230014142A1

    公开(公告)日：2023-01-19

    申请号：US17936484

    申请日：2022-09-29

    Applicant: PURE STORAGE, INC.

    Inventor： FREDERIC LHERAULT ,  NEIL VACHHARAJANI

    IPC: G06F3/06 ,  G06F12/02 ,  G06F9/455

    Abstract: Systems, methods, and computer readable storage mediums for discovering volumes which are good candidates for space reclamation. A storage subsystem identifies the file system storage capacity for a given volume from the file system metadata of the given volume. Then, the storage subsystem compares the file system capacity of the given volume to the allocated capacity on the storage subsystem. If the allocated capacity is greater than the file system capacity by a given threshold, the storage subsystem marks the given volume as a candidate for space reclamation and generates an alert to the user to reclaim the space of the given volume.

    Metadata Management In A Storage System
    10.
    发明申请
    Metadata Management In A Storage System 有权

    公开(公告)号：US20220269417A1

    公开(公告)日：2022-08-25

    申请号：US17667756

    申请日：2022-02-09

    Applicant: PURE STORAGE, INC.

    Inventor： MARCO SANVIDO ,  RICHARD HANKINS ,  MARK McAULIFFE ,  NEIL VACHHARAJANI

    IPC: G06F3/06 ,  G06F12/02 ,  G06F12/121

    Abstract: A system and method for efficiently maintaining metadata stored among a plurality of solid-state storage devices. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels. Each level stores at least pairs of a key value and a physical pointer value. The levels are sorted by time. New records are inserted in a created new highest (youngest) level. No edits are performed in-place. A data storage controller determines both a cost of searching a given table exceeds a threshold and an amount of memory used to flatten levels exceeds a threshold. In response, the controller incrementally flattens selected levels within the table based on key ranges. After flattening the records in the selected levels within the key range, the records may be removed from the selected levels. The process repeats with another different key range.

Patent Agency Ranking