IP Library Granted Patent US 11,687,271
Granted Patent B1
US 11,687,271 · App. 17/928,150 · Granted Jun 27, 2023

Method for diluting cache space, and device and medium

Inventors: Zengqiang Ding (Jiangsu, CN); Bo Yuan (Jiangsu, CN)
Assignee: INSPUR SUZHOU INTELLIGENT TECHNOLOGY CO., LTD.
G06F3/0652G06F3/0604G06F3/0659G06F3/0673
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,687,271
App. No.
17/928,150
Granted
Jun 27, 2023
Kind
B1
Abstract

A method includes: performing, at a preset initial speed, data deletion on a queue with the maximum length in the cache space (S1); in response to the length of the queue with the maximum length and subjected to the data deletion being equal to the lengths of multiple queues in the cache space, triggering data deletion on the plurality of queues (S2); calculating an allocation speed (S3); performing, at the allocation speed, data deletion on each queue, the data deletion of which is triggered (S4); in response to the lengths of all queues subjected to the data deletion being equal to the lengths of multiple other queues in the cache space, triggering the data deletion on the plurality of other queues, and returning to calculating the allocation speed (S5); and in response to triggering the stopping of diluting the cache space, pausing a data deletion process (S6).

Claims (65)

1. A method for diluting a cache space, comprising:

performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed in response to a trigger to dilute the cache space;

triggering the data deletion on a second queue in response to a length of the first queue with the maximum length for the data deletion being equal to a length of the second queue in the cache space;

calculating an apportioning speed by using a quantity of all the first and second queues that are triggered the data deletion and the preset initial speed;

performing the data deletion on each of the first and second queues that are triggered the data deletion at the apportioning speed;

triggering an operation of performing the data deletion on a third queue;

calculating the apportioning speed in response to each length of all the first and second queues for the data deletion being equal to a length of the third queue in the cache space; and

pausing a process of the data deletion of all the first, second, and third queues that are triggered the data deletion in response to a trigger to stop diluting the cache space.

2. The method according to claim 1 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed in response to a trigger to dilute the cache space further comprises:

determining a plurality of queues waiting for the data deletion in the cache space according to a buffer data expiration strategy; and

performing the data deletion on the first queue with the maximum length among the plurality of queues.

3. The method according to claim 1 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed in response to a trigger to dilute the cache space further comprises:

detecting whether the volume of data buffered in the cache space reaches a threshold value or determining whether an instruction sent by a user to dilute the cache space is received; and

triggering to dilute the cache space in response to the volume of data buffered in the cache space reaching the threshold value or receiving the instruction sent by the user to dilute the cache space.

4. The method according to claim 1 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed or the performing the data deletion on each of the first and second queues that are triggered the data deletion at the apportioning speed further comprises:

randomly marking data in the first and second queues that are triggered the data deletion; and merging and deleting the randomly marked data.

5. The method according to claim 1 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed or the performing the data deletion on each of the first and second queues that are triggered the data deletion at the apportioning speed further comprises:

determining a deletion priority of data in the first and second queues that are triggered the data deletion, and marking the data according to the deletion priority; and

merging and deleting the marked data.

6. A computer device, comprising:

at least one processor; and

a memory storing a computer program executable on the processor, wherein the processor performs the following operations when executing the program:

performing a data deletion on a first queue with a maximum length in a cache space at a preset initial speed in response to a trigger to dilute the cache space;

triggering the data deletion on a second queue in response to a length of the first queue with the maximum length for the data deletion being equal to a length of the second queue in the cache space;

calculating an apportioning speed by using a quantity of all the first and second queues that are triggered the data deletion and the preset initial speed;

performing the data deletion on each of the first and second queues that are triggered the data deletion at the apportioning speed;

triggering an operation of performing the data deletion on a third queue;

calculating the apportioning speed in response to each length of all the first and second queues for the data deletion being equal to a length of the third queue in the cache space; and

pausing a process of the data deletion of all the first, second, and third queues that are triggered the data deletion in response to a trigger to stop diluting the cache space.

7. The device according to claim 6 , wherein the performing a data deletion on a first queue with a maximum length in a cache space at a preset initial speed in response to a trigger to dilute the cache space further comprises:

determining a plurality of queues waiting for the data deletion in the cache space according to a buffer data expiration strategy; and

performing the data deletion on the first queue with the maximum length among the plurality of queues.

