Abstract: Techniques manage stripes in a storage system. In accordance with such techniques, in the storage system including a plurality of storage devices, a device correlation of a storage device in the plurality of storage devices is determined according to a request for creating a stripe in the storage system. The device correlation indicates distribution of a set of stripes created in the storage system between the storage device and other storage devices than the storage device. One storage device is selected from the plurality of storage devices based on the determined device correlation. One extent in the selected storage device is added to the stripe. As such, all extents in the stripe can be distributed as evenly as possible in the plurality of storage devices in the storage system, thus ensuring load balancing of the storage system and more effective management of the stripes in the storage system.

Abstract: Techniques for replicating data involve: acquiring a first snapshot of a data block set, the first snapshot being a snapshot before a first subset of the data block set starts to be replicated; acquiring a second snapshot of the data block set, the second snapshot being a snapshot of the data block set when replication of the first subset is completed; and determining, based on a difference between the second snapshot and the first snapshot, a second subset of the data block set, the second subset being different from the first subset. Accordingly, such techniques can improve data protection efficiency in asynchronous replication.

Abstract: An aspect includes splitting a table of buckets into a fixed number of domains. Each of the domains includes a corresponding subset of the buckets. An aspect also includes providing a spare bucket for each of the subsets of the buckets and providing a metadata structure for each of the domains. The metadata structure includes a head pointer that points to a first bucket of a corresponding subset of the buckets and a spare_bucket pointer that points to the spare bucket of the subset of the buckets. An aspect further includes providing a split-spare bucket pointer that interleaves, during updates to data, among the subset of buckets in the domain. Data subject to the updates is stored in the spare bucket for a corresponding one of the domains. An aspect also includes updating the head pointer and the spare_bucket pointer for corresponding domains in response to updating the data.

Abstract: Described herein, system that facilitates mapping of redundant array of independent nodes of a storage device. According to an embodiment, a system can comprise generating a first configuration of a storage cluster, wherein the storage cluster comprises a group of nodes and a group of disks, generating a second configuration of the storage cluster using the first configuration, wherein the group of nodes are divided into a first pair of nodes comprising a first node having access to a first group of disks and a second node having access to a second group of disks, and generating a third configuration of the storage cluster using the second configuration, wherein the first node comprises a first mapped node that manages the first group of disks of the first node and enables access to the second group of disks of the second node.

Abstract: Embodiments of the present disclosure relate to a new approach for workload balancing in a system. A computer-implemented method comprises obtaining a configuration of a system, wherein the configuration includes a connection relationship between components in the system. The method further comprises determining a workload threshold of a given component in the components based on the configuration, wherein a workload threshold of an upstream component of the given component is associated with a workload limit of the upstream component and a workload limit of the given component. The method further comprises determining a utilization rate of the given component based at least partially on a workload amount of the given component, the workload threshold of the given component, and the workload threshold of the upstream component.

Abstract: A RAID storage-device-assisted deferred parity data update system includes a RAID primary data drive that retrieves second primary data via a DMA operation from host system, and XOR's it with first primary data to produce first interim parity data, which causes a RAID storage controller device to provide an inconsistent parity stripe journal entry in the host system. The RAID primary data drive then retrieves third primary data via a DMA operation from the host system, XORs it with the second primary data and the first interim parity data to produce second interim parity data. A RAID parity data drive retrieves the second interim parity data via a DMA operation, and XORs it with first parity data to produce second parity data that it uses to overwrite the first parity data, which causes the RAID storage controller device to remove the inconsistent parity stripe journal entry from the host system.

Abstract: In various embodiments, a method is presented for execution by a processing circuit of a storage network device that includes a processor. The method comprises: receiving, via the processing circuit, a first subset of encoded data slices of a set of encoded data slices corresponding to a data segment; identifying, via the processing circuit, at least one missing encoded data slice of the first subset of slices that is required to decode the data segment; generating, via the processing circuit, at least one rebuilt encoded data slice corresponding to the at least one missing encoded data slice utilizing locally decodable redundancy data; and recovering, via the processing circuit, the data segment based on the at least one rebuilt encoded data slice and the first subset of encoded data slices.

