Abstract: Embodiments of the present disclosure provide a method and device for RAID rebuilding. In some embodiments, there is provided a computer-implemented method. The method comprises: determining a spare redundant array of independent disks (RAID) group with spare capacity from a plurality of disks included in at least one RAID group of a storage pool; building spare logic units from the spare RAID group; and in response to a RAID group of the at least one RAID group of the storage pool being in a degradation state, rebuilding a failed disk in a degraded RAID group using the spare logic units.

Abstract: Techniques involve determining updated disk sets. The techniques further involve determining, from the updated disk sets, a target disk set for a storage unit associated with a plurality of storage disks. The techniques further involve determining position information of disk slices corresponding to the storage unit in the plurality of storage disks, in which the position information indicates respective updated disk sets in which the disk slices are located. The techniques further involve in accordance with a determination that an updated disk set indicated by position information of at least one of the disk slices is different from the target disk set, moving data in the at least one disk slice to the target disk set. Accordingly, an arrangement of a storage units across different disk sets can be avoided, and utilization rates of a plurality of storage disks can be made more uniform.

Abstract: An ALUA path distribution system includes host devices coupled to storage subsystems by aggregated networking devices. A first aggregated networking device snoops communications between the host devices and the storage subsystems to identify first snooped information, retrieves second snooped information identified by a second aggregated networking device, and uses the snooped information to build a path distribution table identifying each active-optimized path provided by the aggregated networking devices between the host devices and respective LUNs on the storage subsystems.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient address spaces are distributed across the plurality of storage devices such that each of the plurality of failure resilient address spaces spans a plurality of the storage devices. The plurality of computing devices maintains metadata that maps each failure resilient address space to one of the plurality of computing devices. The metadata is grouped into buckets. Each bucket is stored in the backend of a computing device. Access to a storage device may be managed according to an availability of the storage device. Reads from and writes to a storage device may be redirected when, for example, the storage device is over-utilized or performing garbage collection.

Abstract: Methods and systems for managing Key-Value Solid State Drives (KV SSDs). A method includes writing, by a host processor, at least one Key-value pair of at least one write command to at least one KV SSD of a plurality of KV SSDs of at least one RAID group based on at least one of slab information, available space and load. Further, the method includes reading, by the host processor, at least one value from the at least one KV SSD of the plurality of KV SSDs for at least one key of at least one read command using at least one of a consistent hashing function and slab information.

Abstract: Techniques involve: in accordance with a determination that a target disk in a set of disks is to be replaced, determining whether the target disk is a user disk for storing user data; in response to the target disk being the user disk, searching for a spare disk in the set of disks available for replacing the target disk; and in accordance with a determination whether the set of disks include a spare disk available for replacing the target disk, generating an indication of whether or not to provide a warning of replacing the target disk. Such techniques may more accurately provide warning of disk replacement.

Abstract: A computer-implemented method, according to one embodiment, includes: receiving a stream of data, and selecting more than one block of memory to write the stream of data to. The selected blocks of memory are in a memory that includes a plurality of blocks. Moreover, the data is written across the selected blocks of memory in parallel. The blocks of memory are also selected such that no two or more of the selected blocks of memory have an effect on a read apparent voltage of a same one of the plurality of blocks in the memory. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: Systems and methods for pre-fetching data based on memory usage patterns. An example method comprises: receiving a first memory access request identifying a first memory block; receiving a second memory access request identifying a second memory block; update a memory access tracking data structure by incrementing a sequence counter corresponding to a memory access sequence that references the first memory block and the second memory block; receive a third memory access request identifying a third memory block; identifying, based on the memory access tracking data structure, a sequence counter having a maximal value among sequence counters associated with memory access sequences that reference the third memory block; and pre-fetching a fourth memory block corresponding to the identified sequence counter.

Abstract: A host device is configured to communicate over a network with a storage system comprising a plurality of storage devices. The host device executes one or more processes that generate input-output (IO) operations for delivery to the storage system. The host device comprises a multi-path input-output (MPIO) driver configured to access for each of one or more of the storage devices a stored mapping between ranges of logical block addresses of the storage device and respective ones of a plurality of cache entities of the storage system, and for each of at least a subset of the IO operations, to identify a particular one of the cache entities based at least in part on a logical block address of the IO operation and the stored mapping, and to select a particular path for delivery of the IO operation to the storage system based at least in part on the identified cache entity.

