Random write method and apparatus
View Patent ↗A random write method includes: using a wear-leveling module to scan the number of free blocks and the number of bad blocks in a target super logic unit; using a lookup management module to iteratively update, according to the number of current remaining solid-state disk data frames, the number of historically weighted solid-state disk data frames in a long short-term memory network manner; using dynamic write arbitration to determine an adjustment stage based on the number of historically weighted solid-state disk data frames, and determining the expected number of read and write operations per second based on the adjustment stage; and re-updating the number of historically weighted solid-state disk data frames, and adjusting the actual number of read and write operations per second based on the re-updated number of historically weighted solid-state disk data frames and the expected number of read and write operations per second.
1. A random write method, comprising:
determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk;
scanning a quantity of free blocks and a quantity of bad blocks in the target super logic unit so as to determine a quantity of current remaining solid-state disk data frames;
iteratively updating a quantity of historically weighted solid-state disk data frames in a long short-term memory network manner according to the quantity of the current remaining solid-state disk data frames;
by dynamic write arbitration, determining an adjustment stage on the basis of the quantity of the historically weighted solid-state disk data frames, and determining an expected number of times of read and write operations per second on the basis of the adjustment stage;
re-updating the quantity of the historically weighted solid-state disk data frames, and adjusting an actual number of times of read and write operations per second on the basis of re-updated quantity of the historically weighted solid-state disk data frames and the expected number of times of read and write operations per second;
wherein the dynamic write arbitration comprises three stages, each stage comprises a corresponding relationship between the quantity of the free blocks, the quantity of the historically weighted solid-state disk data frames, and the number of times of read and write operations per second.
2. The method according to claim 1 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk comprises:
determining whether a quantity of the super logic units with a minimum quantity of the free blocks in the solid-state disk exceeds a predetermined threshold value; and
selecting the super logic unit with the minimum quantity of the free blocks as the target super logic unit in response to exceeding the predetermined threshold value.
3. The method according to claim 2 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
in response to not exceeding the predetermined threshold value, scanning whether there is at least one super logic unit in a free state in the solid-state disk; and
determining one of the super logic units as the target super logic unit in response to the presence of at least one super logic unit in the free state.
4. The method according to claim 1 , wherein iteratively updating a quantity of historically weighted solid-state disk data frames in a long short-term memory network manner according to the quantity of the current remaining solid-state disk data frames comprises:
weighting a quantity of old weighted solid-state disk data frames according to a predetermined historical average weighted parameter; and
executing a normalized weighted average on the weighted quantity of the old weighted solid-state disk data frames and the quantity of standard weighted current remaining solid-state disk data frames to obtain an updated quantity of the historically weighted solid-state disk data frames.
5. A random write apparatus, comprising:
a processor; and
a memory storing a program code executable by the processor, wherein the program code, when executed, executes operations as follows:
determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk;
scanning, a quantity of free blocks and a quantity of bad blocks in the target super logic unit so as to determine a quantity of current remaining solid-state disk data frames;
iteratively updating a quantity of historically weighted solid-state disk data frames in a long short-term memory network manner according to the quantity of the current remaining solid-state disk data frames;
by dynamic write arbitration, determining an adjustment stage on the basis of the quantity of the historically weighted solid-state disk data frames, and determining an expected number of times of read and write operations per second on the basis of the adjustment stage;
re-updating the quantity of the historically weighted solid-state disk data frames, and adjusting an actual number of times of read and write operations per second on the basis of the quantity of the historically weighted solid-state disk data frames and the expected number of times of read and write operations per second;
wherein the dynamic write arbitration comprises three stages, each stage comprises a corresponding relationship between a quantity of free blocks, the quantity of the historically weighted solid-state disk data frames, and the number of times of read and write operations per second.
6. The apparatus according to claim 5 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
determining whether a quantity of the super logic units with a minimum quantity of the free blocks in the solid-state disk exceeds a predetermined threshold value; and
selecting the super logic unit with the minimum quantity of the free blocks as the target super logic unit in response to exceeding the predetermined threshold value.
7. The apparatus according to claim 6 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
in response to not exceeding the predetermined threshold value, scanning whether there is at least one super logic unit in a free state in the solid-state disk; and
determining one of the super logic units as the target super logic unit in response to the presence of at least one super logic unit in the free state.
8. The apparatus according to claim 5 , wherein iteratively updating a quantity of historically weighted solid-state disk data frames in a long short-term memory network manner according to the quantity of the current remaining solid-state disk data frames comprises:
weighting a quantity of old weighted solid-state disk data frames according to a predetermined historical average weighted parameter; and
executing a normalized weighted average on the weighted quantity of the old weighted solid-state disk data frames and the quantity of standard weighted current remaining solid-state disk data frames to obtain an updated quantity of the historically weighted solid-state disk data frames.
9. A non-transitory computer-readable storage medium, storing a computer program that is executed executable by a processor, and upon execution by the processor, is configured to cause the processor to implement operations as follows:
determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk;
scanning a quantity of free blocks and a quantity of bad blocks in the target super logic unit so as to determine a quantity of current remaining solid-state disk data frames;
iteratively updating a quantity of historically weighted solid-state disk data frames in a long short-term memory network manner according to the quantity of the current remaining solid-state disk data frames;
by dynamic write arbitration, determining an adjustment stage on the basis of the quantity of the historically weighted solid-state disk data frames, and determining an expected number of times of read and write operations per second on the basis of the adjustment stage;
re-updating the quantity of the historically weighted solid-state disk data frames, and adjusting an actual number of times of read and write operations per second on the basis of the quantity of the historically weighted solid-state disk data frames and the expected number of times of read and write operations per second;
wherein the dynamic write arbitration comprises three stages, each stage comprises a corresponding relationship between a quantity of free blocks, the quantity of the historically weighted solid-state disk data frames, and the number of times of read and write operations per second.
10. The non-transitory computer-readable storage medium according to claim 9 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
determining whether a quantity of the super logic units with a minimum quantity of the free blocks in the solid-state disk exceeds a predetermined threshold value.
11. The non-transitory computer-readable storage medium according to claim 10 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
selecting the super logic unit with the minimum quantity of the free blocks as the target super logic unit in response to exceeding the predetermined threshold value.
12. The non-transitory computer-readable storage medium according to claim 10 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
in response to not exceeding the predetermined threshold value, scanning whether there is at least one super logic unit in a free state in the solid-state disk.
13. The non-transitory computer-readable storage medium according to claim 12 , wherein determining, in a manner of leveling a remaining space, a target super logic unit from among a plurality of super logic units in a solid-state disk further comprises:
determining one of the super logic units as the target super logic unit in response to the presence of at least one super logic unit in the free state.
14. The non-transitory computer-readable storage medium according to claim 12 , wherein iteratively updating a quantity of historically weighted solid-state disk data frames in a long short-term memory network manner according to the quantity of the current remaining solid-state disk data frames comprises:
weighting a quantity of old weighted solid-state disk data frames according to a predetermined historical average weighted parameter; and
executing a normalized weighted average on the weighted quantity of the old weighted solid-state disk data frames and the quantity of standard weighted current remaining solid-state disk data frames to obtain an updated quantity of the historically weighted solid-state disk data frames.