Abstract: A storage system in one embodiment comprises multiple storage nodes each comprising at least one storage device. Each of the storage nodes further comprises a set of processing modules configured to communicate over one or more networks with corresponding sets of processing modules on other ones of the storage nodes. The sets of processing modules of the storage nodes each comprise at least one control module. The storage system is configured to assign portions of a logical address space of the storage system to respective ones of the control modules, to receive a plurality of tracks of data records in a count-key-data format, and to store the tracks in respective ones of the portions of the logical address space assigned to respective ones of the control modules. Each of the tracks is stored in its entirety in the portion of the logical address space assigned to a corresponding one of the control modules.

Abstract: Disclosed herein is a thin-provisioned multi-node computer system with a disaggregated memory pool and a pooled memory controller. The disaggregated memory pool is configured to make a shared memory capacity available to each of a plurality of compute nodes, such memory capacity being thinly provisioned relative to the plurality of compute nodes. The pooled memory controller is configured to assign a plurality of memory segments of the disaggregated memory pool to the plurality of compute nodes; identify a subset of the plurality of segments as cold segments, such identification being based on determining that a usage characteristic for each such cold segment is below a threshold; and page one or more of the cold segments out to an expanded bulk memory device, thereby freeing one or more assigned memory segments of the disaggregated memory pool.

Abstract: In general, embodiments of the invention relate to storing data and managing the stored data in linked nodes. More specifically, embodiments of the invention relate to nodes linked together in a daisy chain configuration such as, but not limited to, a single-chain configuration and a dual-chain configuration, which use data protection domain (DPD) information to determine where and/or how to store the data.

Abstract: A method includes receiving an access request at a first computing device from a second computing device, the access request specifying a data structure, the data structure including first data stored in a first portion of the data structure and second data stored in a second portion of the data structure. The method also includes extracting a first key from the access request and identifying a data rights definition that is associated with the data structure and that is associated with a second key, the data rights definition indicating that the first data but not the second data is shared with an entity associated with the second computing device. The method further includes comparing the first key to the second key, and, based on the comparison, determining whether to grant the second computing device access to the first data but not the second data.

Abstract: Data is replicated on a backup node, where the granularity of the replication can be less than a full volume. A data consistency group comprising a subset of data for a volume is defined for a primary node. A set of differences for the data consistency group is sent to a backup node. The backup node creates change logs in response to receiving the set of differences. In response to receiving a request to access a file having data in the data consistency group, the backup node creates a clone of the file. The backup node determines whether an update to a data block of the file exists in the change logs. In response to determining that the update to the data block exists in the change logs, the backup node updates a copy of the data block for the cloned file with data in the change logs.

Abstract: A method for distributed file deletion or truncation, performed by a storage system, is provided. The method includes determining, by an authority owning an inode of a file, which authorities own data portions to be deleted, responsive to a request for the file deletion or truncation. The method includes recording, by the authority owning the inode, the file deletion or truncation in a first memory, and deleting, in background by the authorities that own the data portions to be deleted, the data portions in one of a first memory or a second memory. A system and computer readable media are also provided.

Abstract: Aspects of a storage device including a memory and a controller are provided for error detection and data integrity checking during the data transfer of write operations. The memory includes a write enable input. The controller generates data integrity information based on at least one data byte to be written to the memory, and transfers the at least one data byte and the data integrity information to the memory, with the data integrity information being transferred to the write enable input. A data integrity circuit receives the at least one data byte and the data integrity information from the controller, and detects whether an error exists in the at least one data byte based on the data integrity information. Accordingly, error detection of data being written to memory may be improved by the data integrity checking of the data prior to being written to the memory of the storage device.

Abstract: This disclosure provides techniques hierarchical address virtualization within a memory controller and configurable block device allocation. By performing address translation only at select hierarchical levels, a memory controller can be designed to have predictable I/O latency, with brief or otherwise negligible logical-to-physical address translation time. In one embodiment, address transition may be implemented entirely with logical gates and look-up tables of a memory controller integrated circuit, without requiring processor cycles. The disclosed virtualization scheme also provides for flexibility in customizing the configuration of virtual storage devices, to present nearly any desired configuration to a host or client.

Abstract: Technology is described for using spatial analysis of data objects associated with a multi-dimensional virtual environment to organize computational units in a distributed computing system. The data objects may be grouped together using spatial location information and collections of data objects may be treated as processing partitions (i.e., sub-divisions of the entire group of data objects). A mapping may be created between the data objects and processing partitions for processing applications which process data objects assigned to a processing partition. The processing partitions may be defined, in part, according to how the data objects are grouped together spatially. The processing partitions may be load-balanced across hardware hosts in the distributed computing system.