Abstract: Techniques for performing configuration may include: determining an initial distribution of logical devices among disk adapters, wherein the initial distribution assigns each logical device a designated disk adapter as a primary active disk adapter servicing I/Os directed to the logical device, wherein the logical devices have storage provisioned from a RAID group including physical storage devices, wherein the disk adapters concurrently issue I/Os to each of the physical storage devices; detecting a configuration change; and responsive to detecting a configuration change, performing first processing. The first processing may include determining, in accordance with the configuration change, a redistribution of the logical devices among the disk adapters; and draining pending I/Os. The configuration change may include adding or removing a logical device provisioned from the RAID group.

Abstract: During preparation for migration of a logical volume from a source data storage appliance to a destination data storage appliance, a determination is made as to whether at least one host that accesses a copy of the logical volume contained in the source data storage appliance is managed by a host administration server. In response to determining that at least one host that accesses the copy of the logical volume contained in the source data storage appliance is managed by the administration server, a rescan request is transmitted to the administration server. The rescan request causes the host administration server to instruct each host that is managed by the host administration server that accesses the copy of the logical volume contained in the source data storage appliance to perform a rescan operation to discover at least one new path to the logical volume.

Abstract: Embodiments for reducing rebuild time in a computing storage environment in by a processor. One or more disk drive failures in a Redundant Array of Independent Disks (RAID)-6 may be rebuilt by holding at least three parity strips per stripe while using one or more of the at least three parity strips according the one or more disk drive failures.

Abstract: A method of using flash storage devices with different sized erase blocks is provided. The method includes allocating a plurality of erase blocks of heterogeneous erase block sizes to a RAID stripe, to form a tile pattern having the heterogeneous erase block sizes in the RAID stripe. The method includes writing the RAID stripe across the flash storage devices in accordance with the allocating, and stopping the writing the RAID stripe, responsive to contents of the RAID stripe reaching a threshold.

Abstract: An approach is provided for storing a snapshot of an execution image of a virtual machine (VM) instance. Based on VM, application, criticality, and change parameters, and based on a recommendation model trained on historical data about effects that changes caused by VM execution had on a capacity of a storage system that stores execution images of VM instances in first datastores, a tier is selected from multiple tiers of the storage system as the tier recommended for storing the snapshot. A datastore is selected for storing the snapshot so that the selected datastore is associated with the selected tier and selected from second datastores dedicated to storing only snapshots. The snapshot is created in the selected datastore and in the selected tier and unused space in a portion of the storage system for storing the first datastores is reduced.

Abstract: A computing system has a central processing unit (CPU), a plurality of n digital data repositories R1-Rn, having a common sector size, a file system, and a digital bus connecting the CPU and the plurality of n digital data repositories R1-Rn. The file system receives an original file to be stored of FS bits in size, creates a new file of NFS bits, comprising all the data structure of the original file, NFS evenly divisible by n and by the common sector size, divides the NFS by n, creating n portions P1-Pn, and stores one portion to each disk in the plural array simultaneously.

Abstract: Techniques manage a storage system. Such techniques involve, in response to receiving a request to add a first number of disks to a storage resource pool in the storage system, determining whether the first number of disks are to be added to the storage resource pool in a plurality of phases. Such techniques further involve determining a second number of disks to be added to the storage resource pool in the first phase. Such techniques further involve determining first information on a first disk array group to be created with the second number of disks in the first phase. Such techniques further involve adding the second number of disks to the storage resource pool in the first phase by creating the first disk array group based on the first information. Such techniques enable a user to obtain an available capacity of the extended storage resource pool quickly and efficiently.

Abstract: A scalable software stack is disclosed. In particular, the present disclosure provides a system and a method directed at allocating logical ownership of memory locations in a shared storage device among two or more associated compute devices that have access to the storage device. The logical ownership allocation can minimize potential conflicts between two simultaneous accesses occurring within the same memory location of the storage device.

Abstract: A system including a storage drive and a semiconductor apparatus coupled to the storage drive, is provided. The semiconductor apparatus may include one or more substrates and logic coupled to the one or more substrates, the logic coupled to the one or more substrates to: initiate managing resources of the storage drive and, if the storage drive loses capacity, determine an amount of capacity loss, create a reserved file that is associated with logical memory space in a file system, based on the amount of the capacity loss, and erase at least a portion of the reserved file so that logical memory space associated with an un-erased portion of the reserved file is usable by the storage drive.

