Management of applications across nodes using exo-clones

    公开(公告)号:US10812582B2

    公开(公告)日:2020-10-20

    申请号:US15191228

    申请日:2016-06-23

    Applicant: VMware, Inc.

    Abstract: Examples disclosed herein relate to propagating changes made on a file system volume of a primary cluster of nodes to the same file system volume also being managed by a secondary cluster of nodes. An application is executed on both clusters, and data changes on the primary cluster are mirrored to the secondary cluster using an exo-clone file. The exo-clone file includes the differences between two or more snapshots of the volume on the primary cluster, along with identifiers of the change blocks and (optionally) state information thereof. Just these changes, identifiers, and state information are packaged in the exo-clone file and then exported to the secondary cluster, which in turn makes the changes to its version of the volume. Exporting just the changes to the data blocks and the corresponding block identifiers drastically reduces the information needed to be exchanged and processed to keep the two volumes consistent.

    Supporting file system clones in any ordered key-value store

    公开(公告)号:US10740039B2

    公开(公告)日:2020-08-11

    申请号:US15628016

    申请日:2017-06-20

    Applicant: VMware, Inc.

    Abstract: Embodiments described herein are related to cloning a volume in a file system. In some embodiments, a directory hard link is used to generate a clone of the root node of the volume. In certain embodiments, upon determining that a file or directory of the clone which comprises a hard link to an index node has been modified, a new object directory is generated beneath a root node of the volume. The index node may be added to the new object directory and one or more files and directories in the volume which link to the index node may be updated to contain symbolic links to the index node in the new object directory. In certain embodiments, a copy-on-write operation is performed in order to copy the file or directory and the new object directory to the clone.

    Management of B-tree leaf nodes with variable size values

    公开(公告)号:US10698865B2

    公开(公告)日:2020-06-30

    申请号:US15633726

    申请日:2017-06-26

    Applicant: VMware, Inc.

    Abstract: System and method for managing leaf nodes of a B-tree for a file system of a computer system utilize used slots in a directory section of a leaf node to index variable size key-value pair entries stored in a data section of the leaf node and free spaces slots in the directory section to index contiguous free spaces in the data section. Contents of the free space slots in the directory section are updated in response to changes in the contiguous free spaces in the data section to manage free space in the data section of the leaf node.

    File system that supports both case sensitive and case insensitive directory lookup

    公开(公告)号:US10515052B2

    公开(公告)日:2019-12-24

    申请号:US15655218

    申请日:2017-07-20

    Applicant: VMware, Inc.

    Abstract: A file system stores directories and files in a file system directory that uses case sensitive names. The same file system directory can support directory and file name lookups that treat the directory and file names in a case sensitive manner or in a case insensitive manner. The search criteria used for the lookup can be based on case-folding the name to produce a case-neutral name and on the original name with its case preserved. Search criteria can be generated for a case sensitive name lookup or for a case insensitive name lookup on the same file system directory, thus avoiding having to support separate file systems or separate file system directories for case sensitive and case insensitive file access.

    Sizing cache data structures using fractal organization of an ordered sequence

    公开(公告)号:US10191849B2

    公开(公告)日:2019-01-29

    申请号:US14969768

    申请日:2015-12-15

    Applicant: VMware, Inc.

    Abstract: A cache is sized using an ordered data structure having data elements that represent different target locations of input-output operations (IOs), and are sorted according to an access recency parameter. The cache sizing method includes continually updating the ordered data structure to arrange the data elements in the order of the access recency parameter as new IOs are issued, and setting a size of the cache based on the access recency parameters of the data elements in the ordered data structure. The ordered data structure includes a plurality of ranked ring buffers, each having a pointer that indicates a start position of the ring buffer. The updating of the ordered data structure in response to a new IO includes updating one position in at least one ring buffer and at least one pointer.

Patent Agency Ranking