Abstract: Systems and methods for storing encoded data slices in a storage network involve generating a set of write slice requests relating to the encoded data slices, outputting the set of write slice requests to distributed storage units, receiving write slice responses and determining whether to retry storing the set of encoded data slices based on one or more of the write slice responses. Determining whether to retry storing the set of encoded data slices may involve determining whether less than a write threshold number of favorable responses were received, for example in a time period, and/or whether an unfavorable response was received. Determining whether to retry may also be based on receiving a slow or non-response. For purposes of retrying, the systems and methods may also determine whether to modify the write slice requests, for example by modifying a revision number.

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 method, article of manufacture, and apparatus for backing up data. In some embodiments, this includes backing up an object to a repository, segmenting the object into a plurality of sub-objects, and assigning a priority to a sub-object. Segmenting the object may include segmenting the object based on file access patterns. Assigning a priority may include assigning a high priority based on file access patterns, or based on policy, among others.

Abstract: In a storage system that implements RAID (D+P) protection groups a drive subset initially has (D+P) drives with (D+P) partitions. The drive subset is made to be symmetrical such that protection group members are symmetrically distributed in a matrix of drive rows and partition columns that represents the drive subset. A single new drive is added by partitioning the new drive with (D+P) partitions, moving existing protection group members from a selected partition of the (D+P) drives to partitions of the single new drive by rotating the selected partition by 90 degrees, and adding protection group members of a new protection group to the vacated selected partition of the (D+P) drives. The process is repeated until (D+P) new drives have been added in single drive increments. The resulting drive subset is then split by forming a non-symmetric drive subset from the (D+P) drives and forming a symmetric drive subset from the (D+P) new drives.

Abstract: Processing circuitry for computer memory management includes memory reduction circuitry to implement a memory reduction technique; and reference count information collection circuitry to: access a memory region, the memory region subject to the memory reduction technique; obtain an indication of memory reduction of the memory region; calculate metrics based on the indication of memory reduction of cache lines associated with the memory region; and provide the metrics to a system software component for use in memory management mechanisms.

Abstract: Methods for RAID stripe update parity calculation are disclosed. The methods include: receiving a first portion of data of a RAID stripe for writing to a first memory location of a plurality of solid state drives. A first parity value for the first portion of data of the RAID stripe is calculated. The methods include receiving a second portion of data of the RAID stripe for writing to a second memory location that is different from the first memory location. A second parity value is calculated based upon the second portion of the data and the first parity value Based on successfully writing the second portion of data of the RAID stripe, the first parity value is replaced with the second parity value.

Abstract: A system and method for performing an image level restore of data is described. In some examples, the system receives a request to restore a file and transmits the request to an intermediate component. The intermediate component may then retrieve a directory file from an image of a secondary copy of a data set, identify a location of the file from the directory file, and provide the location to the requestor.

Abstract: A storage system includes a redundancy group formed of storage drives that stores host data and redundant data in a distributed manner, and a controller that controls access to the redundancy group. The controller is configured to: select, from among the storage drives in the redundancy group, a part of the storage drives in an upper limit number equal to or smaller than a redundancy level of the redundancy group, and set the part of the storage drives to a power saving state; receive, from a host, a read request with respect to a target storage drive in the redundancy group; and restore, when the target storage drive is in the power saving state, target data corresponding to the read request from data collected from a part of the storage drives different from the target storage drive in the redundancy group, and return the target data to the host.

Abstract: Systems, methods, and machine-readable media are disclosed for collecting, maintaining, and retrieving use and limit data for connected resources, as well as determining an optimal location for creating a new volume (or volumes) on a storage platform and placing the volume at the determined location. A resource tracker collects resource use and/or limits data and stores it in a database. A volume placement service receives a volume deployment specification having constraints for creating a new volume. The volume placement service retrieves the data from the database. The volume placement service identifies an optimal location for the volume based at least in part on given constraints from the specification and the resource usage data. The system places the requested volume at the determined location.

Abstract: A technique for managing storage units involves: if it is determined that a first metadata storage unit for storing metadata of a plurality of storage units fails, allocating a second metadata storage unit for replacing the first metadata storage unit from a storage resource pool, wherein the metadata is read into a memory before the failure occurs, and first metadata of the first metadata storage unit is recorded in configuration information for indicating a valid metadata storage unit; recording second metadata of the second metadata storage unit in the configuration information; storing the metadata in the memory into the second metadata storage unit; and replacing the first metadata storage unit with the second metadata storage unit by validating the second metadata and invalidating the first metadata in the configuration information. Accordingly, such a technique improves reliability of a metadata storage unit.

