Random write method and apparatus

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.

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.