Abstract: Techniques for data storage involve selecting a target Redundant Array of Independent Disks (RAID) from a plurality of RAIDs in a storage resource pool. Such techniques further involve determining a local neighbor matrix of the target RAID based on the target RAID, wherein the local neighbor matrix indicates distribution of a plurality of storage extents of a plurality of RAID extents of the target RAID on the storage resource pool. Such techniques further involve performing a resource reallocating operation on the storage resource pool based on the local neighbor matrix. Accordingly, a local neighbor matrix can be calculated at the granularity of an individual RAID, and the local neighbor matrix can be applied to balance a local neighboring relationship, so as to ensure overall balance of the neighbor matrix of the entire storage resource pool and improve IO performance.

Abstract: Techniques for processing data involve receiving an access request for a logical block used for storing data, the access request including a logical block address for the logical block. Such techniques further involve determining, if it is determined that the logical block address is in a used address space, an index entry corresponding to the logical block address from index entries, the index entry indicating arrangements of logical blocks on a corresponding pool stripe, wherein the pool stripe includes disk blocks from disks in a disk pool, and data blocks form at least one data stripe for a disk array. Such techniques further involve determining a target block corresponding to the logical block based on the index entry. Such techniques further involve processing the access request by using the target block. Accordingly, the processing speed of sequential I/O operations is improved, time is saved, and user experience is improved.

Abstract: Techniques for processing read/write requests involve determining an average response time for read/write requests to a storage device within a predetermined time period, and comparing the average response time with at least one predetermined threshold. Such techniques further involve adjusting a read/write request upper limit of the storage device based on the comparison between the average response time and the at least one predetermined threshold. Here, the read/write request upper limit indicates the maximum number of read/write requests in a read/write request queue for the storage device. In this way, the read/write request upper limit of a storage device may be dynamically adjusted based on a current response time of the storage device for processing read/write requests, and slow read/write processing caused by the accumulation of read/write requests at one storage device can be avoided.

Abstract: Techniques for data storage involve selecting a target Redundant Array of Independent Disks (RAID) from a plurality of RAIDs in a storage resource pool. Such techniques further involve determining a local neighbor matrix of the target RAID based on the target RAID, wherein the local neighbor matrix indicates distribution of a plurality of storage extents of a plurality of RAID extents of the target RAID on the storage resource pool. Such techniques further involve performing a resource reallocating operation on the storage resource pool based on the local neighbor matrix. Accordingly, a local neighbor matrix can be calculated at the granularity of an individual RAID, and the local neighbor matrix can be applied to balance a local neighboring relationship, so as to ensure overall balance of the neighbor matrix of the entire storage resource pool and improve IO performance.

Abstract: Techniques manage extents in a storage system having storage devices supporting a redundant storage strategy. A reserved area of the storage system is generated based on a set of first-type reserved extents respectively located in the storage devices, and the set of first-type reserved extents supports a reconstruction operation for a failed storage device when the failed storage device appears in the storage devices. A data area is generated based on a set of data extents respectively located outside the reserved area in the storage devices, and the data area provides data storage for a user. Here, a reserved extent size of the set of first-type reserved extents is smaller than a data extent size of data extents in the data area of the set of data extents. The quantity of extents can be reduced, thereby reducing overhead of storage and computing resources involved by associated metadata.

Abstract: Techniques for extending a storage system having a first pool involve adding, in response to a request, second storage devices, wherein the first pool is generated using first storage devices and based on a first standard. The first pool includes first stripes created using the first standard, and the number of the second storage devices equals a first stripe width associated with the first standard. Such techniques further involve creating a second pool using the second storage devices and based on a second standard, wherein a second stripe width associated with the second standard equals the first stripe width. Such techniques further involve creating second stripes in the second pool using the second storage devices and based on the second standard. Such techniques further involve storing data of at least one of the first stripes to a corresponding stripe of the second stripes according to a data shuffle rule.

Abstract: Techniques for processing data involve receiving an access request for a logical block used for storing data, the access request including a logical block address for the logical block. Such techniques further involve determining, if it is determined that the logical block address is in a used address space, an index entry corresponding to the logical block address from index entries, the index entry indicating arrangements of logical blocks on a corresponding pool stripe, wherein the pool stripe includes disk blocks from disks in a disk pool, and data blocks form at least one data stripe for a disk array. Such techniques further involve determining a target block corresponding to the logical block based on the index entry. Such techniques further involve processing the access request by using the target block. Accordingly, the processing speed of sequential I/O operations is improved, time is saved, and user experience is improved.

Abstract: Techniques for processing read/write requests involve determining an average response time for read/write requests to a storage device within a predetermined time period, and comparing the average response time with at least one predetermined threshold. Such techniques further involve adjusting a read/write request upper limit of the storage device based on the comparison between the average response time and the at least one predetermined threshold. Here, the read/write request upper limit indicates the maximum number of read/write requests in a read/write request queue for the storage device. In this way, the read/write request upper limit of a storage device may be dynamically adjusted based on a current response time of the storage device for processing read/write requests, and slow read/write processing caused by the accumulation of read/write requests at one storage device can be avoided.

Abstract: A technique extends a storage system that includes a first storage resource pool that is generated using a first plurality of storage devices and based on a first storage array standard. Such a technique involves: adding a second plurality of storage devices to the storage system in response to receiving a request to extend the storage system, the number of the second plurality of storage devices being less than the sum of a first stripe width associated with the first storage array standard and the number of backup storage devices in the first storage resource pool; and creating a second storage resource pool using the second plurality of storage devices and based on a second storage array standard, a second stripe width associated with the second storage array standard being less than the first stripe width. Accordingly, storage space can be extended faster and more effectively.

Abstract: Techniques for extending a storage system having a first pool involve adding, in response to a request, second storage devices, wherein the first pool is generated using first storage devices and based on a first standard. The first pool includes first stripes created using the first standard, and the number of the second storage devices equals a first stripe width associated with the first standard. Such techniques further involve creating a second pool using the second storage devices and based on a second standard, wherein a second stripe width associated with the second standard equals the first stripe width. Such techniques further involve creating second stripes in the second pool using the second storage devices and based on the second standard. Such techniques further involve storing data of at least one of the first stripes to a corresponding stripe of the second stripes according to a data shuffle rule.

Abstract: Techniques manage extents in a storage system having storage devices supporting a redundant storage strategy. A reserved area of the storage system is generated based on a set of first-type reserved extents respectively located in the storage devices, and the set of first-type reserved extents supports a reconstruction operation for a failed storage device when the failed storage device appears in the storage devices. A data area is generated based on a set of data extents respectively located outside the reserved area in the storage devices, and the data area provides data storage for a user. Here, a reserved extent size of the set of first-type reserved extents is smaller than a data extent size of data extents in the data area of the set of data extents. The quantity of extents can be reduced, thereby reducing overhead of storage and computing resources involved by associated metadata.

Abstract: A technique extends a storage system that includes a first storage resource pool that is generated using a first plurality of storage devices and based on a first storage array standard. Such a technique involves: adding a second plurality of storage devices to the storage system in response to receiving a request to extend the storage system, the number of the second plurality of storage devices being less than the sum of a first stripe width associated with the first storage array standard and the number of backup storage devices in the first storage resource pool; and creating a second storage resource pool using the second plurality of storage devices and based on a second storage array standard, a second stripe width associated with the second storage array standard being less than the first stripe width. Accordingly, storage space can be extended faster and more effectively.