Abstract: The present disclosure is directed to migrating logical volumes from a thick provisioned layout to a thin provisioned layout, and includes one or more processors and one or more computer-readable non-transitory storage media comprising instructions that, when executed by the one or more processors, cause one or more components of the system to perform operations comprising creating an abstraction layer on top of a logical volume in a storage device, the abstraction layer for accessing the logical volume, the logical volume one of a plurality of logical volumes in a volume group of the storage device; allocating a thin pool from remaining storage space in the volume group of the storage device; creating a snapshot of the logical volume; adding a thin virtual volume corresponding to the logical volume to the thin pool; and copying data from the snapshot to the thin virtual volume.

Abstract: A storage cluster includes a plurality of storage nodes. Each of the plurality of storage nodes includes nonvolatile solid-state memory and each of the plurality of storage nodes is configured to cooperate with others of the plurality of storage nodes having differing storage capacities in applying erasure coding. The plurality of storage nodes are configured to distribute the user data and metadata throughout the plurality of storage nodes.

Abstract: Techniques for managing disks involve: in response to a number of a plurality of disks to be partitioned being greater than a predetermined number of disks in a disk set, determining a plurality of candidate combinations of disk sets from the plurality of disks. The techniques further involve selecting a target combination from the plurality of candidate combinations, a first disk set of the target combination comprising at least a first subset corresponding to a first disk array, a second disk set of the target combination comprising at least a second subset corresponding to a second disk array, a number of disks in the first subset and a number of disks in the second subset being both equal to a first number and the disks in the first subset being different from the disks in the second subset. Accordingly, such techniques improve the storage efficiency of the disk array.

Abstract: A method, computer program product, and computer system for receiving an indication about an amount of background IOs a background scheduler is capable of performing on a plurality of applications, wherein the indication may be based upon, at least in part, one of host IO latency and a rate of the host IO latency being at one of a plurality of levels. One or more applications of the plurality of applications on which to perform the background IOs may be determined. The background IO applications to be performed on the one or more applications of the plurality of applications may be scheduled based upon, at least in part, one of the host IO latency and the rate of the host IO latency being at one of the plurality of levels.

Abstract: A method for execution by a computing device of a storage network includes determining an encoded data slice reduction scheme for a set of encoded data slices stored in a set of storage units of the storage network, where a data segment of data is encoded into the set of encoded data slices in accordance with encoding parameters, and where the encoding parameters include a pillar width number and a decode threshold number. The method further includes maintaining storage of the set of encoded data slices in accordance with the encoded data slice reduction scheme, where the maintaining storage includes keeping, until a deletion time for the set of encoded data slices, a number of encoded data slices of the set of encoded data slices equal to or greater than the decode threshold number and less than the pillar width number.

Abstract: In recovery processing, a distributed storage system 100 locks a storage area in which user data for recovery that is user data serving as data for recovery is stored in drives 405, and releases the lock after caching the user data for recovery in a memory 401 of any of computer nodes 101. Then, the distributed storage system 100 recovers recovery target data on basis of the user data for recovery cached in the memory 401. In write processing, the distributed storage system 100 updates the user data for recovery cached in the memory 401 in accordance with a write request and then writes the user data in accordance with the write request.

Abstract: An example device includes a processor; a first interface port forming a first datalink to a core network device via a first interconnect device; and a second interface port forming a second datalink to the core network device via a second interconnect device, the first and second datalinks being redundant connections of a link aggregation group (LAG) including a plurality of multiplexed connections within a single network media. The processor is to: remove the first interconnect device while maintaining the second datalink; update firmware of the first interconnect device upon receiving a first indication that the first interconnect device has stopped receiving or transmitting data; and reestablish the redundant connections of the first interconnect device upon receiving a second indication that the first interconnect device has been added back to the LAG. The first and second indications include indications of states in each connection of the multiplexed connections.

Abstract: Techniques perform data access to a disk array. The disk array includes a parity disk and a plurality of data disks. Via such techniques, data is written to the parity disk in the disk array in response to a write request to a failed data disk in the disk array when the disk array is in a degraded state; and corresponding degraded storage position information is set in disk resource mapping information so as to indicate that the data are stored in the parity disk. Accordingly, enormous computing resources can be saved, and I/O operations required by reads in the degraded state can be reduced.

