Nutanix, Inc.

Pavan Kumar Konka

Karan Gupta

Rishi Bhardwaj

Parthasarathy Ramachandran

Tabrez Parvez Memon

Rohit Jain

Gowtham Alluri

Andrey Alexseyevich Pyatkov

Amod Vilas Jaltade

Arun Olappamanna Vasudevan

Amit Jain

Ranjan Parthasarathy

Jie Li

Harry Hai Yang

Xingchi Jin

Paul Michael Digioia

Aashray Arora

Krishna Ganti

Chinmay Dinesh Kamat

Alexander J Kaufmann

Deepthi Srinivasan

Aditya Vilas Jaltade

Avinash Manjaya Shetty

Yang Xiao

Arumugam Arumugam

A scalable multi-cluster resource sharing facility. A global witness process runs on a first computing platform that communicates over one or more networks to any number of nodes situated over two or more clusters. The global witness process listens on the network for occurrences of leadership and/or resource requests from nodes of different clusters. The global witness processes a request by retrieving a resource request and a respective last known state value, comparing the last known state value to a global stored state value, then storing a new state value when the respective last known state value is equal to the stored state value. Any number of contemporaneous requests can be processed by the global witness process, however only one request can be granted. The other requestors each receive a rejection of their resource request when their proffered last known state value is not equal to the stored state value.

Scalable leadership election in a multi-processing computing environment

Methods, systems and computer program products for computer system data management. A leader node that is in a leader-follower relationship with a follower node is deployed to manage metadata across a plurality of interconnected computing nodes of the computer system. Upon a failure of any sort that results in a loss of operation or a disconnection of the leader node, the followers undertake steps to bring up a new leader. Such steps to bring up a new leader include electing a new leader to replace the lost or disconnected leader and initializing the data state of the new leader node by causing the leader to request incremental snapshots from followers. Additional metadata that might have changed since closing the incremental snapshots can also be retrieved from the followers. The metadata that might have changed since the time of closing the incremental snapshot is subjected to verification using a consensus algorithm.

Managing incremental snapshots for fast leader node bring-up

Systems for high-performance distributed computing. The systems include techniques for managing data and metadata across multiple nodes. A method embodiment commences by storing data at a node using a first storage mechanism that is local to the node. A first set of metadata is configured to identify a storage location for the stored data. The first set of metadata is stored using the same first storage mechanism that is local to the node. For accessing the first set of metadata, a second set of metadata is configured to identify a storage location for the first set of metadata. The second set of metadata is stored using a second storage mechanism that comprises a distributed metadata storage facility that stores metadata across multiple storage locations having at least one of the multiple storage locations that is not local to the node that stores data and metadata using the first storage mechanism.

Efficient metadata management

Systems for low-latency data access in distributed computing systems. A method embodiment commences upon generating a first storage area in local storage of a first computing node. Access to the first storage area is provided through the first computing node. A second storage area is generated wherein the second storage area comprises a first set of metadata that comprises local storage device locations of at least some of the local storage areas of the first storage area. A set of physical access locations of the second storage area is stored to a database that manages updates to the second set of metadata pertaining to the second storage area. Accesses to the first storage area are accomplished by querying the database to retrieve a location of the second set of metadata, and then accessing the first storage area through one or more additional levels of metadata that are node-wise collocated.

Low latency access to physical storage locations by implementing multiple levels of metadata

Systems and methods for high availability computing systems. Systems and methods include disaster recovery of two-node computing clusters. A method embodiment commences upon identifying a computing cluster having two nodes, the two nodes corresponding to a first node and a second node that each send and receive heartbeat indications periodically while performing storage I/O operations. One or both of the two nodes detect a heartbeat failure between the two nodes, and in response to detecting the heartbeat failure, one or both of the nodes temporarily cease storage I/O operations. A witness node is accessed in an on-demand basis as a result of detecting the heartbeat failure. The witness performs a leadership election operation to provide a leadership lock to only one requestor. The leader then resumes storage I/O operations and performs one or more disaster remediation operations. After remediation, the computing cluster is restored to a configuration having two nodes.

Two node clusters recovery on a failure

Systems for low-latency data access in distributed computing systems. A method embodiment commences upon generating a first storage area in local storage of a first computing node. Access to the first storage area is provided through the first computing node. A second storage area is generated wherein the second storage area comprises a first set of metadata that comprises local storage device locations of at least some of the local storage areas of the first storage area. A set of physical access locations of the second storage area is stored to a database that manages updates to the second set of metadata pertaining to the second storage area. Accesses to the first storage area are accomplished by querying the database retrieve a location of the second set of metadata, and then accessing the first storage area through one or more additional levels of metadata that are node-wise collocated.

A method and apparatus for data driven and cluster specific version/update control. The apparatus includes an automated multi-clusters management apparatus that interfaces with a plurality of remote clusters to provide data driven version/update control on a cluster by cluster basis. Generally, operation includes collection/identification of cluster specific data pertaining to software, hardware, and cluster requirements. The cluster specific data is later compared/analyzed against multi-cluster data pertaining to software releases, hardware characteristics, and known bugs/issues for each. The results of the comparison/analysis can then be ranked according to various metrics to different possible solutions and to differentiate the less desirable results from the more desirable results. Thus, the automated multi-cluster management apparatus provides for selection of versions/updates that is dependent on the cluster specific data. Additionally, the present disclosure provides for scheduling and distribution planning for selected versions/updates.

Method and apparatus for data driven and cluster specific version/update control

A virtual computing system deduplicates data. The system includes one or more processors, and one or more computer-readable storage media communicably coupled to the one or more processors. The one or more computer-readable storage media has instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to: scan extents for duplicate data chunks; calculate hash values for the extents at different chunk lengths; emit the hash values at the different chunk lengths; identify matching ones of the hash values; and select one or more candidates from among the matching ones of the hash values for dedup.

System and method for recursive de-duplication

A system using pulsed leader consensus management that can manage storage by electing a leader node from a group of nodes and fulfilling read requests for the group of nodes if a sync state is not expired. The sync state can correspond to two conditions: first, that the nodes in the group direct the write requests for the group to the leader node; second, that a health pulse is detected, wherein the health pulse is generated if the leader node is alive (e.g. has not failed, terminated, or become non-responsive). If either of the two conditions fail, the sync state can be considered expired and the group of nodes may fall back to consensus-based read mechanisms, such as Paxos, until a new leader node is elected.

Pulsed leader consensus management

An architecture for implementing a distributed metadata system in a virtualization environment comprising a plurality of servers, wherein each server may access and operate upon the entirety of the metadata in the virtualization environment. In response to a request received at a server to operate upon the metadata, existing metadata associated with the request is read by the server. The server performs one or more updates based upon the retrieved metadata, and attempts to update the corresponding stored metadata. In some embodiments, attempting to update the stored metadata comprises reading the metadata again and comparing it to the originally retrieved metadata, and performing the update only if the newly retrieved metadata matches the originally retrieved metadata.

Growing community of inventors

Milpitas, CA, United States of America

Pavan Kumar Konka