Nutanix, Inc.

International Business Machines Corporation

Karan Gupta

Prasenjit Sarkar

Himabindu Pucha

Pavan Kumar Konka

Rishi Bhardwaj

Renu Tewari

Gowtham Alluri

Frank Bernhard Schmuck

Roger Lee Haskin

Roger Sean Liao

Binny Sher Gill

Manoj Premanand Naik

Miao Cui

Parthasarathy Ramachandran

Dinesh Kumar Subhraveti

Andrey Alexseyevich Pyatkov

Dean Hildebrand

Wendy Ann Belluomini

Amit Jain

Manosiz Bhattacharyya

Anna Povzner

Ajaykrishna Raghavan

Dheer Moghe

Abhinay Nagpal

Tabrez Parvez Memon

Reshu Jain

Kamalneet Singh

Mansi Ajit Shah

Biswa Ranjan Panda

Anshul Nirmalendu Purohit

Madhukar R Korupolu

Bharat Kumar Beedu

Ranjan Parthasarathy

Prashant Pandey

Himanshu Shukla

Artem Yevgenyevich Livshits

Vanita Prabhu

Abhishek Gupta

Varun Kumar Arora

Rohit Jain

Brajesh Kumar Shrivastava

Prakash Narayanasamy

Peter Scott Wyckoff

Naveen Reddy Gundlagutta

Vinayak Hindurao Khot

Angshuman Bezbaruah

Arth Patel

Rajkumar Arunkumar Joshi

Amod Vilas Jaltade

Arun Olappamanna Vasudevan

Chinmay Dinesh Kamat

Shiva Chaitanya

Ajay Raghavan

Deepthi Srinivasan

Tarun Thakur

Rajiv Mirani

Anoop Reddy

Rickard Edward Faith

Jie Li

Kiran Tatiparthi

Rajagopal Ananthanarayanan

Mayur Vijay Sadavarte

Abhijit S Khinvasara

Anoop Jawahar

Ramesh U Chandra

Suresh Sivaprakasam

Srinivas Aiyar

Xingchi Jin

Harry Hai Yang

Ravi Sundaram

Paul Michael Digioia

Kilol Surjan

Bharath Kumar Beedu

Alexander J Kaufmann

Snehal Kamble

Rajesh Aavuty

Aditya Vilas Jaltade

Anand Varma Chekuri

Timothy Sujay Isaacs

Krishna Ganti

Aashray Arora

Gary Jeffrey Little

Huapeng Yuan

Manosiz Bhattacharrya

Ahmad Mohammad

Ravishankar Chandhiramoorthi

Biswaranjan Panda

Arumugam Arumugam

Hinal Gala

Bharath Kumar

Aashish Akhouri

Avinash Manjaya Shetty

Yang Xiao

Mansi A Shah

An indexing technique provides an index data structure for efficient retrieval of a snapshot from a long-term storage service (LTSS) of an archival storage system. The snapshot is generated from typed data of a logical entity, such as a virtual disk (vdisk). The data of the snapshot is replicated to a frontend data service of the LTSS sequentially and organized as one or more data objects for storage by a backend data service of LTSS in an object store of the archival storage system. Metadata associated with the snapshot (i.e., snapshot metadata) is recorded as a log and persistently stored on storage media local to the frontend data service. The snapshot metadata includes information describing the snapshot data, e.g., a logical offset range of a snapshot of the vdisk and, thus, is used to construct the index data structure. Notably, construction of the index data structure is deferred until after the entirety of the snapshot data has been replicated and received by the frontend data service.

Technique for efficiently indexing data of an archival storage system

A unified namespace technique provides coherent access to unstructured data across different data access protocols having different logical constructs that are stored and managed on a storage system. A control plane infrastructure operates in connection with storage services to provide support for a vast array of storage platforms including file servers of a file system and object storage servers of an object store. Metadata associated with a data access transaction is processed separately and natively by a protocol stack of a particular storage service according to a particular data access protocol. The processed metadata is stored native to the access protocol in a metadata store associated with the particular storage service and is made available to the protocol stacks of the other storage services. Processed metadata is made available to the protocol stacks via an event notification logging service implemented as a message bus. A single canonical instance of the data is maintained for all of the logical constructs served by the storage system.

Unified namespace across data access protocols