Abstract: A cloud-based storage system within a cloud computing environment, the cloud-based storage system including: monitoring, for the cloud-based storage system, one or more storage system operations, wherein the cloud-based storage system includes a virtual instance storage layer and a cloud-based storage layer; determining, based at least upon the one or more storage system operations, one or more access patterns for the cloud-based storage system; and modifying, based at least upon the one or more access patterns for the cloud-based storage system, one or more cloud configurations for the cloud-based storage system.

Abstract: A virtual storage appliance having multiple storage processors is installed in a virtualized execution environment. Each one of the multiple virtual storage processors is a virtual machine that executes in the virtualized execution environment. At the time the virtual storage appliance is installed, properties of virtual resources provided by the virtualized execution environment to the virtual storage processors are obtained. The virtual resources provided by the virtualized execution environment to the virtual storage processors are consumed by the virtual storage processors while processing Input/Output (I/O) requests that are received by the virtual storage processors from at least one consumer application. The virtual storage processors are automatically configured in response to the properties of the virtual resources provided by the virtualized execution environment that are obtained at the time the virtual storage appliance is installed.

Abstract: Techniques are described for storing and maintaining, in a materialized view, bitmap data that represents a bitmap of each possible distinct value of an expression and rewriting a query for a count of distinct values of the expression using the materialized view. The materialized view contains bitmap data that represents a bitmap of each possible distinct value of a first expression, and aggregate values of additional expressions, and is stored in memory or on disk by a database system. The database system receives a query that requests a number of distinct values, of the first expression, and an aggregate value for an additional expression. In response, the database system, rewrites the query to: compute the number of distinct values by counting the bits in the bitmap data of the materialized view that are set to the first value, and obtains the aggregate value for the additional expression in the materialized view.

Abstract: A storage device and a method for operating the storage device are provided. A storage device includes processing circuitry configured to write multi-stream data on a non-volatile memory; generate parity data of the multi-stream data and/or intermediate parity data upon which the parity data is based; store the parity data and/or the intermediate parity data in a first memory; and perform a data swap between the first memory and a second memory, wherein a number of slots of a plurality of slots in the first memory is based on a number of execution units of program buffering of the non-volatile memory.

Abstract: A distributed ledger system has a configuration in which each of the distributed ledger subsystems includes a sub-ledger that holds ledger data shared in the distributed ledger subsystems, and a smart contract that interlocks between the distributed ledger subsystems having a common sub-ledger to perform a transaction processing related to an input and output of the ledger data, transmits a transaction request targeted for ledger data of another sub-ledger managed by another distributed ledger subsystem to another distributed ledger subsystem having the common sub-ledger by receiving a predetermined transaction request from a predetermined device and executing the smart contract, and replies with a transaction reply obtained from the other distributed ledger subsystem to the predetermined device.

Abstract: Techniques perform I/O management. The techniques involve: in response to receiving an I/O request for a redundant array of independent disks (RAID), determining a stripe of the RAID related to the I/O request; determining metadata corresponding to the stripe, the metadata indicating validity of current data in a corresponding data block of the RAID, the data block comprising one or more stripes; in response to the metadata indicating that the current data is valid, executing the I/O request by accessing the RAID; and in response to the metadata indicating that the current data is invalid, responding to the I/O request with zero data as the current data. Accordingly, disk access is reduced, metadata cache efficiency is increased, I/O performance is improved and the RAID reliability is enhanced.

Abstract: The present invention provides a control method of a server, wherein the control method includes the steps of: setting a first node within the server as a master device; setting a second node within the server as a slave device; controlling the first node to receive data from another device via network; storing the data into a first write buffer within the first node; performing a cache mirroring operation to copy the data stored in the first write buffer into a second write buffer within the second node; setting a first tail register and a first head register within the first node, and setting a second tail register and a second head register within the second node; and referring to the first tail register and the first head register to determine if the data stored in the first write buffer is successful written into the second write buffer.

Abstract: In one aspect a data replication process in a storage system includes creating, at a first target site, an empty container in a storage system. The empty container matches a container at a source site in response to initiation of an asynchronous data replication process. An aspect also includes transmitting a command to a second target site to create a container at the second target site. The first target site performs the asynchronous data replication process, which includes scanning the data upon receipt from the source site for a first target replication cycle and transmitting the scanned data to the container at the second target site for a second target replication cycle.

