公开(公告)号：US20140095823A1

公开(公告)日：2014-04-03

申请号：US13630099

申请日：2012-09-28

Applicant: VMWARE, INC.

Inventor： Faraz SHAIKH ,  Krishna YADAPPANAVAR ,  Murali VILAYANNUR

IPC: G06F12/02 ,  G06F9/455

CPC classification number: G06F9/455 ,  G06F9/45533 ,  G06F12/02 ,  G06F17/30233 ,  G06F2201/815 ,  G06F2201/84

Abstract: A virtualized computer system employs a virtual disk. Multiple snapshots of the virtual disk can be created. After a snapshot is created, writes to the virtual disk are captured in delta disks. Two snapshots are consolidated by updating block references in snapshot meta data. Block reference update takes advantage of the fact that blocks for the two snapshot are managed within the same storage container and, therefore, can be moved in the snapshot logical space without incurring data copy operations. Consolidation of delta disks also gracefully handles failures during the consolidation operation and can be restarted anew after the system has recovered from failure.

Abstract translation: 虚拟化计算机系统采用虚拟磁盘。 可以创建虚拟磁盘的多个快照。 创建快照后，对增量磁盘捕获到虚拟磁盘的写入。 通过更新快照元数据中的块引用来合并两个快照。 块参考更新利用了两个快照的块在相同的存储容器内进行管理，因此可以在快照逻辑空间中移动，而不会导致数据复制操作。 增量磁盘的合并也可以适当地处理整合操作中的故障，并且可以在系统从故障恢复之后重新启动。

公开(公告)号：US20140208321A1

公开(公告)日：2014-07-24

申请号：US14220279

申请日：2014-03-20

Applicant: VMWARE, INC.

Inventor： Faraz SHAIKH ,  Murali VILAYANNUR

IPC: G06F3/06 ,  G06F9/455

CPC classification number: G06F3/0664 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/0671 ,  G06F3/0689 ,  G06F9/455 ,  G06F9/45533 ,  G06F9/45558 ,  G06F11/1435 ,  G06F11/1484 ,  G06F12/02 ,  G06F12/08 ,  G06F17/30312 ,  G06F2009/45579 ,  G06F2206/1004

Abstract: A virtualized storage stack includes logical layers above the physical storage layer. Each logical layer allocates data blocks, and the data block allocation is propagated down to the physical storage layer. To facilitate contiguous storage, each layer of the virtualized storage stack maintains additional metadata associated with data blocks. For each data block, the metadata indicates whether the data block is free, provisioned and includes a tag that indicates when the data block was first written. Data blocks that were first written as part of the same write request share the same tag, and are mostly guaranteed to be physically co-located. Block allocations that reuse data blocks having the same tag are preferred. Such preference increases the likelihood of the blocks being contiguous in the physical storage as these blocks were allocated as part of the same first write.

Abstract translation: 虚拟化存储堆栈包括物理存储层之上的逻辑层。 每个逻辑层分配数据块，数据块分配向下传播到物理存储层。 为了便于连续存储，虚拟化存储堆栈的每一层维护与数据块相关联的附加元数据。 对于每个数据块，元数据指示数据块是否空闲，被配置，并且包括指示数据块何时被首次写入的标签。 首次写入相同写入请求的数据块共享相同的标签，并且主要保证在物理上位于同一位置。 重用具有相同标签的数据块的块分配是首选的。 这样的偏好增加了块在物理存储中是连续的可能性，因为这些块被分配为相同的第一次写入的一部分。

公开(公告)号：US20140236896A1

公开(公告)日：2014-08-21

申请号：US14263196

申请日：2014-04-28

Applicant: VMware, Inc.

Inventor： Christopher FROST ,  Jinyuan LI ,  Mayank RAWAT ,  Murali VILAYANNUR

IPC: G06F17/30

CPC classification number: G06F17/302 ,  G06F17/30194 ,  G06F17/30215 ,  G06F17/30575

Abstract: Multiple servers sharing a distributed file system are used to perform copies of regions of a source file in parallel from a source storage unit to corresponding temporary files at a destination storage unit. These temporary files are then merged or combined into a single file at the destination storage unit in a way that preserves the inode structure and attributes of the source file. A substantial speedup is obtained by copying regions of the file in parallel.

Abstract translation: 共享分布式文件系统的多个服务器用于从源存储单元并行地执行源文件区域的副本到目的地存储单元处的相应临时文件。 然后将这些临时文件以保存源文件的inode结构和属性的方式合并或组合到目标存储单元中的单个文件中。 通过并行复制文件的区域可以获得实质的加速。

