公开(公告)号：WO2013039522A1

公开(公告)日：2013-03-21

申请号：PCT/US2011/055590

申请日：2011-10-10

Applicant: MICROSOFT CORPORATION

Inventor： PALEOLOGU, Emanuel ,  MEHRA, Karan ,  MOSS, Darren

IPC: G06F12/16

CPC classification number: G06F11/1076 ,  G06F11/2064 ,  G06F2211/1009 ,  G06F2211/1035 ,  G06F2211/104 ,  G06F2211/1061

Abstract: A storage set (e.g., an array of hard disk drives) may experience a failure, such as a loss of power, a software crash, or a disconnection of a storage device, while writes to the storage set are in progress. Recover from the failure may involve scanning the storage set to detect and correct inconsistencies (e.g., comparing mirrors of a data set or testing checksums). However, lacking information about the locations of pending writes to the storage set during the failure, this "cleaning" process may involve scanning the entire storage set, resulting in protracted recovery processes. Presented herein are techniques for tracking writes to the storage set by apportioning the storage set into regions of a region size (e.g., one gigabyte), and storing on the nonvolatile storage medium descriptors of "dirty" regions comprising in-progress writes. The post-failure recovery process may then be limited to the regions identified as dirty.

Abstract translation: 存储组（例如，硬盘驱动器阵列）在对存储组的写入正在进行中可能经历诸如功率损失，软件崩溃或存储设备的断开之类的故障。 从故障恢复可能涉及扫描存储集以检测和纠正不一致（例如，比较数据集的镜像或测试校验和）。 但是，缺少关于在故障期间对存储集进行挂起的位置的信息，此“清理”过程可能涉及扫描整个存储集，导致持续的恢复过程。 这里提出的是通过将存储集合分配到区域大小（例如，一千兆字节）的区域来跟踪对存储集的写入的技术，并且在非易失性存储介质上存储包括正在进行的写入的“脏”区域的描述符。 然后，故障后恢复过程可以限于被识别为脏的区域。

公开(公告)号：WO2014159003A1

公开(公告)日：2014-10-02

申请号：PCT/US2014/021459

申请日：2014-03-07

Applicant: MICROSOFT CORPORATION

Inventor： PALEOLOGU, Emanuel ,  RAJPAL, Shiv K. ,  MEHRA, Karan ,  VERMA, Surendra ,  KIRUBANANDAN, Nandagopal

IPC: G06F11/10 ,  G06F11/16

CPC classification number: G06F11/2056 ,  G06F11/1076 ,  G06F11/1088 ,  G06F11/1658 ,  G06F11/2046 ,  G06F11/2089 ,  G06F11/2094

Abstract: Techniques for recovery and redistribution of data from a virtual disk storage system are described herein. In one or more implementations, a storage scheme derived for a virtual disk configuration is configured to implement various recovery and redistribution designed to improve recovery performance. The storage scheme implements one or more allocation techniques to produce substantially uniform or nearly uniform distributions of data across physical storage devices associated with a virtual disk. The allocation facilitates concurrent regeneration and rebalancing operations for recovery of data in the event of failures. Additionally, the storage scheme is configured to implements parallelization techniques to perform the concurrent operations including but not limited to controlling multiple parallel read/writes during recovery.

Abstract translation: 本文描述了用于从虚拟磁盘存储系统恢复和重新分发数据的技术。 在一个或多个实现中，为虚拟磁盘配置导出的存储方案被配置为实现旨在提高恢复性能的各种恢复和再分配。 存储方案实现一种或多种分配技术以在与虚拟盘相关联的物理存储设备上产生数据的基本统一或几乎均匀的分布。 该分配有助于并发再生和重新平衡操作，以便在发生故障时恢复数据。 此外，存储方案被配置为实现并行化技术来执行并行操作，包括但不限于在恢复期间控制多个并行读/写。

公开(公告)号：WO2013036254A1

公开(公告)日：2013-03-14

申请号：PCT/US2011/055581

