Load balancing of resources
    41.
    发明授权

    公开(公告)号:US11016820B2

    公开(公告)日:2021-05-25

    申请号:US14010275

    申请日:2013-08-26

    Applicant: VMware, Inc.

    Abstract: Embodiments presented herein techniques for balancing a multidimensional set of resources of different types within a distributed resources system. Each host computer providing the resources publishes a status on current resource usage by guest clients. Upon identifying a local imbalance, the host computer determines a source workload to migrate to or from the resources container to minimize the variance in resource usage. Additionally, when placing a new resource workload, the host computer selects a resources container that minimizes the variance to further balance resource usage.

    Distributed policy-based provisioning and enforcement for quality of service

    公开(公告)号:US10855602B2

    公开(公告)日:2020-12-01

    申请号:US15889196

    申请日:2018-02-05

    Applicant: VMware, Inc.

    Abstract: Embodiments of the disclosure provide techniques for measuring congestion and controlling quality of service to a shared resource. A module that interfaces with the shared resource monitors the usage of the shared resource by accessing clients. Upon detecting that the rate of usage of the shared resource has exceeded a maximum rate supported by the shared resource, the module determines and transmits a congestion metric to clients that are currently attempting to access the shared resource. Clients, in turn determine a delay period based on the congestion metric prior to attempting another access of the shared resource.

    Maintaining hole boundary information for restoring snapshots from parity

    公开(公告)号:US10078549B2

    公开(公告)日:2018-09-18

    申请号:US14716740

    申请日:2015-05-19

    Applicant: VMware, Inc.

    Abstract: Exemplary methods, apparatuses, and systems maintain hole boundary information by calculating a block attribute parity value. For example, a request is received to write to a first block of a stripe of data. A block attribute of a second block is determined. The block attribute of the second block indicates whether the second block includes written data or is a hole. A block attribute parity value is calculated based upon both the block attribute of the first block and the block attribute of the second block. The block attribute of the first block indicates the first block includes written data based upon the received request. The block attribute parity value and the data parity value are stored on one of the physical storage devices in response to the received write request. As a result, if a disk is lost, holes can be recovered using the block attribute parity value.

    Partition tolerance in cluster membership management

    公开(公告)号:US09672115B2

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

    申请号:US14209426

    申请日:2014-03-13

    Applicant: VMware, Inc.

    Abstract: Techniques are disclosed for managing a cluster of computing nodes following a division of the cluster into at least a first and second partition, where the cluster aggregates local storage resources of the nodes to provide an object store, and objects stored in the object store are divided into data components stored across the nodes. In accordance with one method, it is determined that a majority of data components comprising a first object are stored within nodes in the first partition. It is determined that a majority of data components comprising a second object are stored within nodes in the second partition. Configuration objects are permitted to be performed on the first object in the first partition while denying access to the first object from the second partition, and on the second object in the second partition while denying access to the second object from the first partition.

    Maintaining High Availability During Network Partitions for Virtual Machines Stored on Distributed Object-Based Storage
    46.
    发明申请
    Maintaining High Availability During Network Partitions for Virtual Machines Stored on Distributed Object-Based Storage 审中-公开
    在分布式基于对象的存储中存储的虚拟机的网络分区期间维护高可用性

    公开(公告)号:US20170060620A1

    公开(公告)日:2017-03-02

    申请号:US15352046

    申请日:2016-11-15

    Applicant: VMware, Inc.

    Abstract: Techniques are disclosed for maintaining high availability (HA) for virtual machines (VMs) running on host systems of a host cluster, where each host system executes a HA module in a plurality of HA modules and a storage module in a plurality of storage modules, where the host cluster aggregates, via the plurality of storage modules, locally-attached storage resources of the host systems to provide an object store, where persistent data for the VMs is stored as per-VM storage objects across the locally-attached storage resources comprising the object store, and where a failure causes the plurality of storage modules to observe a network partition in the host cluster that the plurality of HA modules do not. In one embodiment, a host system in the host cluster executing a first HA module invokes an API exposed by the plurality of storage modules for persisting metadata for a VM to the object store. If the API is not processed successfully, the host system: (1) identifies a subset of second HA modules in the plurality of HA modules; (2) issues an accessibility query for the VM to the subset of second HA modules in parallel, the accessibility query being configured to determine whether the VM is accessible to the respective host systems of the subset of second HA modules; and (3) if at least one second HA module in the subset indicates that the VM is accessible to its respective host system, transmits a command to the at least one second HA module to invoke the API on its respective host system.

    Abstract translation: 公开了用于维护在主机集群的主机系统上运行的虚拟机(VM)的高可用性(HA)的技术,其中每个主机系统在多个HA模块中执行HA模块以及多个存储模块中的存储模块, 其中所述主机集群通过所述多个存储模块聚集所述主机系统的本地连接的存储资源以提供对象存储,其中所述VM的持久数据被存储为跨所述本地连接的存储资源的每个VM存储对象,包括 对象存储,以及故障导致多个存储模块观察主机集群中的多个HA模块没有的网络分区。 在一个实施例中,执行第一HA模块的主机集群中的主机系统调用由多个存储模块公开的API,用于将VM的元数据持久保存到对象存储。 如果API未被成功处理,则主机系统:(1)识别多个HA模块中的第二HA模块的子集; (2)并行地向所述第二HA模块的子集发起对所述VM的辅助性查询,所述辅助功能查询被配置为确定所述VM是否可访问所述第二HA模块子集的相应主机系统; 以及(3)如果所述子集中的至少一个第二HA模块指示所述VM可由其相应的主机系统访问,则向所述至少一个第二HA模块发送命令以在其相应主机系统上调用所述API。

    SNAPSHOTS AND CLONES IN A BLOCK-BASED DATA DEDUPLICATION STORAGE SYSTEM
    47.
    发明申请
    SNAPSHOTS AND CLONES IN A BLOCK-BASED DATA DEDUPLICATION STORAGE SYSTEM 审中-公开
    基于块的数据存储系统中的快照和克隆

    公开(公告)号:US20160350006A1

    公开(公告)日:2016-12-01

    申请号:US14726572

    申请日:2015-05-31

    Applicant: VMware, Inc.

    Abstract: A deduplication storage system with snapshot and clone capability includes storing logical pointer objects and organizing a first set of the logical pointer objects into a hierarchical structure. A second set of the logical pointer objects may be associated with corresponding logical data blocks of a client data object. The second set of the logical pointer objects may point to physical data blocks having deduplicated data that comprise data of the corresponding logical data blocks. Some of the logical pointer objects in the first set may point to the logical pointer objects in the second set, so that the hierarchical structure represents the client data object. A root of the hierarchical structure may be associated with the client data object. A snapshot or clone may be created by making a copy of the root and associating the copied root with the snapshot or clone.

    Abstract translation: 具有快照和克隆功能的重复数据删除存储系统包括存储逻辑指针对象并将第一组逻辑指针对象组织成层次结构。 第二组逻辑指针对象可以与客户机数据对象的相应逻辑数据块相关联。 第二组逻辑指针对象可以指向具有包括相应逻辑数据块的数据的重复数据删除数据的物理数据块。 第一组中的一些逻辑指针对象可以指向第二组中的逻辑指针对象,使得层次结构表示客户端数据对象。 层次结构的根可以与客户端数据对象相关联。 可以通过创建根的副本并将复制的根与快照或克隆相关联来创建快照或克隆。

    System and method for speed up data rebuild in a distributed storage system with local deduplication

    公开(公告)号:US11474724B2

    公开(公告)日:2022-10-18

    申请号:US15880391

    申请日:2018-01-25

    Applicant: VMware, Inc.

    Abstract: A method includes obtaining a plurality of representations corresponding respectively to a plurality of blocks of data stored on a source node. A plurality of data pairs are sent to a destination node, where each data pair includes a logical address associated with a block of data from the plurality of blocks of data and the corresponding representation of the block of data. A determination is made whether the blocks of data associated with the respective logical addresses are duplicates of data stored on the destination node. In accordance with an affirmative determination, a reference to a physical address of the block of data stored on the destination node is stored. In accordance with a negative determination, an indication that the data corresponding to the respective logical address is not a duplicate is stored. The data indicated as not being a duplicate is written to the destination node.

Patent Agency Ranking