公开(公告)号：US20140025820A1

公开(公告)日：2014-01-23

申请号：US14034171

申请日：2013-09-23

Applicant: VMware, Inc.

Inventor： Mayank RAWAT ,  Jinyuan LI ,  Murali VILAYANNUR ,  Daniel J. SCALES

IPC: H04L12/24

CPC classification number: H04L41/00 ,  G06F17/30171

Abstract: A method of acquiring a lock by a node, on a shared resource in a system of a plurality of interconnected nodes, is disclosed. Each node that competes for a lock on the shared resource maintains a list of locks currently owned by the node. A lock metadata is maintained on a shared storage that is accessible to all nodes that may compete for locks on shared resources. A heartbeat region is maintained on a shared resource corresponding to each node so nodes can register their liveness. A lock state is maintained in the lock metadata in the shared storage. A lock state may indicate lock held exclusively, lock free or lock in managed mode. If the lock is held in the managed mode, the ownership of the lock can be transferred to another node without a use of a mutual exclusion primitive such as the SCSI reservation.

Abstract translation: 公开了一种在多个互连节点的系统中的共享资源上获取节点锁定的方法。 竞争共享资源上的锁的每个节点维护节点当前拥有的锁的列表。 锁定元数据被维护在可以在共享资源上竞争锁定的所有节点可访问的共享存储器上。 心跳区域保持在对应于每个节点的共享资源上，所以节点可以注册其活动。 在共享存储器中的锁元数据中保持锁定状态。 锁定状态可以指示专门锁定，锁定或锁定在托管模式。 如果锁定在托管模式下，则锁的所有权可以传输到另一个节点，而不使用互斥原语，如SCSI保留。

公开(公告)号：US20150234857A1

公开(公告)日：2015-08-20

申请号：US14702568

申请日：2015-05-01

Applicant: VMware, Inc.

Inventor： Jinyuan LI ,  Murali VILAYANNUR ,  Mayank RAWAT

IPC: G06F17/30 ,  G06F11/07

CPC classification number: G06F16/1774 ,  G06F11/0712 ,  G06F11/0757 ,  G06F16/951

Abstract: A network-based method for managing locks in a shared file system (SFS) for a group of hosts that does not require any configuration to identify a server for managing locks for the SFS. Each host in the group carries out the steps of checking a predetermined storage location to determine whether there is a host ID written in the predetermined location. If there is no host ID written in the predetermined location, the first host to notice this condition writes its host ID in the predetermined location to identify itself as the server for managing locks. If there is a host ID written in the predetermined location, the host ID of the server for managing locks is maintained in local memory. When the host needs to perform IO operations on a file of the SFS, it communicates with the server for managing locks over the network using the host ID of the server for managing locks to obtain a lock to the file.

Abstract translation: 一种基于网络的方法，用于管理不需要任何配置的一组主机的共享文件系统（SFS）中的锁来标识用于管理SFS的锁的服务器。 组中的每个主机执行检查预定存储位置以确定是否存在在预定位置中写入的主机ID的步骤。 如果在预定位置没有写入主机ID，则注意到该状态的第一主机将其主机ID写入预定位置，以将其自身标识为用于管理锁的服务器。 如果在预定位置写入了主机ID，则用于管理锁定的服务器的主机ID被保存在本地存储器中。 当主机需要对SFS文件执行IO操作时，它将使用服务器的主机ID通过网络与服务器进行通信，以管理锁定，以获取锁定文件的锁定。

公开(公告)号：US20130036418A1

公开(公告)日：2013-02-07

申请号：US13631418

申请日：2012-09-28

Applicant: VMWare, Inc.

Inventor： Krishna YADAPPANAVAR ,  Faraz SHAIKH ,  Murali VILAYANNUR

IPC: G06F9/455 ,  G06F12/02

CPC classification number: G06F3/0611 ,  G06F3/0667 ,  G06F3/067 ,  G06F3/0689

Abstract: A virtualized computer system employs a virtual disk with a space efficient (SE) format to store data for virtual machines running therein. Data within a virtual disk with a SE format is stored in a grain, where multiple grains are included in a storage block. Writes to a grain within shared storage block in a virtual disk with an SE format are serviced by allocating a new grain and storing the write data to the new grain. Metadata associated with the client that transmitted the write request to the virtual disk is then updated to point to the new grain instead of the grain within the shared storage block.