Abstract: The subject matter of this specification can be implemented in, among other things, a method that includes pre-registering, at a client device, one or more input/output (IO) buffers for a remote direct memory access (RDMA) interface at the client device. In response to pre-registering the one or more IO buffers at the client device, an application executed by the client device is provided with access to a distributed file system through the RDMA interface. In response to determining that data of a requested file in the distributed file system has been designated for caching, a first IO buffer among the IO buffers is designated as a cache for the data of the file. The data for the file is received via the RDMA interface and from the distributed file system, for the first IO buffer.

Abstract: A method for performing access management of a memory device with aid of information arrangement and associated apparatus (e.g. the memory device and controller thereof, and an associated electronic device) are provided. The method may include: when the host device sends a write command to the memory device, utilizing the memory controller to generate a plurality of ECC chunks respectively corresponding to a plurality of sets of memory cells of the NV memory according to data, for establishing one-to-one mapping between the plurality of ECC chunks and the plurality of sets of memory cells; and utilizing the memory controller to store the plurality of ECC chunks into the plurality of sets of memory cells, respectively, to prevent any two ECC chunks of the ECC chunks from sharing a same set of memory cells of the sets of memory cells, to enhance read performance of the memory controller regarding the data.

Abstract: A memory control method for a rewritable non-volatile memory module which includes a plurality of physical groups is provided according to an exemplary embodiment of the disclosure. The memory control method includes: storing first table information into a first physical group among the physical groups, wherein the first table information records management information corresponding to a first logical range; storing second table information into a second physical group among the physical groups, wherein the second table information also records the management information corresponding to the first logical range; and instructing a reading of the second table information from the second physical group to obtain the management information corresponding to the first logical range in response to that the first physical group is in a default status.

Abstract: Systems and methods for implementing stateful services using cloud-based resources are described. A server computing system determines existence of a first volume based on a launch of a first instance by an auto-scaling group (ASG). The first volume is to have a resource tag having a value similar to a value of a resource tag of the ASG. The first volume was previously attached to a second instance terminated by the ASG. Based on a successful determination of the existence of the first volume, the server computing system attaches the first volume to the first instance. Based on a failed determination of the existence of the first volume, the server computing system generates a second volume, attaches the second volume to the first instance, and set a resource tag of the second volume to a value similar to the value of the resource tag of the ASG.

Abstract: An memory component includes a memory bank and a command interface to receive a read-modify-write command, having an associated read address indicating a location in the memory bank and to either access read data from the location in the memory bank indicated by the read address after an adjustable delay period transpires from a time at which the read-modify-write command was received or to overlap multiple read-modify-write commands. The memory component further includes a data interface to receive write data associated with the read-modify-write command and an error correction circuit to merge the received write data with the read data to form a merged data and write the merged data to the location in the memory bank indicated by the read address.

Abstract: A method for rebuilding data in a distributed storage network (DSN) including a plurality of storage units. A rebuilding module of the DSN selects an address range associated with memory of a storage unit of the DSN, and initiates execution of data rebuilding activities for the selected address range. The rebuilding module determines a first rebuilding rate of the storage unit for a timeframe subsequent to initiating the execution of the data rebuilding activities. The rebuilding module further operates to pause the execution of the data rebuilding activities for a pause timeframe, and determine a second rebuilding rate of the storage unit for the pause timeframe. In response to determining that the second rebuilding rate compares favorably to the first rebuilding rate, the rebuilding module resumes execution of the data rebuilding activities. If the comparison is unfavorable, a second address range is selected for data rebuilding activities.

Abstract: Embodiments of the present disclosure provide a solution of evaluating a rebuilding performance of a redundant array of independent disks. In some embodiments, there is provided a computer-implemented method, comprising: simulating, based on a first group of redundant arrays of independent disks, a rebuilding process for a second group of redundant arrays of independent disks; obtaining a first performance metric of the simulated rebuilding process; and identifying a factor associated with the rebuilding performance of the second group of redundant arrays of independent disks based on the first performance metric.

Abstract: Replication handling among distinct network transfer layers, including: establishing, over a first type of network messaging layer, a communication link for replication between a first storage system and a second storage system; initiating, over a second type of network messaging layer, a configuration change to one or more aspects of the first storage system; and replicating, without disrupting the configuration change to the one or more aspects of the first storage system, data from the first storage system to the second storage system.