Decoding method, electronic device, and storage medium
By dividing the decoding request queue into multiple priority queues and processing them in order of priority, the problem of excessively long decoding time of storage devices is solved, and QoS performance is improved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- HUIYI MICROELECTRONICS (SHANGHAI) CO LTD
- Filing Date
- 2024-12-04
- Publication Date
- 2026-06-05
AI Technical Summary
The decoding request processing process of storage devices takes too long, which affects QoS performance.
The decoding request queue is divided into multiple queues with different priorities. Decoding is performed in order of priority from high to low, with priority given to requests in the high-priority queue. If necessary, requests in the low-priority queue are transferred to the high-priority queue for priority decoding.
By rationally arranging the decoding order, the waiting latency of decoding requests can be reduced, thereby improving the QoS performance of storage devices.
Smart Images
Figure CN122157718A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the technical field of data decoding, particularly decoding methods, electronic devices, and storage media. Background Technology
[0002] When a storage device executes a decoding request, it first puts the decoding request into the decoder's input queue, and waits for the decoder module to retrieve it before decoding.
[0003] Decoding requests in the input queue of a decoder are generally processed according to the first-in, first-out (FIFO) principle.
[0004] However, this approach may cause some read recovery processes to take a long time, which can significantly impact QoS (Quality of Service) performance. Summary of the Invention
[0005] This application provides a decoding method, electronic device, and storage medium to address the problem that the read recovery process of storage devices may be time-consuming, affecting QoS performance.
[0006] To address the aforementioned technical problems, this application provides a decoding method, comprising: acquiring multiple decoding request queues with different priorities; wherein at least one decoding request queue contains at least one decoding request; and acquiring the decoding requests in each decoding request queue in descending order of priority for decoding.
[0007] The decoding process involves retrieving decoding requests from each decoding request queue in descending order of priority, including: first, retrieving each decoding request sequentially from the highest priority decoding request queue and performing decoding; after decoding is completed, retrieving each decoding request sequentially from the next lower priority decoding request queue and performing decoding, and so on, until each decoding request is retrieved sequentially from the lowest priority decoding request queue and the decoding is completed; the number of decoding request queues may include multiple queues.
[0008] The process involves retrieving decoding requests from each decoding request queue in descending order of priority for decoding. This includes: selecting the highest-priority decoding request queue from at least one currently existing decoding request queue as the current highest-priority decoding request queue; retrieving a decoding request from the current highest-priority decoding request queue for decoding; and repeating the process of selecting the highest-priority decoding request queue from at least one currently existing decoding request queue as the current highest-priority decoding request queue until all decoding requests in all decoding request queues have been processed. The number of decoding request queues may include multiple queues.
[0009] The decoding method further includes: in response to a new decoding request in a decoding request queue with a higher priority than the current highest priority decoding request queue, the higher priority decoding request queue is designated as the new current highest priority decoding request queue, and the decoding requests in the new current highest priority decoding request queue are executed first, until the decoding requests are completed.
[0010] The process involves retrieving decoding requests from each decoding request queue in descending order of priority for decoding. This includes: selecting the highest-priority decoding request queue from at least one currently existing decoding request queue as the current highest-priority decoding request queue; sequentially retrieving a first preset number of decoding requests from the current highest-priority decoding request queue and decoding them; in response to the completion of decoding of the first preset number of decoding requests in the current highest-priority decoding request queue, retrieving a second preset number of decoding requests from the next lower-priority decoding request queue and decoding them; returning to the current highest-priority decoding request queue and repeating the process of sequentially retrieving the first preset number of decoding requests from the current highest-priority decoding request queue and decoding them, until all decoding requests in the current highest-priority decoding request queue have been processed; and then repeating the process of selecting the highest-priority decoding request queue from at least one currently existing decoding request queue as the current highest-priority decoding request queue, until all decoding requests in all decoding request queues have been processed. The number of decoding request queues may include multiple queues.
[0011] Specifically, if the waiting time for a target decoding request in a non-current highest priority decoding request queue exceeds a preset time, the target decoding request will be transferred to the current highest priority decoding request queue for priority decoding.
[0012] The process involves obtaining multiple decoding request queues with different priorities; wherein at least one decoding request queue contains at least one decoding request, including: creating multiple decoding request queues with different priorities; obtaining decoding requests and determining the priority of the decoding requests; and dividing each decoding request into a decoding request queue of the corresponding priority based on the corresponding priority.
[0013] Determining the priority of decoding requests includes: determining the priority of decoding requests based on the type, timing, and / or the number of times the corresponding worker process has requested them.
[0014] To address the aforementioned technical problems, the present invention also provides an electronic device, including a memory and a processor coupled to each other, wherein the processor is used to execute program instructions stored in the memory to implement the decoding method as described above.
[0015] To address the aforementioned technical problems, the present invention also provides a computer-readable storage medium storing program instructions thereon, which, when executed by a processor, implement the decoding method as described above.
[0016] To address the aforementioned technical issues, the decoding method of this application acquires multiple decoding request queues with different priorities and retrieves decoding requests from each queue in descending order of priority for decoding. By setting up multiple decoding request queues with different priorities and placing decoding requests into queues of different priorities, higher-priority decoding requests are prioritized for decoding processing, reducing the latency of these decoding requests waiting for decoding, and rationally arranging the decoding order of the decoders, thereby improving the QoS performance of the storage device. Attached Figure Description
[0017] Figure 1 This is a flowchart illustrating an embodiment of the decoding method of this application;
[0018] Figure 2 This is a flowchart illustrating another embodiment of the decoding method of this application;
[0019] Figure 3 This is a schematic diagram of one implementation of multiple decoding request queues for a decoder;
[0020] Figure 4 This is a schematic diagram of the framework of an embodiment of the electronic device of this application;
[0021] Figure 5 This is a schematic diagram of a framework of an embodiment of the computer-readable storage medium of this application. Detailed Implementation
[0022] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.
[0023] It should be noted that if the embodiments of this application involve directional indicators (such as up, down, left, right, front, back, etc.), the directional indicators are only used to explain the relative positional relationship and movement of the components in a certain specific posture (as shown in the figure). If the specific posture changes, the directional indicators will also change accordingly.
[0024] Furthermore, if the embodiments of this application involve descriptions such as "first" or "second," these descriptions are for descriptive purposes only and should not be construed as indicating or implying their relative importance or implicitly specifying the number of technical features indicated. Therefore, features defined with "first" or "second" may explicitly or implicitly include at least one of those features. Additionally, the technical solutions of various embodiments can be combined with each other, but this must be based on the ability of those skilled in the art to implement them. If the combination of technical solutions is contradictory or impossible to implement, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection claimed in this application.
[0025] Please see Figure 1 , Figure 1 This is a flowchart illustrating an embodiment of the decoding method of this application.
[0026] Step S11: Obtain multiple decoding request queues with different priorities; wherein at least one decoding request queue contains at least one decoding request.
[0027] This application divides the decoding request queue of the decoder in the storage device into multiple queues, i.e., at least two, and each queue has a different priority, thereby facilitating the sequential ordering of decoding requests in each queue. The specific number of decoding request queues can be set based on actual needs, such as 3, 4, 5, 6, or 10, and is not limited here.
[0028] In a specific application scenario, the number of decoding request queues can be set to three: a first decoding request queue, a second decoding request queue, and a third decoding request queue. The first decoding request queue has a higher priority than the second, and the second has a higher priority than the third. In other application scenarios, the number of decoding request queues can be set to other numbers, and so on, without limitation.
[0029] At least one decoding request queue contains at least one decoding request. Decoding request queues of different priorities store decoding requests of corresponding priorities, and the number of decoding requests in each queue is set based on actual needs. The specific decoding requests are determined based on the actual processing tasks of the storage device.
[0030] Storage devices include, but are not limited to, solid-state memory, non-volatile memory (NAND FLASH), or semiconductor memory.
[0031] In a specific application scenario, there may be one or more decoders in the storage device. In this embodiment, multiple decoding request queues with different priorities are created for each decoder to adjust the decoding request processing order.
[0032] By setting up multiple decoding request queues with different priorities and placing decoding requests into queues of different priorities, it is easier to distinguish the priority of different decoding requests, so as to reasonably arrange the decoding order of the decoder and reduce the unreasonable time consumption of the read recovery process.
[0033] Step S12: Obtain the decoding requests from each decoding request queue in descending order of priority, and perform decoding.
[0034] The decoder first retrieves decoding requests from the highest priority decoding request queue for decoding processing, then retrieves decoding requests from the next lower priority decoding request queue one by one for decoding processing, and finally processes the decoding requests from the lowest priority decoding request queue, thus performing reasonable decoding in order of priority from high to low.
[0035] Based on the above steps, this embodiment obtains multiple decoding request queues with different priorities and retrieves decoding requests from each queue in descending order of priority for decoding. By setting up multiple decoding request queues with different priorities and placing decoding requests into queues of different priorities, higher-priority decoding requests are prioritized for decoding processing, reducing the latency of these decoding requests waiting for decoding, and rationally arranging the decoding order of the decoders, thereby improving the QoS performance of the storage device.
[0036] Please see Figure 2 , Figure 2 This is a flowchart illustrating another embodiment of the decoding method of this application.
[0037] Step S21: Create multiple decoding request queues with different priorities.
[0038] In this embodiment, multiple decoding request queues with different priorities are created for each decoder in the storage device.
[0039] Please see Figure 3 , Figure 3 This is a schematic diagram of one implementation of a decoder with multiple decoding request queues.
[0040] The decoder 30 can have multiple decoder request queues, such as the first decoder request queue 1, the second decoder request queue 2, ..., the Nth decoder request queue N. The number of N can be set based on actual needs and is not limited here.
[0041] The multiple decoding request queues are independent of each other and have different priorities.
[0042] In a specific application scenario, the priorities of the first decoder request queue 1, the second decoder request queue 2, ..., the Nth decoder request queue N can be arranged in descending order. Alternatively, in another specific application scenario, the priorities of the first decoder request queue 1, the second decoder request queue 2, ..., the Nth decoder request queue N can also be arranged in ascending order. No specific restrictions are imposed here.
[0043] Step S22: Obtain the decoding request and determine the priority of the decoding request.
[0044] Decoding requests can originate from different worker processes within the storage device, resulting in various request types. These include raw read requests from the host, host read requests representing the xth retry read during the reading process, read requests entering the soft read phase or the RAID (Redundant Array of Independent Disks) recovery phase, and internal system read requests such as garbage collection reads and mapping reads. Decoding / read requests from different worker processes have different request types, and the worker processes and request types corresponding to decoding requests can be diverse and not limited to a single type.
[0045] In a specific application scenario, decoding requests can be obtained through the controller of the storage device, and the priority of the decoding requests can be determined.
[0046] In a specific application scenario, the priority of a decoding request can be determined based on its type, timing, and / or the number of times it has been requested by its associated worker process. Here, "type" refers to the type of worker process to which the decoding request belongs, and "timing" refers to the time the decoding request was acquired. For a decoding request, the earlier it arrives in the storage system, the higher its priority. For read requests initiated by the host, the number of times the associated worker process has requested the request (including retry reads and soft reads) can indicate the current priority of the read request. That is, the more NAND reads a read request has performed, the greater its read latency, and from a QoS perspective, its higher priority, requiring it to be processed as soon as possible.
[0047] In some embodiments, priority rules can be defined based on the type, timing, and / or the number of times the decoding request has been requested by the corresponding worker process. For example, depending on the execution order of the read recovery process, for host read requests, the priority can be: 1. Decoding requests from worker processes that have performed retry reads have a lower priority than those from worker processes that have performed retry reads; 2. Decoding requests from soft reads have a higher priority than those from retry reads; 3. Decoding requests from soft reads have a lower priority than those from soft reads; 4. Decoding requests in the RAID process have a higher priority than read requests from the soft read stage.
[0048] In some embodiments, the priority of Host Mapping read can be greater than that of Host read request / decode request; and the priority of Host read request / decode request can be greater than that of garbage collection read request.
[0049] In some embodiments, the priority of decoding requests that have been requested more times by worker processes of the same type can be higher than that of decoding requests that have been requested less times by worker processes of the same type. This approach can prioritize decoding requests with high latency, thereby reducing the latency of waiting for decoding, reducing read latency, and improving QoS performance.
[0050] The specific rules for determining priorities are set based on the idea of reducing the overall latency of multiple working processes; however, the specific rules are not limited here. After receiving a decoding request, the storage device controller determines the priority of the decoding request based on the specific rules for determining priorities.
[0051] Step S23: Divide each decoding request into a decoding request queue of the corresponding priority based on the corresponding priority.
[0052] When N decoding request queues are created in the aforementioned steps, there are also N levels of priority determination rules, which are classified and categorized in a one-to-one correspondence.
[0053] Step S24: Obtain the decoding requests from each decoding request queue in descending order of priority, and perform decoding.
[0054] The decoder primarily retrieves decoding requests from the various decoding request queues in descending order of priority. It starts by retrieving requests from the highest priority queue, then moves on to the next lower priority queue, and so on, until it retrieves a request from the lowest priority queue. However, the specific order in which these requests are retrieved can vary slightly.
[0055] In a specific application scenario, decoding requests are first retrieved from the highest priority decoding request queue and decoded sequentially. After decoding is completed, decoding requests are then retrieved from the next lower priority decoding request queue and decoded sequentially, and so on, until decoding requests are retrieved from the lowest priority decoding request queue and decoded sequentially. The number of decoding request queues may include multiple queues.
[0056] In a specific application scenario, before each decoding request is retrieved, the highest-priority decoding request queue is selected from at least one existing decoding request queue, becoming the current highest-priority decoding request queue. Decoding requests are then retrieved sequentially from this highest-priority queue and decoded. After decoding, the process of selecting the highest-priority decoding request queue from at least one existing queue is repeated until all decoding requests in all queues have been processed. This ensures that each processed decoding request has the highest priority, thus prioritizing the processing of high-priority requests, improving the efficiency of high-priority decoding requests, and rationally arranging the decoding order of the decoders, thereby improving the overall efficiency of the storage device in executing multiple processes simultaneously. The number of decoding request queues can be multiple.
[0057] During the decoding process, when a new decoding request arrives in a higher-priority decoding request queue than the current highest-priority queue, that higher-priority queue becomes the new highest-priority queue. Decoding requests in this new highest-priority queue are then executed first, until the decoding is complete. In other words, if a higher-priority decoding request arrives while the current highest-priority queue is being processed, that higher-priority request is processed first, ensuring that each decoding request has the highest priority and guaranteeing the principle of priority.
[0058] In a specific application scenario, from at least one decoding request queue with existing decoding requests, the highest-priority decoding request queue is selected as the current highest-priority decoding request queue. A first preset number of decoding requests are sequentially retrieved from this highest-priority queue and decoded. In response to the completion of the first preset number of decoding requests in the highest-priority queue, a second preset number of decoding requests are retrieved from the next lower-priority decoding request queue and decoded. The process then returns to the highest-priority queue, repeating the process of sequentially retrieving and decoding the first preset number of decoding requests from it. This continues until all decoding requests in the highest-priority queue have been processed. The process then repeats again, selecting the highest-priority decoding request queue from at least one decoding request queue with existing decoding requests as the current highest-priority decoding request queue, until all decoding requests in all decoding request queues have been processed.
[0059] That is, after processing the first preset number of decoding requests in the current highest priority decoding request queue, the system retrieves the second preset number of decoding requests from the next lower priority decoding request queue and completes the decoding. This is to prevent the current highest priority decoding request queue from having too many decoding requests, which could cause the decoding requests in other decoding request queues to be delayed due to timeouts. This further improves the rationality of decoding request processing. This process is repeated in a loop.
[0060] The specific value of the first preset quantity is set based on the actual situation, including but not limited to 8, 10, 15, or 20, etc., without limitation. The specific value of the second preset quantity is set based on the actual situation, including but not limited to 1, 2, etc., but the first preset quantity must be greater than the second preset quantity to ensure the priority of higher priority. For example: Eight decoding requests can be sequentially retrieved from the highest priority decoding request queue and decoded. Once these eight requests are completed, one decoding request is retrieved from the next lower priority decoding request queue and decoded. This process is repeated until all decoding requests in the highest priority queue are processed. Then, the next lower priority decoding request queue becomes the new highest priority decoding request queue, and the process continues in the same loop.
[0061] Specifically, if the current number of decoding requests in the highest priority decoding request queue is less than a first preset number, the current number of decoding requests is retrieved and decoded sequentially. Then, the next highest priority decoding request queue is designated as the new highest priority decoding request queue, and the process of retrieving the first preset number of decoding requests from the highest priority queue and decoding them is repeated. In other words, if the current number of decoding requests in the highest priority decoding request queue is less than the first preset number, the current number of decoding requests is processed first, then the next highest priority decoding request queue is designated as the new highest priority decoding request queue, and the process continues in a cyclical manner.
[0062] In any of the above application scenarios, the decoding process may involve a secondary queue partitioning step: If the waiting time for a target decoding request in a non-current highest priority decoding request queue exceeds a preset time, the target decoding request is transferred to the current highest priority decoding request queue for priority decoding. The corresponding preset time can be set based on the priority level, specifically 10 microseconds, 20 microseconds, 30 microseconds, or 50 microseconds, etc., depending on the actual situation and is not limited.
[0063] The aforementioned secondary queue partitioning can reduce the situation where too many decoding requests in the high-priority decoding request queue increase the latency of decoding requests in the low-priority decoding request queue. By repartitioning, the rationality of decoding request execution can be further improved, extreme unreasonable decoding latency can be reduced, and QoS performance can be improved.
[0064] When a decoder sequentially retrieves multiple decoding requests from a decoding request queue, the retrieval order of these requests can be based on the first-in, first-out (FIFO) principle.
[0065] Through the above steps, this embodiment creates multiple decoding request queues with different priorities, determines the priority of each decoding request, and divides each decoding request into a corresponding priority decoding request queue based on the corresponding priority. Finally, it retrieves the decoding requests from each decoding request queue in descending order of priority for decoding. This allows for priority processing of special types or high-latency decoding requests based on priority settings, thereby rationally arranging the decoding order of the decoder, improving the overall efficiency of the storage device in executing multiple processes simultaneously, and ultimately improving the QoS performance of the storage device.
[0066] Please see Figure 4 , Figure 4This is a schematic diagram of a framework of an embodiment of the electronic device of this application. The electronic device 40 includes a memory 41 and a processor 42 coupled to each other. The processor 42 is used to execute program instructions stored in the memory 41 to implement the steps of the above-described method embodiment. In a specific implementation scenario, the electronic device 40 may include, but is not limited to, a microcomputer, a server, etc. In addition, the electronic device 40 may also include a laptop computer, a tablet computer, a Nand Flash, etc., without limitation.
[0067] Specifically, processor 42 controls itself and memory 41 to implement the steps of any of the above method embodiments. Processor 42 may also be referred to as a CPU (Central Processing Unit). Processor 42 may be an integrated circuit chip with signal processing capabilities. Processor 42 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. A general-purpose processor may be a microprocessor or any conventional processor. Furthermore, processor 42 may be implemented using integrated circuit chips.
[0068] The above scheme can reasonably arrange the decoding order of the decoder and improve the QoS performance of the storage device.
[0069] Please see Figure 5 , Figure 5 This is a schematic diagram of a framework of an embodiment of the computer-readable storage medium of this application. The computer-readable storage medium 50 stores program instructions 501 that can be executed by a processor. The program instructions 501 are used to implement the steps of any of the above method embodiments.
[0070] In the several embodiments provided in this application, it should be understood that the disclosed methods and apparatus can be implemented in other ways. For example, the apparatus implementations described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection of devices or units may be electrical, mechanical, or other forms.
[0071] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.
[0072] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.
[0073] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute all or part of the steps of the methods of various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0074] The above are merely embodiments of this application and do not limit the scope of this patent application. Any equivalent structural or procedural changes made using the content of this application's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the scope of patent protection of this application.
Claims
1. A decoding method, characterized in that, The decoding method includes: Multiple decoding request queues with different priorities are obtained; wherein at least one of the decoding request queues contains at least one decoding request; Decoding requests are retrieved from each decoding request queue in descending order of priority for decoding.
2. The decoding method according to claim 1, characterized in that, The step of retrieving decoding requests from each of the decoding request queues in descending order of priority for decoding includes: First, decode requests are sequentially retrieved from the highest priority decode request queue and decoded. After decoding, decode requests are sequentially retrieved from the next lower priority decode request queue and decoded, and so on, until decode requests are sequentially retrieved from the lowest priority decode request queue and decoded. The number of decode request queues may include multiple queues.
3. The decoding method according to claim 1, characterized in that, The step of retrieving decoding requests from each of the decoding request queues in descending order of priority for decoding includes: From at least one decoding request queue with a current decoding request, select the decoding request queue with the highest priority as the current highest priority decoding request queue; Retrieve a decoding request from the current highest priority decoding request queue and perform decoding; After the decoding is completed, the process of selecting the highest priority decoding request queue from at least one decoding request queue with a current decoding request is repeated until the decoding requests in all decoding request queues have been processed. The number of decoding request queues includes multiple queues.
4. The decoding method according to claim 3, characterized in that, The decoding method also includes: In response to the addition of a decoding request to a decoding request queue with a higher priority than the current highest priority decoding request queue, the higher priority decoding request queue is designated as the new current highest priority decoding request queue, and the decoding requests in the new current highest priority decoding request queue are executed first until the decoding request is completed.
5. The decoding method according to claim 1, characterized in that, The step of retrieving decoding requests from each of the decoding request queues in descending order of priority for decoding includes: From at least one decoding request queue with a current decoding request, select the decoding request queue with the highest priority as the current highest priority decoding request queue; Retrieve the first preset number of decoding requests sequentially from the current highest priority decoding request queue, and perform decoding; In response to the completion of decoding of a first preset number of decoding requests in the current highest priority decoding request queue, a second preset number of decoding requests are retrieved from the next lower priority decoding request queue and decoded. Returning to the current highest priority decoding request queue, the process repeats again, sequentially retrieving a first preset number of decoding requests from the current highest priority decoding request queue and performing decoding, until all decoding requests in the current highest priority decoding request queue have been processed. Then, the process repeats again, retrieving the highest priority decoding request queue from at least one decoding request queue with existing decoding requests as the current highest priority decoding request queue, until all decoding requests in all decoding request queues have been processed; wherein, the number of decoding request queues may include multiple queues.
6. The decoding method according to any one of claims 2-5, characterized in that, The decoding method further includes: If the waiting time for a target decoding request in a non-current highest priority decoding request queue exceeds a preset time, the target decoding request is transferred to the current highest priority decoding request queue for priority decoding.
7. The decoding method according to claim 1, characterized in that, The process involves acquiring multiple decoding request queues with different priorities; wherein at least one of the decoding request queues contains at least one decoding request, including: Create multiple decoding request queues with different priorities; Obtain the decoding request and determine its priority; Each decoding request is assigned to a decoding request queue based on its priority.
8. The decoding method according to claim 7, characterized in that, Determining the priority of the decoding request includes: The priority of a decoding request is determined based on its type, timing, and / or the number of times it has been requested by the corresponding worker process.
9. An electronic device, characterized in that, It includes a memory and a processor coupled to each other, the processor being used to execute program instructions stored in the memory to implement the decoding method as described in any one of claims 1 to 8.
10. A computer-readable storage medium having program instructions stored thereon, characterized in that, When the program instructions are executed by the processor, they implement the decoding method as described in any one of claims 1 to 8.