Abstract translation: 虚拟化计算机系统采用具有空间效率（SE）格式的虚拟磁盘来存储在其中运行的虚拟机的数据。 具有SE格式的虚拟磁盘内的数据被存储在存储块中包含多个粒子的粒子中。 通过分配新的颗粒并将写入数据存储到新的颗粒，可以对具有SE格式的虚拟磁盘中的共享存储块内的纹理进行写入。 然后，将与客户端相关联的发送写入请求的元数据更新为指向新的粒度，而不是共享存储块中的粒度。

公开(公告)号：US20200065318A1

公开(公告)日：2020-02-27

申请号：US16671802

申请日：2019-11-01

Applicant: VMware, Inc.

Inventor： Austin CLEMENTS ,  Irfan AHMAD ,  Jinyuan LI ,  Murali VILAYANNUR

IPC: G06F16/27 ,  G06F16/31

Abstract: Decentralized deduplication operations in a computer system employ a hash index that is a variant of a B+ tree to support both efficient sequential updates as well as efficient random updates. Sequential update is selected when deduplication is infrequently performed, such as on the order of days, and random update is selected when deduplication is performed more frequently, such as on the order of seconds. More frequent deduplication may be beneficial during periods when large amounts of temporary duplicate data are created, and the system may not have enough storage space to accommodate the temporary spike in demand.

公开(公告)号：US20150370489A1

公开(公告)日：2015-12-24

申请号：US14839163

申请日：2015-08-28

Applicant: VMware, Inc.

Inventor： Faraz SHAIKH ,  Murali VILAYANNUR ,  Satyam B. VAGHANI ,  Kiran JOSHI

IPC: G06F3/06 ,  G06F9/455 ,  G06F17/30 ,  G06F12/02

CPC classification number: G06F3/0608 ,  G06F3/0631 ,  G06F3/0652 ,  G06F3/0665 ,  G06F3/067 ,  G06F9/45533 ,  G06F9/45558 ,  G06F12/0253 ,  G06F12/0261 ,  G06F12/0269 ,  G06F12/0276 ,  G06F17/30138 ,  G06F17/30194 ,  G06F17/30233 ,  G06F2009/45579 ,  G06F2212/1044 ,  G06F2212/154

Abstract: Free storage blocks previously allocated to a logical block device are released back to an underlying storage system supporting the logical block device in a manner that does not conflict with write operations that may be issued to the free storage blocks at about the same time. According to a first technique, write operations on the same storage blocks to be released are paused until the underlying storage system has completed the releasing operation or, if the write operations are issued earlier than when the underlying storage system actually performs the releasing operation, such storage blocks are not released. According to a second technique, a special file is allocated the free storage blocks, which are then made available for safe releasing.

Abstract translation: 先前分配给逻辑块设备的空闲存储块以与同时发布到空闲存储块的写入操作不冲突的方式被释放回支持逻辑块设备的底层存储系统。 根据第一技术，暂停对要释放的相同存储块的写入操作，直到底层存储系统已经完成释放操作，或者如果写入操作早于底层存储系统实际执行释放操作时发出，则 存储块未被释放。 根据第二种技术，将特殊文件分配给空闲的存储块，然后使其可用于安全释放。

公开(公告)号：US20140245299A1

公开(公告)日：2014-08-28

申请号：US13779051

申请日：2013-02-27

Applicant: VMWARE, INC.

Inventor： Krishna YADAPPANAVAR ,  Murali VILAYANNUR ,  Faraz SHAIKH

IPC: G06F9/455 ,  G06F9/50

CPC classification number: G06F9/45533 ,  G06F3/061 ,  G06F3/0659 ,  G06F3/0671 ,  G06F9/45558 ,  G06F9/50 ,  G06F9/545 ,  G06F2009/45579

Abstract: Input/output operations (IOs) are issued to a storage system using request queues that are each maintained for a resource targeted by the IOs. When an IO is requested, the target resource for the IO is first identified. If a request queue is maintained for the target resource, the IO is added to the request queue and the IO is issued to the storage system as the target resource becomes available. The availability of the target resource may be determined through periodic checks or by monitoring completions of IOs issued out of the request queue.

Abstract translation: 输入/输出操作（IO）将使用针对IO所针对的资源维护的请求队列发给存储系统。 当请求IO时，首先识别IO的目标资源。 如果为目标资源维护请求队列，则IO将被添加到请求队列中，并且当目标资源变为可用时，将IO发送到存储系统。 目标资源的可用性可以通过定期检查或通过监视从请求队列中发出的IO的完成来确定。