Abstract: Systems and methods for storage resource and computation resource expansion. A method embodiment includes migrating a computing task from an external computing environment to a different computing/storage environment. The method commences by identifying a storage system having virtualized controllers and by identifying a computing device that performs a workload that interfaces with the storage system. The virtualized controllers execute in the second computing environment to manage access to storage target devices by accessing a storage target device identified by an IP address. A particular virtualized controller that is connected to the storage target device is selected and configured to process storage I/O from a migrated workload. A user virtual machine or user executable container is configured to execute the workload on one of the nodes in the computing and storage system within the second computing environment.

Abstract: A higher-level system that inputs and outputs data to/from a storage area including one or more logical areas respectively provided from one or more NVM drives manages the storage area, and manages a plurality of chunks that are a plurality of areas forming the storage area, each of the chunks being a unit of data input/output and being an non-overwritable area. Each of the plurality of chunks has the same chunk size, and each of the plurality of chunks includes a part of each of one or more logical areas. Each of the plurality of chunks includes, for each of the one or more NVM drives, all or part of one or more logical blocks that are one or more ranges corresponding to one or more physical blocks, respectively, but does not include at least a part of a logical block that is entirely or partially included in another chunk.

Abstract: A memory sub-system having non-volatile media on which multiple namespaces are allocated. A command from a host system has an identification of a namespace and at least one error recovery parameter. A controller of the memory sub-system configures the namespace on the non-volatile media according to the at least one error recovery parameter, stores the at least one error recovery parameter in association with the namespace, and controls error recovery operations for data access in the namespace in accordance with the at least one error recovery parameter stored in association with the namespace.

Abstract: The system receives a request to write data with an associated LBA. The system stores, in a global mapping table, a mapping of the LBA to a PBA assigned by a master node. The PBA is associated with a first storage drive in a first collection of storage drives, which includes a first set of storage drives and a plurality of redundant storage drives. The system writes, based on the PBA, the data to the first storage drive. In response to detecting that the first storage drive is defective, the system replaces the first storage drive with a redundant storage drive by reconstructing data stored in the defective storage drive based on a copy of the data. The system thus allows the first collection to remain online while replacing the defective storage drive.

Abstract: A method for suppressing data mirroring between a primary storage system and a secondary storage system is disclosed. In one embodiment, such a method includes defining a data class with an attribute designed to suppress mirroring of data from a primary storage system to a secondary storage system. The method assigns a data set to the data class, thereby causing the data set to inherit the attribute. In certain embodiments, assigning the data set to the data class includes recording the attribute in one or more of a volume-table-of-contents (VTOC) and a catalog used to reference the data set. The method automatically suppresses mirroring of the data set from the primary storage system to the secondary storage system in accordance with the assigned attribute. A corresponding system and computer program product are also disclosed.

Abstract: A system and method improve the performance of non-volatile memory storage by automatically, when one or more data storage devices are added to a first set of storage devices in a storage system, resulting in a second set of storage devices, remapping data stored in the first set of storage devices so as to redistribute data across the second set of storage devices while minimizing the amount of data moved to the newly added storage devices. In addition, the remapping and redistribution of data results in empty logical address regions in data storage devices from which data is copied, and a logical address compaction operation is used to remap one or more logical address ranges so as to eliminate the empty logical address regions, without moving data corresponding to the remapped logical address ranges.

Abstract: A method, computer program product, and computing system for managing wear balance in a mapped RAID storage system. According to embodiments, mapped RAID extents, which are comprised of storage disk extents, are assigned to particular mapped RAID groups based on one or more parameters related to wear experienced by disk extents associated with the RAID extent. Endurance parameters are measured and can be used by machine learning modules to predict future wear levels enabling predictive wear balancing in mapped RAID storage systems. Embodiments can be used when initially forming a mapped RAID group, when adding storage to an existing mapped RAID group, or when managing the ongoing performance of a mapped RAID group or storage system.

Abstract: Aspects of the innovations herein are consistent with a storage system for storing variable sized objects. According to certain implementations, the storage system may be a transaction-based system that uses variable sized objects to store data, and/or may be implemented using data stores, such as arrays disks arranged in ranks. In some exemplary implementations, each rank may include multiple stripes, each stripe may be read and written as a convenient unit for maximum performance, and/or a rank manager may be provided to dynamically configure the ranks. In certain implementations, the storage system may include a stripe space table that contains entries describing the amount of space used in each stripe. Further, an object map may provide entries for each object in the storage system describing the location, the length and/or version of the object.