Systems for high-performance computing. A storage control architecture is implemented by a plurality of nodes, where a node comprises combinations of executable containers that execute in cooperation with virtual machines running above a hypervisor. The containers run in a virtual machine above a hypervisor, and/or can be integrated directly into the operating system of a host node. Sensitive information such as credit card information may be isolated from the containers in a separate virtual machine that is configured to be threat resistant, and which can be accessed through a threat resistant interface module. One of the virtual machines of the node may be a node-specific control virtual machine that is configured to operate as a dedicated storage controller for a node. One of the virtual machines of the node may be a node-specific container service machine that is configured to provide storage-related and other support to a hosted executable container.

Architecture for managing I/O and storage for a virtualization environment using executable containers and virtual machines

Architecture for managing i/o and storage for a virtualization environment using executable containers and virtual machines

An object tiering system transfers or tiers data objects from a data store to a cloud store. The system includes a processor and a memory having stored instructions that, when executed by the processor, cause the processor to ingest a first plurality of data objects in the data store, map a second plurality of data objects having a common tiering date to a region, and upon reaching the common tiering date, transfer the region to the cloud store. In some embodiments, the mapping is done a priori when each data object is ingested or at a first time before the common tiering date. In some embodiments, the common tiering date is a second time for transferring the second plurality of data objects from the data store to the cloud store. In some embodiments, the first plurality of objects includes the second plurality of objects.

Object tiering from local store to cloud store

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

A technique improves storage efficiency of an object store configured to maintain numerous snapshots for long-term storage in an archival storage system by efficiently determining data that is exclusively owned by an expiring snapshot to allow deletion of the expiring snapshot from the object store. The technique involves managing index data structures to enable efficient garbage collection across a very large number of data objects. When a snapshot expires, the technique obviates the need to scan the numerous snapshot data objects to determine which index structures are no longer needed and can be reclaimed (garbage collected). The technique is directed to management of underlying storage based on different sets of policies. When certain snapshots expire and are ready for deletion, the technique is directed to finding those data blocks that are no longer referenced (used) by any valid snapshots.

Garbage collection from archival of storage snapshots

An illustrative embodiment disclosed herein is an apparatus including a processor having programmed instructions to update a versioned object by appending a latest version of the versioned object to a data structure, read a predetermined version identifier corresponding to the latest version from a pointer entry, and look up the latest version of the versioned object, in the data structure, using the predetermined version identifier corresponding to the latest version of the versioned object.

System and method for supporting versioned objects

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

Various embodiments set forth techniques for managing and/or accessing metadata associated with a vblock, systems implementing said techniques, and computer-readable media storing instructions for performing said techniques. In some embodiments, one or more computer-readable media store instructions that, when executed by one or more processors, cause the one or more processors to perform steps including receiving a request for metadata associated with a vblock; accessing a merged metadata record associated with the vblock, where the merged metadata record comprises metadata corresponding to metadata in metadata records for all but a last snapshot or a live vblock having a metadata record, and a first identifier of the last snapshot or the live vblock having a metadata record; and returning the requested metadata based on the metadata in the merged metadata record and metadata in the metadata record identified by the first identifier.

Vblock metadata management

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

An illustrative embodiment disclosed herein is an apparatus including a processor with programmed instructions to receive a request to process storage data using a compute application, determine that a first location of the storage data is in a first storage resource in a first cluster of compute, storage, and network resources, determine that a second location of the compute application is in a first compute resource of a second cluster of compute, storage, and network resources, determine whether the first cluster includes a second compute resource that is compatible with the compute application, and respectively, either, based on a first compatibility determination, migrate the compute application from the first compute resource to the second compute resource, or, based on a second compatibility determination, replicate the storage data from the first storage resource to a second storage resource in the second cluster.

System and method for hyperconvergence at the datacenter

An illustrative embodiment disclosed herein is an apparatus including a processor and a memory. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to store a first object and a second object in a first region based on the first object and the second object having a first policy. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to store a third object in a second region based on the third object having a second policy. In some embodiments, a virtual disk includes the first region and the second region.

System and method for mapping objects to regions

Various embodiments set forth techniques for managing metadata associated with a vblock, In some embodiments, one or more computer-readable media store instructions that, when executed by one or more processors, cause the one or more processors to perform steps including receiving a request to write data to a live vblock, wherein the request to write data is a first write request for the live vblock; accessing a merged metadata record associated with the live vblock, wherein the merged metadata record comprises metadata corresponding to metadata in metadata records for all but a last snapshot included in a set of snapshots having a metadata record; adding metadata associated with the request to write data to a metadata record for the live vblock; merging a metadata record for the last snapshot into the merged metadata record; and updating a first identifier of the merged metadata record to identify the live vblock.

Growing community of inventors

San Jose, CA, United States of America

Karan Gupta