Vmware, Inc.

Ritesh H Shukla

Li Ding

Mayank Rawat

Serge Pashenkov

Andrew Joseph Stone

Mark Sterin

Prashant Dhamdhere

Govindan Thirumal Thiruvengada

Raveesh Ahuja

Bret Needle

A computer system has a virtualization software that supports execution of a virtual machine in which a container is run. A method of provisioning a data volume for the container in this computer system includes the steps of monitoring a designated virtual socket, detecting, based on the monitoring, a request from a plug-in of the container to create a data volume, and upon detecting the request, communicating the request to the virtualization software to cause the virtualization software to create the data volume.

Provisioning data volumes for containers running in virtual machines

A computer system has a virtualization software that supports execution of a virtual machine in which a container is run. A method of managing allocation of storage resources to the container includes the steps of monitoring a virtual socket, detecting, based on the monitoring, a request from a plug-in of the container to create a data volume, upon detecting the request, retrieving a storage resource limit that has been set for the first virtual machine and determining if creation of the data volume causes the storage resource limit to be exceeded, and communicating the request to the virtualization software to cause the virtualization software to create the data volume if the limit is determined to be not exceeded and returning an error if the limit is determined to be exceeded.

Enforcing limits on a self-serve model for provisioning data volumes for containers running in virtual machines

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

A computer system has a virtualization software that supports execution of a virtual machine in which a container is run. A method of provisioning first and second data volumes for the container, wherein the first data volume is backed by storage device of a first type and the second data volume is backed by storage device of a second type, includes monitoring a designated virtual socket, detecting, based on monitoring, a first request from a plug-in of the container to create a first data volume having first storage requirements, upon detecting the first request, communicating the request to the virtualization software to create the first data volume, detecting, based on monitoring, a second request from a plug-in of the container to create a second data volume having second storage requirements, and upon detecting the second request, communicating the request to the virtualization software to create the second data volume.

Provisioning data volumes for containers running in virtual machines in which storage for the virtual machines are backed by heterogeneous storage devices

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.

Growing community of inventors

Saratoga, CA, United States of America

Ritesh H Shukla