申请日：2011-10-10

Applicant: MICROSOFT CORPORATION

Inventor： MEHRA, Karan ,  PALEOLOGU, Emanuel

IPC: G06F12/00 ,  G06F9/06

CPC classification number: G06F3/0605 ,  G06F3/0644 ,  G06F3/0689 ,  G06F9/5061

Abstract: A set of storage devices may interoperate to share a pool of storage space, such as in a Redundant Array of Inexpensive Disks (RAID) scheme. However, the details of the representation of the pool and allocation of capacity to the pool may enable advantages and/or impose limitations on the storage set. Presented herein are techniques for generating a representing a pooled partition on one or more storage devices featuring a pool configuration representing the pool as a set of spaces manifested by the pool; a set of storage devices sharing the pool; and a set of extents that map physical areas of the storage devices to logical areas of the spaces. The flexibility of these pooling techniques may enable such features as flexible capacity allocation, delayed binding, thin provisioning, and the participation of a storage device in two or more distinct pools shared with different sets of storage devices.

Abstract translation: 一组存储设备可以互操作以共享存储空间池，例如在冗余磁盘冗余阵列（RAID）方案中。 然而，池的表示细节和池的容量分配可能有利于和/或对存储集的限制。 这里提出的技术是在一个或多个存储设备上生成表示池化分区的技术，其特征在于将表示池的池配置作为由池显示的一组空间; 一组共享池的存储设备; 以及将存储设备的物理区域映射到空间的逻辑区域的一组盘区。 这些池化技术的灵活性可以实现诸如灵活容量分配，延迟绑定，精简配置以及存储设备参与与不同组存储设备共享的两个或多个不同池中的这些特征。

公开(公告)号：EP2756405A1

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

申请号：EP11872297.4

申请日：2011-10-10

Applicant: Microsoft Corporation

Inventor： PALEOLOGU, Emanuel ,  MEHRA, Karan ,  MOSS, Darren

IPC: G06F12/16

CPC classification number: G06F11/1076 ,  G06F11/2064 ,  G06F2211/1009 ,  G06F2211/1035 ,  G06F2211/104 ,  G06F2211/1061

Abstract: A storage set (e.g., an array of hard disk drives) may experience a failure, such as a loss of power, a software crash, or a disconnection of a storage device, while writes to the storage set are in progress. Recover from the failure may involve scanning the storage set to detect and correct inconsistencies (e.g., comparing mirrors of a data set or testing checksums). However, lacking information about the locations of pending writes to the storage set during the failure, this "cleaning" process may involve scanning the entire storage set, resulting in protracted recovery processes. Presented herein are techniques for tracking writes to the storage set by apportioning the storage set into regions of a region size (e.g., one gigabyte), and storing on the nonvolatile storage medium descriptors of "dirty" regions comprising in-progress writes. The post-failure recovery process may then be limited to the regions identified as dirty.

公开(公告)号：EP2754052A1

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

申请号：EP11872162.0

申请日：2011-10-10

Applicant: Microsoft Corporation

Inventor： MEHRA, Karan ,  PALEOLOGU, Emanuel

IPC: G06F12/00 ,  G06F9/06

CPC classification number: G06F3/0605 ,  G06F3/0644 ,  G06F3/0689 ,  G06F9/5061

Abstract: A set of storage devices may interoperate to share a pool of storage space, such as in a Redundant Array of Inexpensive Disks (RAID) scheme. However, the details of the representation of the pool and allocation of capacity to the pool may enable advantages and/or impose limitations on the storage set. Presented herein are techniques for generating a representing a pooled partition on one or more storage devices featuring a pool configuration representing the pool as a set of spaces manifested by the pool; a set of storage devices sharing the pool; and a set of extents that map physical areas of the storage devices to logical areas of the spaces. The flexibility of these pooling techniques may enable such features as flexible capacity allocation, delayed binding, thin provisioning, and the participation of a storage device in two or more distinct pools shared with different sets of storage devices.