中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.018 seconds)

    Dynamic scheduling of distributed storage management tasks using predicted system characteristics
    2.
    发明授权
    Dynamic scheduling of distributed storage management tasks using predicted system characteristics 有权

    公开(公告)号：US11586381B2

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

    申请号：US16237450

    申请日：2018-12-31

    Applicant: Nutanix, Inc.

    Inventor： Karan Gupta ,  Varun Kumar Arora ,  Himanshu Shukla ,  Bharat Kumar Beedu ,  Abhinay Nagpal

    IPC: G06F12/00 ,  G06F3/06 ,  G06N20/20

    Abstract: Systems and methods for scheduling storage management tasks over predicted user tasks in a distributed storage system. A method commences upon receiving a set of historical stimulus records that characterize management tasks that are run in the storage system. A corresponding set of historical response records comprising system metrics associated with execution of the system tasks is also received. A learning model is formed from the stimulus records and the response records and formatted to be used as a predictor. A set of forecasted user tasks is input as new stimulus records to the predictor to determine a set of forecasted system metrics that would result from running the forecasted user tasks. Management tasks are selected so as not to impact the forecasted user tasks. Management tasks can be selected based on non-contentions resource usage between historical management task resource usage and predictions of resource usage by the user tasks.

    Dynamic data compression
    3.
    发明授权
    Dynamic data compression 有权

    公开(公告)号：US10203897B1

    公开(公告)日：2019-02-12

    申请号：US15448928

    申请日：2017-03-03

    Applicant: Nutanix, Inc.

    Inventor： ChernYih Cheah ,  Kiran Tatiparthi ,  Manosiz Bhattacharyya ,  Varun Kumar Arora

    IPC: G06F3/06 ,  G06F13/20

    Abstract: Techniques for performing compression operations on persistently-stored data blocks during read/write commands. A method embodiment performs in-line data compression operations over data blocks referenced by a caller. The in-line data compression operations are performed during execution of a storage input-output (I/O) command, between the event of receipt of the storage I/O command and the event of returning status of the storage I/O command. The storage I/O operation is associated with at least one data group comprising one or more data blocks that are identified by the caller. Upon receipt of the storage I/O command, one or more compression rules are applied to the data blocks to determine one or more compression parameters, which compression parameters are used to form specific compression operations that are performed over at least a portion of the data group. The status pertaining to the execution of the storage I/O operation is returned to the caller.

    Dynamic data compression
    5.
    发明授权
    Dynamic data compression 有权

    公开(公告)号：US11740818B2

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

    申请号：US16947980

    申请日：2020-08-26

    Applicant: Nutanix, Inc.

    Inventor： ChernYih Cheah ,  Kiran Tatiparthi ,  Manosiz Bhattacharyya ,  Varun Kumar Arora

    IPC: G06F3/06 ,  G06F13/20

    CPC classification number: G06F3/0638 ,  G06F3/061 ,  G06F3/0608 ,  G06F3/0673 ,  G06F3/0685 ,  G06F13/20

    Abstract: Techniques for performing compression operations on persistently-stored data blocks during read/write commands. A method embodiment performs in-line data compression operations over data blocks referenced by a caller. The in-line data compression operations are performed during execution of a storage input-output (I/O) command, between the event of receipt of the storage I/O command and the event of returning status of the storage I/O command. The storage I/O operation is associated with at least one data group comprising one or more data blocks that are identified by the caller. Upon receipt of the storage I/O command, one or more compression rules are applied to the data blocks to determine one or more compression parameters, which compression parameters are used to form specific compression operations that are performed over at least a portion of the data group. The status pertaining to the execution of the storage I/O operation is returned to the caller.

    Dynamic scheduling of distributed storage management tasks using predicted system characteristics
    6.
    发明授权
    Dynamic scheduling of distributed storage management tasks using predicted system characteristics 有权

    公开(公告)号：US11442660B2

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

    申请号：US16237450

    申请日：2018-12-31

    Applicant: Nutanix, Inc.

    Inventor： Karan Gupta ,  Varun Kumar Arora ,  Himanshu Shukla ,  Bharat Kumar Beedu ,  Abhinay Nagpal

    IPC: G06F12/00 ,  G06F3/06 ,  G06N20/20

    Abstract: Systems and methods for scheduling storage management tasks over predicted user tasks in a distributed storage system. A method commences upon receiving a set of historical stimulus records that characterize management tasks that are run in the storage system. A corresponding set of historical response records comprising system metrics associated with execution of the system tasks is also received. A learning model is formed from the stimulus records and the response records and formatted to be used as a predictor. A set of forecasted user tasks is input as new stimulus records to the predictor to determine a set of forecasted system metrics that would result from running the forecasted user tasks. Management tasks are selected so as not to impact the forecasted user tasks. Management tasks can be selected based on non-contentions resource usage between historical management task resource usage and predictions of resource usage by the user tasks.

    Dynamic data compression
    7.
    发明授权
    Dynamic data compression 有权

    公开(公告)号：US10776026B2

    公开(公告)日：2020-09-15

    申请号：US16255242

    申请日：2019-01-23

    Applicant: Nutanix, Inc.

    Inventor： ChernYih Cheah ,  Kiran Tatiparthi ,  Manosiz Bhattacharyya ,  Varun Kumar Arora

    IPC: G06F3/06 ,  G06F13/20

    Abstract: Techniques for performing compression operations on persistently-stored data blocks during read/write commands. A method embodiment performs in-line data compression operations over data blocks referenced by a caller. The in-line data compression operations are performed during execution of a storage input-output (I/O) command, between the event of receipt of the storage I/O command and the event of returning status of the storage I/O command. The storage I/O operation is associated with at least one data group comprising one or more data blocks that are identified by the caller. Upon receipt of the storage I/O command, one or more compression rules are applied to the data blocks to determine one or more compression parameters, which compression parameters are used to form specific compression operations that are performed over at least a portion of the data group. The status pertaining to the execution of the storage I/O operation is returned to the caller.

    Dynamic erasure coding
    8.
    发明授权
    Dynamic erasure coding 有权

    公开(公告)号：US10567009B2

    公开(公告)日：2020-02-18

    申请号：US15833962

    申请日：2017-12-06

    Applicant: Nutanix, Inc.

    Inventor： Minghui Yang ,  Timothy Sujay Isaacs ,  Ajaykrishna Raghavan ,  Dmitri Bronnikov ,  Jaya Singhvi ,  Peihong Huang ,  Varun Kumar Arora

    IPC: H03M13/35 ,  H03M13/15 ,  G06F11/10

    Abstract: Dynamic erasure coding for computing and data storage systems. A method embodiment commences upon accessing a set of fault tolerance policy attributes associated with the computing and data storage system. The topology of the system is analyzed to form mappings between the computing nodes of the system and the availability domains of the system. Based on the fault tolerance policy attributes, the topology, and the generated mapping, a plurality of feasible erasure coding configurations are generated. The feasible erasure coding configurations are scored. One or more high-scoring feasible erasure coding configurations are selected and deployed to the computing and data storage system. The method is repeated when there is a change in the fault tolerance policy attributes or in the topology. Depending on the topology and/or the nature of a change in the topology, more than one erasure coding configurations can be deployed onto the computing and data storage system.

    Dynamic scheduling of distributed storage management tasks using predicted system characteristics
    9.
    发明授权
    Dynamic scheduling of distributed storage management tasks using predicted system characteristics 有权

    公开(公告)号：US10168953B1

    公开(公告)日：2019-01-01

    申请号：US15160246

    申请日：2016-05-20

    Applicant: Nutanix, Inc.

    Inventor： Karan Gupta ,  Varun Kumar Arora ,  Himanshu Shukla ,  Bharath Kumar Beedu ,  Abhinay Nagpal

    IPC: G06F3/06 ,  G06N7/00

    Abstract: Systems and methods for scheduling storage management tasks over predicted user tasks in a distributed storage system. A method commences upon receiving a set of historical stimulus records that characterize management tasks that are run in the storage system. A corresponding set of historical response records comprising system metrics associated with execution of the system tasks is also received. A learning model is formed from the stimulus records and the response records and formatted to be used as a predictor. A set of forecasted user tasks is input as new stimulus records to the predictor to determine a set of forecasted system metrics that would result from running the forecasted user tasks. Management tasks are selected so as not to impact the forecasted user tasks. Management tasks can be selected based on non-contentions resource usage between historical management task resource usage and predictions of resource usage by the user tasks.

Patent Agency Ranking