8. The device according to claim 6 , wherein the performing a data deletion on a first queue with a maximum length in a cache space at a preset initial speed in response to a trigger to dilute the cache space further comprises:

detecting whether the volume of data buffered in the cache space reaches a threshold value or determining whether an instruction sent by a user to dilute the cache space is received; and

triggering to dilute the cache space in response to the volume of data buffered in the cache space reaching the threshold value or receiving the instruction sent by the user to dilute the cache space.

9. The device according to claim 6 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed or the performing the data deletion on each of the first and second queues that are triggered the data deletion at the apportioning speed further comprises:

randomly marking data in the first and second queues that are triggered the data deletion; and merging and deleting the randomly marked data.

10. A computer-readable storage medium, storing a computer program, wherein the computer program, when executed by a processor, performs the operations comprising:

performing a data deletion on a first queue with a maximum length in a cache space at a preset initial speed in response to a trigger to dilute the cache space;

triggering the data deletion on a second queue in response to a length of the first queue with the maximum length for the data deletion being equal to a length of the second queue in the cache space;

calculating an apportioning speed by using a quantity of all the first and second queues that are triggered the data deletion and the preset initial speed;

performing the data deletion on each of the first and second queues that are triggered the data deletion at the apportioning speed;

triggering an operation of performing the data deletion on a third queue;

calculating the apportioning speed in response to each length of all the first and second queues for the data deletion being equal to a length of the third queue in the cache space; and

pausing a process of the data deletion of all the first, second, and third queues that are triggered the data deletion in response to a trigger to stop diluting the cache space.

11. The method according to claim 1 , wherein the apportioning speed is obtained through dividing the preset initial speed by the quantity of all queues that are triggered the data deletion.

12. The method according to claim 1 , wherein the pausing the process of data deletion of all queues that are triggered the data deletion in response to a trigger to stop diluting the cache space comprises:

under the condition that volume of data buffered in the cache space is less than a safety threshold value after performing data deletion on the first queue, or, under the condition that the cache space receives an instruction to stop clearing the cache space sent by a user manually, triggering to stop diluting the cache space.

13. The method according to claim 4 , wherein a marking speed is the preset initial speed or the apportioning speed.

14. The device according to claim 6 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed or the performing the data deletion on each queue that is triggered the data deletion at the apportioning speed further comprises:

determining a deletion priority of data in all queues that are triggered the data deletion, and marking the data according to the deletion priority; and

merging and deleting the marked data.

15. The device according to claim 6 , wherein the apportioning speed is obtained through dividing the preset initial speed by the quantity of all queues that are triggered the data deletion.

16. The device according to claim 9 , wherein a marking speed is the preset initial speed or the apportioning speed.

17. The computer-readable storage medium according to claim 10 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed in response to a trigger to dilute the cache space further comprises:

determining a plurality of queues waiting for the data deletion in the cache space according to a buffer data expiration strategy; and

performing the data deletion on the first queue with the maximum length among the plurality of queues.

18. The computer-readable storage medium according to claim 10 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed in response to a trigger to dilute the cache space further comprises:

detecting whether the volume of data buffered in the cache space reaches a threshold value or determining whether an instruction sent by a user to dilute the cache space is received; and

triggering to dilute the cache space in response to the volume of data buffered in the cache space reaching the threshold value or receiving the instruction sent by the user to dilute the cache space.

19. The computer-readable storage medium according to claim 10 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed or the performing the data deletion on each queue that is triggered the data deletion at the apportioning speed further comprises:

randomly marking data in the first and second queues that are triggered the data deletion; and merging and deleting the randomly marked data.

20. The computer-readable storage medium according to claim 10 , wherein the performing a data deletion on a first queue with a maximum length in the cache space at a preset initial speed or the performing the data deletion on each queue that is triggered the data deletion at the apportioning speed further comprises:

determining a deletion priority of data in the first and second queues that are triggered the data deletion, and marking the data according to the deletion priority; and

merging and deleting the marked data.

Assignments (2)
LICENSE Recorded Jun 30, 2026
From: IEIT SYSTEMS CO., LTD
To: AIVRES SYSTEMS INC.
Reel/Frame 075857/0939 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 28, 2022
From: DING, ZENGQIANG; YUAN, BO
To: INSPUR SUZHOU INTELLIGENT TECHNOLOGY CO., LTD.
Reel/Frame 061893/0418 →
Priority Claims (1)
CN 20201050505017.8 · Jun 5, 2020 · national