Vmware, Inc.

Mayank Rawat

Deng Liu

Kiran Prakash Madnani

Thomas A Phelan

Murali Vilayannur

Jinyuan Li

Sambasiva Rao Bandarupalli

Li Ding

Li Zhou

Sandeep Madhav Uttamchandani

Satyam B Vaghani

Serge Pashenkov

Ritesh H Shukla

Wei Zhang

Abhishek Rai

Bret Needle

Daniel J Scales

Christopher Frost

Raveesh Ahuja

Christos Karamanolis

Keith Farkas

Xiaoyun Zhu

Cheng Li

Joanne Ren

Michael Zucca

Jianzhe Tai

Sambasiva Bandarupalli

In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.

Using a data mover and a clone blocklist primitive to clone files on a virtual file system

Using a data mover and a zero blocklist primitive to zero files on a virtual file system

Techniques for using a cache to accelerate virtual machine (VM) I/O are provided. In one embodiment, a host system can intercept an I/O request from a VM running on the host system, where the I/O request is directed to a virtual disk residing on a shared storage device. The host system can then process the I/O request by accessing a cache that resides on one or more cache devices directly attached to the host system, where the accessing of the cache is transparent to the VM.

Transparent host-side caching of virtual disks located on shared storage

User data of different snapshots for the same virtual disk are stored in the same storage object. Similarly, metadata of different snapshots for the same virtual disk are stored in the same storage object, and log data of different snapshots for the same virtual disk are stored in the same storage object. As a result, the number of different storage objects that are managed for snapshots do not increase proportionally with the number of snapshots taken. In addition, any one of the multitude of persistent storage back-ends can be selected as the storage back-end for the storage objects according to user preference, system requirement, snapshot policy, or any other criteria. Another advantage is that the storage location of the read data can be obtained with a single read of the metadata storage object, instead of traversing metadata files of multiple snapshots.

Tracking data of virtual disk snapshots using tree data structures

System and method for checking and characterizing metadata of snapshots utilize a snapshot metadata database to execute at least one of checking and characterizing operations on the metadata of snapshots. The snapshot metadata database includes information extracted from backing storage elements containing the metadata of snapshots.

System and method for checking and characterizing snapshot metadata using snapshot metadata database

Techniques for utilizing flash storage as an extension of hard disk (HDD) storage are provided. In one embodiment, a computer system stores a subset of blocks of a logical file in a first physical file, associated with a first data structure that represents a filesystem object, on flash storage and a subset of blocks, associated with a second data structure that represents a filesystem object comprising tiering configuration information that includes an identifier of the first physical file, in a second physical file on HDD storage. The computer system processes an I/O request directed to the logical file by directing it to either the physical file on the flash storage or the HDD storage by verifying that the tiering configuration information exists in the data structure and determining whether the one or more blocks are part of the first subset of blocks or the second subset of blocks.

Techniques for implementing hybrid flash/HDD-based virtual disk files

Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.

Tuning key space at the time of instantiation of a tree data structure

Techniques for dynamically allocating keys in an instance of a tree data structure are provided. In one embodiment, a computer system can, at a time of instantiating each non-root node in the instance, determine a key space to be addressed by the non-root node, where the key space is based on a key subinterval in a parent node of the non-root node that is associated with a pointer to the non-root node. The computer system can further calculate a number of bits to allocate to each key of the non-root node in view of the determined key space. The computer system can then allocate the keys of the non-root node in accordance with the calculated number of bits.

Leveraging hierarchy in a tree data structure to dynamically allocate keys

A method for restoring a data volume using incremental snapshots of the data volume includes creating a first series of incremental snapshots according to a first predefined interval. The method further includes creating a second series of incremental snapshots according to a second predefined interval that is an integer multiple of the first predefined interval. The method also includes receiving a request to restore the data volume to a point-in-time. The method further includes restoring the data volume to the point-in-time using none or some of the snapshots in the first series that were created at or prior to the point-in-time, and all of the snapshots in the second series that were created at or prior to the point-in-time.

Multiple hierarchies of snapshots

Techniques for surfacing host-side flash storage capacity to a plurality of VMs running on a host system are provided. In one embodiment, the host system creates, for each VM in the plurality of VMs, a flash storage space allocation in a flash storage device that is locally attached to the host system. The host system then causes the flash storage space allocation to be readable and writable by the VM as a virtual flash memory device.

Techniques for surfacing host-side storage capacity to virtual machines when performing VM suspend or snapshot operations

Data mover permitting data transfer without transferring data between application and operating system

Growing community of inventors

Sunnyvale, CA, United States of America

Mayank Rawat