公开(公告)号：US20160342468A1

公开(公告)日：2016-11-24

申请号：US14716740

申请日：2015-05-19

Applicant: VMware, Inc.

Inventor： Christos KARAMANOLIS ,  Radu BERINDE ,  Wenguang WANG

IPC: G06F11/10 ,  G06F3/06

CPC classification number: G06F11/1076 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/14 ,  G06F2211/1028 ,  G06F2211/104

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.

Abstract translation: 示例性方法，装置和系统通过计算块属性奇偶校验值来维持空穴边界信息。 例如，接收到写入数据条带的第一块的请求。 确定第二块的块属性。 第二块的块属性指示第二块是否包括写入数据或是孔。 基于第一块的块属性和第二块的块属性两者来计算块属性奇偶校验值。 第一块的块属性指示第一块包括基于接收到的请求的写入数据。 响应于接收到的写请求，块属性奇偶校验值和数据奇偶校验值被存储在物理存储设备之一上。 因此，如果磁盘丢失，则可以使用块属性奇偶校验值恢复孔。

公开(公告)号：US20170155691A1

公开(公告)日：2017-06-01

申请号：US14956284

申请日：2015-12-01

Applicant: VMware, Inc.

Inventor： Eric KNAUFT ,  Luke LU ,  Wenguang WANG ,  Pascal RENAULD ,  Radu BERINDE ,  Ruocheng LI

IPC: H04L29/06 ,  H04L29/08

Abstract: Examples perform input/output (I/O) requests, issued by a plurality of clients to an owner-node, in a virtual storage area network (vSAN) environment. I/O requests are guaranteed, as all I/O requests are performed during non-overlapping, exclusive sessions between one client at a time and the owner node. The owner node rejects requests for simultaneous sessions, and duplicate sessions are prevented by requiring that a client refresh its memory state after termination of a previous session.