Abstract: An aspect of performance optimization in a storage system environment includes providing a metadata structure that describes a storage space of a storage system. For each storage object of a plurality of storage objects, an aspect includes monitoring input/output (IO) patterns for IO operations conducted, monitoring deduplication characteristics of the storage object, and configuring local mapping layer parameters. An aspect further includes modifying local object metadata in the metadata structure as a function of the monitoring and the configuring.

Abstract: The bifurcation of a log into a fixed-size log portion and a growable log portion. Log records are first written to the fixed-size log portion. At some point, the older log records within the fixed-size log portion are destaged to the growable log portion. Destaging may involve copying the log records from the fixed-size log portion and tacking the log record onto the end of the growable log portion. This destaging might occur one sub-portion (e.g., one virtual log file) at a time. The more recent log records are within the fixed-size log portion. Accordingly, new writes to the log occur to the fixed-size log portion. Furthermore, a large portion of the reads are of the more recent log records within the fixed-size log portion. Thus, optimizing performance within the fixed-size log portion results in significant improvement in the performance of the overall log.

Abstract: According to implementations of the present disclosure, there is provided a method for managing a storage system, extents in the storage system being from multiple storage devices in a resource pool associated with the storage system. In the method, regarding multiple extents comprised in a storage device among the multiple storage devices, respective service states of the multiple extents are obtained. Respective features of respective extents among the multiple extents are determined on the basis of respective service states of the multiple extents. An association relation between a failure in an extent in a storage device in the resource pool and a feature of the extent is obtained. A failure extent in which a failure is to be occurred is identified from the multiple extents on the basis of respective features of the multiple extents and the association relation.

Abstract: A first node group including at least three nodes is predefined in a distributed storage system. Each node of the first node group is configured to send data blocks stored in storage devices managed by the node to other nodes belonging to the first node group. A first node is configured to receive data blocks from two or more other nodes in the first node group. The first node is configured to create a redundant code using a combination of data blocks received from the two or more other nodes and store the created redundant code to a storage device different from storage devices holding the data blocks used to create the redundant code. Combinations of data blocks used to create at least two redundant codes in redundant codes created by the first node are different in combination of logical addresses of constituent data blocks.

Abstract: Proactive management of a plurality of storage arrays in a multi-array system, including: comparing one or more conditions of a particular storage array to conditions of other storage arrays in the multi-array system; and generating an action recommendation based on the comparison, the action recommendation specifying one or more actions for improving the conditions of the particular storage array relative to the conditions of the other storage arrays.

Abstract: A system and method is provided for fast random access erasure encoded storage. An exemplary method includes writing data to an append-only data log that includes data log extents that are each associated with data that is mapped to corresponding offset range of a virtual file of a client and storing the append-only data log as a sequence of data chunks each allocated on one or more one storage disks. Moreover, the method determines an amount of useful data in one or more data chunks and, when the amount of useful data in the data chunk is less than a predetermined threshold, appending the useful data from the data chunk to an end of the append-only data log. Finally, the data log is cleaned by releasing the one or more data chunk from the append-only data log after the useful data is appended to the append-only data log.

Abstract: Contraction of a doubly mapped redundant array of independent nodes, e.g., a doubly mapped cluster, is disclosed. Different mappings of data for a doubly mapped cluster corresponding to different uses of computing resources. Where a computing resource parameter indicates the computing resource is underutilized, an alternative mapping of the doubly mapped cluster can be undertaken. The alternative mapping can better utilize the computing resources. The contraction of the doubly mapped cluster can maintain access to stored data. The contraction can preserve data protection set integrity. The contraction can result in the doubly mapped cluster comprising fewer mapped nodes after the contraction but can avoid wholesale moving of corresponding data stored in a real cluster. As such, contraction of a doubly mapped cluster can be distinct from scaling-in of a doubly mapped cluster.

