Maintaining quorum of storage objects in nested levels of a distributed storage system

    公开(公告)号:US10346063B2

    公开(公告)日:2019-07-09

    申请号:US15356413

    申请日:2016-11-18

    Applicant: VMware, Inc.

    Abstract: Exemplary methods, apparatuses, and systems determine that quorum can be maintained for a storage object in a distributed storage system in the event a defined maximum number of first partitions in a first level of storage and a second partitions in a second level of storage fail. When it is determined that there are insufficient numbers of first partitions and/or second partitions, additional first partitions and/or second partitions are associated with the storage object in the distributed storage system. A number of votes is calculated for distribution and an allocation is defined for assigning the votes to each component and witness component of the storage object.

    Flexible efficient runtime placement of data across multiple disks

    公开(公告)号:US10268408B2

    公开(公告)日:2019-04-23

    申请号:US15853110

    申请日:2017-12-22

    Applicant: VMware, Inc.

    Abstract: In a storage cluster having nodes, blocks of a logical storage space of a storage object are allocated flexibly by a parent node to component nodes that are backed by physical storage. The method includes maintaining a first allocation map for the parent node, and second and third allocation maps for the first and second component nodes, respectively, executing a first write operation on the first component node and updating the second allocation map to indicate that the first block is a written block, selecting the second component node for executing a second write operation, and executing the second write operation on the second component node. Upon execution of the second write operation, the third allocation map is updated to indicate that the second block is a written block and the first allocation map is updated to indicate that the second block is allocated to the second component node.

Patent Agency Ranking