METHOD, ELECTRONIC DEVICE, AND PROGRAM PRODUCT FOR SCHEDULING REQUESTS FOR RECLAIMING STORAGE SPACE

• US 20200133551A1
• Filed: 09/27/2019
• Published: 04/30/2020
• Est. Priority Date: 10/30/2018
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Inventors: Jiang, Changxu, Jiang, Zhenzong
• Granted Patent: US 11,169,724 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 3/0604 Improving or facilitating administration, e.g. storage management
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/0631 by allocating resources to storage systems
• CPC Class Codes: G06F 3/0644 Management of space entities, e.g. partitions, extents, pools
• CPC Class Codes: G06F 3/0653 Monitoring storage devices or systems
• CPC Class Codes: G06F 3/0659 Command handling arrangements, e.g. command buffers, queues, command scheduling
• CPC Class Codes: G06F 3/0683 Plurality of storage devices
• CPC Class Codes: G06F 3/0689 Disk arrays, e.g. RAID, JBOD

Abstract

Techniques perform data processing. Such techniques involve: generating, based on a time sequence that a plurality of requests are detected, a first-input first-output (FIFO) queue comprising the plurality of requests sent by a plurality of storage pools in a storage system for reclaiming storage spaces of the plurality of storage pools. Such techniques further involve: determining respective available storage spaces of the plurality of storage pools. Such techniques further involve: updating, based on the available storage spaces, a sequence of the plurality of requests in the FIFO queue for processing. Such techniques can effectively alleviate the problem that the storage pools are short of storage spaces.

Claims

1. A computer-implemented method, comprising:

generating, based on a time sequence that a plurality of requests are detected, a first-in first-out (FIFO) queue comprising the plurality of requests sent by a plurality of storage pools in a storage system for reclaiming storage spaces of the plurality of storage pools;

determining respective available storage spaces of the plurality of storage pools; and

updating, based on the available storage spaces, a sequence of the plurality of requests in the FIFO queue for processing.

2. The method of claim 1, wherein determining the respective storage spaces of the plurality of storage pools comprises:

determining, based on a state that a storage space of a storage pool of the plurality of storage pools is allocated or reclaimed, an available storage space of the storage pool.

3. The method of claim 1, wherein updating the sequence of the plurality of requests in the FIFO queue comprises:

updating periodically the sequence of the plurality of requests at a predetermined time interval.

4. The method of claim 1, wherein updating the sequence of the plurality of requests in the FIFO queue comprises:

determining, from the plurality of storage pools, a storage pool with an available storage space less than a threshold; and

adjusting a position of at least one request sent by the storage pool in the FIFO queue.

5. The method of claim 4, wherein adjusting the position of the at least one request in the FIFO queue comprises:

determining a number of requests to be adjusted in the at least one request sent by the storage pool; and

arranging the number of requests in the at least one request at a head of the FIFO queue.

6. An electronic device, comprising:

at least one processor; and

at least one memory storing computer program instructions, the at least one memory and the computer program instructions being configured, together with the at least one processor, to cause the electronic device to;

generate, based on a time sequence that a plurality of requests are detected, a first-input first-output (FIFO) queue comprising the plurality of requests sent by a plurality of storage pools in a storage system for reclaiming storage spaces of the plurality of storage pools;

determine respective available storage spaces of the plurality of storage pools; and

update, based on the available storage spaces, a sequence of the plurality of requests in the FIFO queue for processing.

7. The electronic device of claim 6, wherein the at least one memory and the computer program instructions are configured, together with the at least one processor, to cause the electronic device to:

determine, based on a state that a storage space of a storage pool of the plurality of storage pools is allocated or reclaimed, an available storage space of the storage pool.

8. The electronic device of claim 6, wherein the at least one memory and the computer program instructions are configured, together with the at least one processor, to cause the electronic device to:

update periodically the sequence of the plurality of requests at a predetermined time interval.

9. The electronic device of claim 6, wherein the at least one memory and the computer program instructions are configured, together with the at least one processor, to cause the electronic device to:

determine, from the plurality of storage pools, a storage pool with an available storage space less than a threshold; and

adjust a position of at least one request sent by the storage pool in the FIFO queue.

10. The electronic device of claim 9, wherein the at least one memory and the computer program instructions are configured, together with the at least one processor, to cause the electronic device to:

determine a number of requests to be adjusted in the at least one request sent by the storage pool; and

arrange the number of requests in the at least one request at a head of the FIFO queue.

11. A computer program product being tangibly stored on a non-volatile computer-readable medium and comprising machine-executable instructions, which, when executed, cause a machine to perform:

generating, based on a time sequence that a plurality of requests are detected, a first-input first-output (FIFO) queue comprising the plurality of requests sent by a plurality of storage pools in a storage system for reclaiming storage spaces of the plurality of storage pools;

determining respective available storage spaces of the plurality of storage pools; and

updating, based on the available storage spaces, a sequence of the plurality of requests in the FIFO queue for processing.

12. The computer program product of claim 11, wherein the machine-executable instructions, when executed, causes the machine to further execute:

determining, based on a state that a storage space of a storage pool of the plurality of storage pools is allocated or reclaimed, an available storage space of the storage pool.

13. The computer program product of claim 11, wherein the machine-executable instructions, when executed, causes the machine to further execute:

updating periodically the sequence of the plurality of requests at a predetermined time interval.

14. The computer program product of claim 11, wherein the machine-executable instructions, when executed, causes the machine to further execute:

determining, from the plurality of storage pools, a storage pool with an available storage space less than a threshold; and

adjusting a position of at least one request sent by the storage pool in the FIFO queue.

15. The computer program product of claim 14, wherein the machine-executable instructions, when executed, causes the machine to further execute:

determining a number of requests to be adjusted in the at least one request sent by the storage pool; and

arranging the number of requests in the at least one request at a head of the FIFO queue.