Abstract: A distributed storage system and a method for providing resiliency in distributed storage systems. The distributed storage system includes a plurality of storage nodes including a plurality of disks, wherein the plurality of disks includes a plurality of blocks, wherein the plurality of disks is logically segmented into the plurality of stripes, wherein each of the plurality of stripes is dynamically allocated to a portion of the plurality of blocks distributed across a subset of the plurality of disks; and a plurality of compute nodes, wherein each of the plurality of compute nodes is configured to read data from each of the plurality of storage nodes, wherein each of the plurality of compute nodes is assigned at least one stripe of the plurality of stripes, wherein each of the plurality of compute nodes is configured to write data to each stripe assigned to the compute node.

Abstract: A method for destaging data from cache is disclosed. In one embodiment, such a method includes maintaining, in cache, modified data to be destaged to persistent storage drives. The method further detects an emergency situation wherein the modified data needs to be promptly destaged to the persistent storage drives. In response to the emergency situation, the method automatically disables artificially-imposed throughput limits associated with the persistent storage drives. The method then destages the modified data to the persistent storage drives without restriction from the artificially-imposed throughput limits. A corresponding system and computer program product are also disclosed.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes determining a first optimal slice size requirement is determined for a first independent data element (IDE). The first IDE is split into a first plurality of IDEs based on determining the first IDE compares unfavorably to the first optimal slice size requirement. An error coding function is performed on the first plurality of IDEs to produce a set of encoded slices for each of the first plurality of IDEs for transmission to storage units. A subset of additional IDEs are selected to be merged into a merged IDE based on a second optimal slice size requirement, and continuous content of the subset of additional IDEs is concatenated to produce the merged IDE. The error coding function is performed on the merged IDE to produce a second set of encoded slices for transmission to storage units.

Abstract: Techniques are describe herein for associating storage management properties with a group of files of a database referred to herein as a “file group”. In this system, storage management properties are defined at the database-level. Thus, multiple databases can be stored across a single disk group, gaining the benefits of having multiple block access devices working in parallel, but each respective database may be associated with a respective file group in a one-to-one relationship, so that each database can have different storage management properties.

Abstract: A high performance logical device having low latency may be provided. I/Os to the logical device may be sent only to a primary director having sole ownership of the logical device. The primary director may perform operations locally for the logical device. Such operations may include allocating global memory for use with the logical device from only a global memory portion that is local to the primary director. The global memory may be a distributed global memory including memory from multiple directors and possibly multiple engines. Cached data for the logical device may be mirrored automatically by the data storage system. Alternatively, the cached data for the logical device may be mirrored using a host-based mirroring technique.

Abstract: A memory system uses a dynamic RAID scheme to dynamically encode RAID address space geometries. The dynamic RAID scheme solves issues with the algorithmic layout approach and flat virtual address space used in conventional RAID systems. The dynamic RAID scheme can be used for any RAID algorithm and does not require static mapping. In other words, there is no requirement that each strip be located in the same relative location in memory devices and there is no requirement that stripes use the same combination of memory devices.

Abstract: A method for deterministic auto-configuration of a device upon connection to an apparatus includes as a first step, during a first-time connection of the device to the apparatus, a generation of a device-specific configuration data structure, wherein this configuration data structure identifies the configuration data of the device and/or the apparatus, which configuration data was determined during a first-time connection of the device to the apparatus. The next step is storing of the configuration data structure in the device and/or in the apparatus. During a renewed connection of the device to the apparatus, the first-time configuration data of the device and/or the apparatus is determined by means of the configuration data structure, and the device and/or the apparatus correspondingly furnishes the first-time configuration data. The system is equipped in such a way as to execute the stated method.

Abstract: A method of resilvering a plurality of failed devices in storage pools includes detecting a failure of a first storage device in a storage pool, identifying data blocks that were stored on the first storage device that are also stored on other storage devices, and resilvering the first storage device by transferring the data blocks from the other storage devices. While resilvering the first storage device, the method includes detecting a failure of a second storage device in the storage pool, identifying a subset of the data blocks that were stored on the first storage device that were also stored on the second storage device, and reusing a set of sequential I/O commands to resilver at least a portion of the second storage device with the subset of the data blocks.

Abstract: Embodiments of the present disclosure relate to methods, devices and computer program products for managing a redundant array of independent disks (RAID). The method comprises: in response to a number of a plurality of disks occupied by the RAID exceeding a first threshold, determining a first number of disk pairs to be disassociated among the plurality of disks, the first number of disk pairs at least comprising a first disk and a second disk associated with each other, and a first extent in the first disk and a second extent in the second disk being included in a same RAID extent of the RAID. The method further comprises determining a third disk for migrating at least one of the first extent and the second extent among the plurality of disks. Besides, the method further comprises migrating the at least one extent to the third disk to disassociate the first disk and the second disk so that a second number of disk pairs associated with each other among the plurality of disks is below a second threshold.

