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

公开(公告)号：US10474656B1

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

申请号：US15438703

申请日：2017-02-21

Applicant: Nutanix, Inc.

Inventor： Dmitri Bronnikov

IPC: G06F17/30 ,  G06F16/22 ,  G06F16/215 ,  G06F16/21

Abstract: Systems and methods for key-value pair management. A method embodiment commences upon receiving data records comprising key-value pairs. The key-value pairs are stored in two locations, (1) in an in-memory data structure in a first storage tier, and (2) in a log file in a second storage tier. At some moment in time, an event causes a flush of the in-memory data structure. The flush operations comprise renaming the log file to refer to it as a uniquely identifiable data file in the second storage tier, and populating an index file in the second storage tier. Requests for a value corresponding to a key is satisfied by using the index file to access the uniquely identifiable data file by byte or word offset to a location in the data file so as to retrieve the value of the corresponding key.

公开(公告)号：US09672106B2

公开(公告)日：2017-06-06

申请号：US14586628

申请日：2014-12-30

Applicant: Nutanix, Inc.

Inventor： Dmitri Bronnikov ,  Binny Sher Gill

IPC: G11C29/00 ,  G06F11/10

CPC classification number: G06F11/1076

Abstract: A method for implementing erasure coding, including identifying a plurality of storage units, determining a number of storage unit failures to be tolerated, organizing data within the plurality of storage units as a matrix of rows and columns for computing one or more parity data, configuring the matrix to include one or more additional rows having preset values, computing the one or more parity data from the matrix that corresponds to the number of storage unit failures to be tolerated, wherein the one or more parity data comprises a row parity, a first diagonal parity, and a second diagonal parity, wherein the one or more additional rows having the preset values are used to compute the first diagonal parity and the second diagonal parity; and wherein the first diagonal parity comprises a different slope from the second diagonal parity.