Abstract: Methods, systems, and media for detecting the presence of a digital media device on a network are provided. In some embodiments, methods for detecting a presence of a particular type of digital media device is provided, the methods comprising: identifying cached device details for devices previously associated with the network; performing a simple device discovery protocol (SSDP) on the network, and substantially concurrently sending a unicast message to an address associated with the identified cached digital media device using hypertext transfer protocol (HTTP); and indicating the presence of a digital media device on the network in response to either (i) receiving a response to the unicast message, or (ii) determining that a type of a device discovered using SSDP is the same as the particular device type.

Abstract: A SAN storage node has multiple engines, each including at least one computing node with at least one drive adapter for accessing arrays of drives. All drives of the SAN node are accessible by all drive adapters. The drives are organized into hypers. Each hyper is accessible to all drive adapters. Each drive is temporarily associated with a preferred owner for spin-up. A drive adapter that initializes spin-down of one of the drives takes a spindle lock on the drive being spun-down and prompts all other drive adapters to complete outstanding IOs on the drive being spun-down.

Abstract: Disclosed is a method, apparatus, and system for partition level restore, the operations comprising: determining a restoration source virtual machine disk image and a restoration target virtual machine disk image; determining partition information for the restoration source and target virtual machine disk images; determining whether the partition information for the restoration source virtual machine disk image matches the partition information for the restoration target virtual machine disk image; and in response to determining that the partition information for the restoration source virtual machine disk image matches the partition information for the restoration target virtual machine disk image, copying all data from a partition to be restored on the restoration source virtual machine disk image to a corresponding partition on the restoration target virtual machine disk image.

Abstract: A method for replicating instance data includes: detecting, based on producer instance replication configuration data, a data modification event associated with a record of a replication target table included in a replication set of the producer instance; generating replication event data of the data modification event when the data modification event is determined to be eligible for replication based on predetermined criteria included in the producer replication configuration data; placing the encrypted replication event data on an outbound replication queue to transport the replication event data to a logging infrastructure for replication; reading, at a consumer instance subscribing to the replication set of the producer instance, the replication event data from the logging infrastructure based on consumer instance replication configuration data; and loading a record onto a replication destination table of the consumer instance based on the read replication event data.

Abstract: An uneven distributed storage across a mesh fabric storage system may include receiving storage operations from one or more client devices and/or applications contemporaneously with receiving availability messaging from a set of multiple storage devices that may be of the same or different types. One or more of the storage operations may be assigned to a storage device that has signaled its readiness to perform the one or more storage operations via an issued availability message. Each storage device may thereby perform a subset of the collective set of storage operations with the uneven distribution allocating load that is directly commensurate with the performance of each storage device. Stored data may be moved between storage devices using a similar availability-driven methodology so as to reallocate capacity usage while still providing the fastest storage performance associated with all storage devices writing the data as it is generated.

Abstract: In one embodiment, a storage device comprises non-volatile storage media; a controller to receive, from a host, an object definition command that identifies a first data object and a second data object and a transformation to apply to the first data object and the second data object to generate a first transformed object and store the first transformed object in the non-volatile storage media; and a transformation engine to apply the transformation to the first data object and the second data object.

Abstract: A memory system connectable to a host includes a nonvolatile memory and a controller. The controller is configured to generate one or more virtual storage regions each of which is associated with a virtual machine running in the host, using physical memory regions of the nonvolatile memory, maintain a threshold value for each of said one or more virtual storage regions, determine a cumulative amount of data that have been written in each of said one or more virtual storage regions, and restrict writing of data with respect to a virtual storage region for which the cumulative amount exceeds the threshold value.

Abstract: Generally described, aspects of the present application correspond to enabling rapid duplication of data within a data volume hosted on a network storage system. The network storage system can maintain a highly distributed replica pool of the data volume, include a number of replicas duplicating data of the data volume. By providing increased parallelization, the replica pool can facilitate rapid duplication of the volume. In one configuration, each partition of a new volume is mapped to an individual replica within the replica pool, which supports population of the partition with data. Each replica can further include a set of replica partitions, such that read requests from each partition of a new volume are distributed among a number of servers to provide additional parallelization.