CN115776469A - Message scheduling method, device and storage medium - Google Patents
Message scheduling method, device and storage medium Download PDFInfo
- Publication number
- CN115776469A CN115776469A CN202211348884.0A CN202211348884A CN115776469A CN 115776469 A CN115776469 A CN 115776469A CN 202211348884 A CN202211348884 A CN 202211348884A CN 115776469 A CN115776469 A CN 115776469A
- Authority
- CN
- China
- Prior art keywords
- queue
- message
- target
- receiving
- message receiving
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention provides a message scheduling method, a message scheduling device and a storage medium, and belongs to the technical field of data processing. The method comprises the following steps: determining respective queue values of a plurality of message receiving queues according to the queue state information of the message receiving queues; when a target message is received, determining a target queue for receiving the target message according to respective queue values of the plurality of message receiving queues; and receiving the target message through the target queue. According to the technical scheme of the embodiment of the invention, the respective queue values of the plurality of message receiving queues are determined according to the queue state information, and the target queues for receiving the target messages are determined according to the respective queue values of the plurality of message receiving queues, so that the target messages can be received in time, and the effectiveness and the rationality of message scheduling are improved.
Description
Technical Field
The present invention relates to the field of data processing technologies, and in particular, to a method and an apparatus for scheduling packets, and a storage medium.
Background
Some electronic devices, when receiving data messages, may cause message congestion due to receiving a large number of messages in a short period of time. For example, processors of a switch or router may receive the same type of message at the same time, causing a large number of messages to enter the receiving queue corresponding to the type of message at the same time, resulting in congestion. Therefore, a scheduling method for ensuring that a processor receives a packet in time is needed.
Disclosure of Invention
The embodiment of the invention provides a message scheduling method, a message scheduling device and a storage medium, aiming at improving the effectiveness and the reasonability of message scheduling.
In a first aspect, an embodiment of the present invention provides a packet scheduling method, including:
determining respective queue values of a plurality of message receiving queues according to the queue state information of the message receiving queues;
when a target message is received, determining a target queue for receiving the target message according to respective queue values of the plurality of message receiving queues;
and receiving the target message through the target queue.
In a second aspect, an embodiment of the present invention further provides a message scheduling apparatus, where the message scheduling apparatus includes a processor, a memory, a computer program stored on the memory and executable by the processor, and a data bus for implementing connection communication between the processor and the memory, where the computer program, when executed by the processor, implements the steps of any of the message scheduling methods provided in the embodiments of the present invention.
In a third aspect, an embodiment of the present invention further provides a storage medium for a computer-readable storage, where the storage medium stores one or more programs, and the one or more programs are executable by one or more processors to implement the steps of any message scheduling method provided in the embodiment of the present invention.
The embodiment of the invention provides a message scheduling method, a device and a storage medium, and the method determines respective queue values of a plurality of message receiving queues according to queue state information of the message receiving queues; when a target message is received, determining a target queue for receiving the target message according to respective queue values of the plurality of message receiving queues; and receiving the target message through the target queue. According to the dynamic queue state information, the target queue for receiving the target message is determined, so that the flexibility and rationality of message scheduling are improved, the target message can be received in time, and the effectiveness of message scheduling is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic flowchart illustrating steps of a message scheduling method according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating sub-steps of a method for determining a target queue according to an embodiment of the present invention;
fig. 3 is a schematic flowchart illustrating steps of another message scheduling method according to an embodiment of the present invention;
fig. 4 is a schematic view of a scenario for implementing the message scheduling method according to the embodiment of the present invention;
fig. 5 is a block diagram schematically illustrating a structure of a packet scheduling apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The flow diagrams depicted in the figures are merely illustrative and do not necessarily include all of the elements and operations/steps, nor do they necessarily have to be performed in the order depicted. For example, some operations/steps may be decomposed, combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
It is to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the specification of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
The embodiment of the invention provides a message scheduling method, a message scheduling device and a storage medium. The message scheduling method can be applied to a mobile terminal, and the mobile terminal can be an electronic device such as a mobile phone, a tablet computer, a notebook computer, a desktop computer, a personal digital assistant and a wearable device.
Some embodiments of the invention are described in detail below with reference to the accompanying drawings. The embodiments described below and the features of the embodiments can be combined with each other without conflict.
Referring to fig. 1, fig. 1 is a schematic step flow diagram of a message scheduling method according to an embodiment of the present invention.
For example, in the existing packet scheduling method, a packet is matched to a packet receiving queue corresponding to a received packet according to the type of the received packet. Thus, when a large number of messages of the same type enter the corresponding message receiving queue, the message receiving queue is usually congested; alternatively, when congestion exists in the message receiving queue for receiving a certain type of message, the message of the type is delivered to the message receiving queue with the congestion.
The inventor of the application improves the message scheduling method to improve the flexibility and rationality of message scheduling, so that important target messages can be timely received.
As shown in fig. 1, the message scheduling method according to the embodiment of the present invention includes steps S101 to S103.
Step S101, according to the queue state information of the message receiving queues, determining respective queue values of the message receiving queues.
Illustratively, the message scheduling method provided by the embodiment of the present application evaluates the message receiving queues according to the current state information of each message receiving queue to obtain the queue score corresponding to each message receiving queue, and the queue score can visually reflect the smoothness of the message receiving queues, so as to determine the target queues for receiving the target messages according to the queue scores, thereby improving the flexibility and rationality of message scheduling.
In some embodiments, the determining the queue value of each of the plurality of message receiving queues according to the queue status information of the message receiving queue includes: determining the queue value of the message receiving queue according to one or more of the following queue state information of the message receiving queue: the current message quantity in the message receiving queue, the congestion condition of the messages in the message receiving queue and the dequeuing speed of the message receiving queue; the queue score is negatively related to the current message quantity in the message receiving queue, and/or the queue score is negatively related to the congestion condition of the messages in the message receiving queue, and/or the queue score is positively related to the dequeuing speed of the message receiving queue.
Illustratively, the current packet number represents the number of packets currently in the packet receiving queue.
For example, the congestion status of the message may be determined according to the message type in the message receiving queue, for example, a first type of message and a second type of message currently exist in the message receiving queue, the first type of message corresponds to a first weight, the second type of message corresponds to a second weight, and the congestion status of the message in the message receiving queue may be determined according to a product of the first weight and the number of the first type of message, and a product of the second weight and the number of the second type of message.
Illustratively, the dequeue speed represents the speed at which a message is received from the message receiving queue, for example, the speed at which a message enters a Central Processing Unit (CPU); the dequeue speed may be the dequeue speed per second of a message in the message receive queue.
Illustratively, since the queue score is used for reflecting the smoothness of the message receiving queue, a higher queue score indicates that the message receiving queue is smoother. Therefore, the queue score is inversely proportional to the number of current packets in the packet receiving queue, i.e., the more the number of current packets in the packet receiving queue is, the more the packet receiving queue is congested, the lower the queue score is.
Illustratively, the queue score is inversely related to the congestion of the messages in the message receiving queue, that is, the more severe the congestion of the messages in the message receiving queue is, the lower the queue score is.
Illustratively, the queue score is positively correlated with the dequeuing speed of the message receiving queue, that is, the more the dequeuing speed of the message in the message receiving queue is, the more the message receiving queue is unobstructed, and the higher the queue score is.
For example, the queue score of the message receiving queue may be determined according to one or more of the current number of messages, the congestion condition of the messages, and the dequeuing speed. For example, the queue score of the message receiving queue is determined according to the current message quantity and the dequeuing speed.
In some embodiments, the determining, according to the queue status information of the message receiving queues, the queue score of each of the plurality of message receiving queues further includes: and under the condition that the current message quantity and the dequeuing speed of the message receiving queue are both 0, determining the queue value of the message receiving queue to be a preset maximum queue value.
For example, since the queue score is positively correlated with the dequeuing speed of the message receiving queue, when the dequeuing speed is extremely low, it usually indicates that there is severe congestion in the message receiving queue. For example, if the dequeuing speed of the message receiving queue is 0, it indicates that no message is received in the message receiving queue; possibly, the message in the message receiving queue cannot be normally dequeued due to the fact that the message receiving queue is extremely congested at the moment; however, it is also possible that no message is dequeued from the message receiving queue because no message is present in the message receiving queue.
Therefore, if the dequeuing speed of the message receiving queue is 0, the current message quantity needs to be judged, if the current message quantity and the dequeuing speed of the message receiving queue are both 0, it indicates that no message exists in the message receiving queue, at this time, the message receiving queue is in an idle state, and no congestion exists, the queue value can be set to be a preset maximum queue value, and when a target queue for receiving the target message is determined, the message receiving queue in the idle state is preferentially determined to be the target queue.
Illustratively, the preset maximum queue score is the maximum value of the queue score. For example, if the queue score ranges from 0-100, then the maximum queue score is 100. Of course, the preset maximum queue score may be other values, and is not limited herein.
In some embodiments, the determining the queue value of each of the plurality of message receiving queues according to the queue status information of the message receiving queue includes: and determining the queue value according to the queue state information of the message receiving queue and the preset basic value of the message receiving queue.
For example, since the queue status information of the packet receiving queue may change at any time, the queue score determined according to the queue status information at different times is usually different. However, the queue score may also be related to the attribute of the message receiving queue itself, and therefore, it may be determined in advance that the base score is determined according to the attribute of each message receiving queue, and then the queue score of each message receiving queue is determined according to the queue status information of the message receiving queue and the base score.
For example, the base score may be manually set in advance for each packet receiving queue, or may be automatically determined according to a preset base score determination rule, which is not limited herein.
In some embodiments, the determining a queue score of each of the plurality of message receiving queues according to the queue status information of the message receiving queues includes: and determining respective queue values of the plurality of message receiving queues at preset time intervals according to the queue state information of the message receiving queues.
Illustratively, because the queue state information of the message receiving queues is changed, the respective queue values of the message receiving queues are determined at preset time intervals, and the queue values are updated in real time, so as to timely cope with new congestion, and improve the timeliness and flexibility of the message scheduling method.
For example, the preset time interval may be set according to an actual requirement, and for example, the queue score of each message receiving queue may be determined every 15 seconds or every 30 seconds, which is not limited herein.
Step S102, when receiving the target message, determining the target queue for receiving the target message according to the queue value of each of the plurality of message receiving queues.
Illustratively, the target packet is typically a time-sensitive packet. Specifically, the target packet may be a Protocol packet that the processor needs to receive in time, such as an Address Resolution Protocol (ARP) packet. Certainly, the type of the target packet may be set according to actual requirements, and is not limited herein.
For example, since the queue score is positively correlated with the smoothness of the packet receiving queue, when the target packet is received, the packet receiving queue with the highest queue score may be determined as the target queue.
For example, step S101 determines respective queue scores of a plurality of message receiving queues according to the queue status information of the message receiving queues, and may also be executed when the target message is received or after the target message is received, where the execution order of the steps is not limited herein.
Referring to fig. 2, fig. 2 is a flowchart illustrating a sub-step of a method for determining a target queue according to an embodiment of the present invention.
As shown in fig. 2, in some embodiments, when a target packet is received, determining a target queue for receiving the target packet according to respective queue scores of the plurality of packet receiving queues, further includes: step S1021, determining a message receiving queue for receiving the target message according to the characteristic value of the target message; step S1022, when receiving the target packet, determining the target queue for receiving the target packet according to the respective queue scores of the plurality of packet receiving queues under the condition that the packet receiving queue for receiving the target packet is congested.
For example, a message typically contains a characteristic value indicating the type of the message. According to the characteristic value of the message, whether the received message belongs to the target message or not can be determined, and according to the characteristic value of the message, a target queue matched with the message can also be determined.
For example, a user may add, modify, and delete a preset type of a target packet by setting a feature value of the target packet according to an actual requirement.
For example, if there is no congestion in the target queue, the processor may also receive the target message in time through the message receiving queue matched with the feature value of the target message, and the processor directly receives the target message through the message receiving queue matched with the feature value of the target message without re-determining the target queue according to the queue status information.
Illustratively, if congestion exists in the target queue and the processor cannot timely receive the target message through the target queue matched with the target message, the target queue for receiving the target message is re-determined according to the queue value, so that the processor can timely receive the message of a specific type, and the running stability of the processor is improved.
Step S103, receiving the target message through the target queue.
For example, if the packet receiving queue matching the feature value of the target packet is congested, the target packet is received through the target queue determined again in step S102, the target packet is directed to the target queue, and the target packet is received by the target queue.
For example, under the condition that the number of target packets is large, a large number of target packets enter the same target queue in a short time, which may cause congestion in an originally unobstructed target queue. At this time, the general degree of the target queue will be decreased, i.e. the queue score of the target queue will be decreased accordingly.
Referring to fig. 3, fig. 3 is a schematic flowchart illustrating a step of another message scheduling method according to an embodiment of the present invention.
As shown in fig. 3, in some embodiments, after the receiving the target packet through the target queue, the packet scheduling method further includes: and step S104, determining the target queues for receiving the target messages again according to the queue values of the message receiving queues under the condition that the queue values corresponding to the target queues are smaller than a preset value threshold.
For example, a value threshold indicating that the target queue is no longer suitable for receiving the target message may be preset, and when the target message is received through the target queue, if the queue value corresponding to the target queue is smaller than the preset value threshold, the target queue for receiving the target message is determined according to the queue value of each of the current multiple message receiving queues.
Referring to fig. 4, fig. 4 is a schematic view of a scenario for implementing a message scheduling method according to an embodiment of the present invention.
As shown in fig. 4, the message scheduling method provided in the foregoing embodiment may be applied to a processor, such as a processor of a switch or a router, but is not limited thereto.
Illustratively, the message receiving queue 1, the message receiving queue 2, … …, and the message receiving queue N are used for delivering messages to the processor, where the number of the message receiving queues is not limited, and N may be any positive integer.
For example, if the feature value of the target message indicates that the message receiving queue for receiving the target message is the message receiving queue 1, and the message receiving queue 1 is congested, according to the queue values corresponding to the message receiving queue 1-the message receiving queue N, the message receiving queue with the highest queue value is determined as the target queue, for example, the message receiving queue 2 is determined as the target queue.
If the queue value of the message receiving queue 2 is reduced to be smaller than the preset value threshold value after a certain time, determining a target queue for receiving the target message again according to the queue values of the plurality of message receiving queues. For example, if the message receiving queue with the highest queue score is the message receiving queue 3, the message receiving queue 3 is determined as the target queue.
The message scheduling method provided by the embodiment determines respective queue values of a plurality of message receiving queues according to the queue state information of the message receiving queues; when a target message is received, determining a target queue for receiving the target message according to respective queue values of the plurality of message receiving queues; and receiving the target message through the target queue. The method and the device can determine the queues for receiving the target messages according to the real-time queue state information of each queue, ensure that the target messages are received in time, reduce the influence of congestion in the queues on the target messages, improve the effectiveness and rationality of message scheduling and improve the stability of a processor.
Referring to fig. 5, fig. 5 is a schematic block diagram illustrating a structure of a message scheduling apparatus according to an embodiment of the present invention.
For example, the message scheduling apparatus provided in the embodiment of the present invention may include a switch or a router, and may also include a component disposed in the switch or the router, for example, the component may be a control chip or a control circuit in the switch or the router, and certainly is not limited thereto.
As shown in fig. 5, the message scheduling apparatus 300 includes a processor 301 and a memory 302, and the processor 301 and the memory 302 are connected by a bus 303, such as an I2C (Inter-integrated Circuit) bus.
In particular, the processor 301 is configured to provide computational and control capabilities to support the operation of the overall message scheduling apparatus. The Processor 301 may be a Central Processing Unit (CPU), and the Processor 301 may also be other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. Wherein a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Specifically, the Memory 302 may be a Flash chip, a Read-Only Memory (ROM) magnetic disk, an optical disk, a usb disk, or a removable hard disk.
It will be understood by those skilled in the art that the structure shown in fig. 5 is only a block diagram of a part of the structure related to the embodiment of the present invention, and does not constitute a limitation to the message scheduling apparatus to which the embodiment of the present invention is applied, and a specific message scheduling apparatus may include more or less components than those shown in the figure, or combine some components, or have a different component arrangement.
The processor is configured to run a computer program stored in the memory, and when executing the computer program, implement any one of the message scheduling methods provided in the embodiments of the present invention.
In an embodiment, the processor is configured to run a computer program stored in the memory and to implement the following steps when executing the computer program:
determining respective queue values of a plurality of message receiving queues according to the queue state information of the message receiving queues;
when a target message is received, determining a target queue for receiving the target message according to respective queue values of the plurality of message receiving queues;
and receiving the target message through the target queue.
In an embodiment, when determining a queue value of each of a plurality of packet receiving queues according to queue status information of the packet receiving queues, the processor is configured to:
determining a queue value of the message receiving queue according to one or more of the following queue state information of the message receiving queue: the current message quantity in the message receiving queue, the congestion condition of the messages in the message receiving queue and the dequeuing speed of the message receiving queue;
the queue score is negatively related to the current message quantity in the message receiving queue, and/or the queue score is negatively related to the congestion condition of the messages in the message receiving queue, and/or the queue score is positively related to the dequeuing speed of the message receiving queue.
In an embodiment, when determining the respective queue score of the multiple packet receiving queues according to the queue status information of the packet receiving queues, the processor is configured to:
and under the condition that the current message quantity and the dequeuing speed of the message receiving queue are both 0, determining the queue value of the message receiving queue to be a preset maximum queue value.
In an embodiment, when determining the respective queue score of the multiple packet receiving queues according to the queue status information of the packet receiving queues, the processor is configured to:
and determining the queue value according to the queue state information of the message receiving queue and the preset basic value of the message receiving queue.
In an embodiment, when determining the respective queue score of the multiple packet receiving queues according to the queue status information of the packet receiving queues, the processor is configured to:
and determining respective queue values of the plurality of message receiving queues at preset time intervals according to the queue state information of the message receiving queues.
In an embodiment, after the processor performs the packet scheduling method and receives the target packet through the target queue, the processor is further configured to perform:
and under the condition that the queue value corresponding to the target queue is smaller than a preset value threshold, determining the target queue for receiving the target message again according to the queue values of the plurality of message receiving queues.
In an embodiment, when the processor determines the target queue for receiving the target packet according to the respective queue scores of the plurality of packet receiving queues when the target packet is received, the processor is configured to:
when a target message is received, under the condition that a message receiving queue for receiving the target message is congested, determining a target queue for receiving the target message according to respective queue values of a plurality of message receiving queues.
In an embodiment, when the processor receives the target packet, and when a packet receiving queue for receiving the target packet is congested, before determining the target queue for receiving the target packet according to respective queue scores of the plurality of packet receiving queues, the processor is further configured to:
and determining a message receiving queue for receiving the target message according to the characteristic value of the target message.
It should be noted that, as will be clearly understood by those skilled in the art, for convenience and brevity of description, the specific working process of the message scheduling apparatus described above may refer to the corresponding process in the foregoing message scheduling method embodiment, and details are not described herein again.
Embodiments of the present invention further provide a storage medium for a computer-readable storage, where the storage medium stores one or more programs, and the one or more programs are executable by one or more processors to implement the steps of any message scheduling method provided in the embodiments of the present invention.
The storage medium may be an internal storage unit of the message scheduling apparatus described in the foregoing embodiment, for example, a hard disk or a memory of the message scheduling apparatus. The storage medium may also be an external storage device of the message scheduling apparatus, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like, which are equipped on the message scheduling apparatus.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as is well known to those skilled in the art.
The above-mentioned serial numbers of the embodiments of the present invention are only for description, and do not represent the advantages and disadvantages of the embodiments. While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for scheduling a message is characterized by comprising the following steps:
determining respective queue values of a plurality of message receiving queues according to the queue state information of the message receiving queues;
when a target message is received, determining a target queue for receiving the target message according to respective queue values of the plurality of message receiving queues;
and receiving the target message through the target queue.
2. The method according to claim 1, wherein determining the queue score of each of the plurality of packet receiving queues according to the queue status information of the packet receiving queues comprises:
determining a queue value of the message receiving queue according to one or more of the following queue state information of the message receiving queue: the current message quantity in the message receiving queue, the congestion condition of the messages in the message receiving queue and the dequeuing speed of the message receiving queue;
the queue score is negatively related to the current message quantity in the message receiving queue, and/or the queue score is negatively related to the congestion condition of the messages in the message receiving queue, and/or the queue score is positively related to the dequeuing speed of the message receiving queue.
3. The message scheduling method according to claim 2, wherein the determining the queue score of each of the plurality of message receiving queues according to the queue status information of the message receiving queues further comprises:
and under the condition that the current message quantity and the dequeuing speed of the message receiving queue are both 0, determining the queue value of the message receiving queue to be a preset maximum queue value.
4. The method according to claim 1, wherein the determining queue values of the plurality of message receiving queues according to the queue status information of the message receiving queues comprises:
and determining the queue value according to the queue state information of the message receiving queue and the preset basic value of the message receiving queue.
5. The method according to claim 1, wherein the determining queue values of the plurality of message receiving queues according to the queue status information of the message receiving queues comprises:
and determining respective queue values of the plurality of message receiving queues at preset time intervals according to the queue state information of the message receiving queues.
6. The packet scheduling method according to claim 1, wherein after the receiving the target packet through the target queue, the packet scheduling method further comprises:
and under the condition that the queue value corresponding to the target queue is smaller than a preset value threshold, determining the target queue for receiving the target message again according to the queue values of the plurality of message receiving queues.
7. The packet scheduling method according to any one of claims 1 to 6, wherein the determining a target queue for receiving the target packet according to the queue score of each of the plurality of packet receiving queues when the target packet is received, comprises:
when a target message is received, under the condition that a message receiving queue for receiving the target message is congested, determining a target queue for receiving the target message according to respective queue values of a plurality of message receiving queues.
8. The packet scheduling method according to claim 7, wherein when the target packet is received and a packet receiving queue for receiving the target packet is congested, before determining the target queue for receiving the target packet according to respective queue scores of the plurality of packet receiving queues, the method further comprises:
and determining a message receiving queue for receiving the target message according to the characteristic value of the target message.
9. A message scheduling apparatus comprising a processor, a memory, a computer program stored on the memory and executable by the processor, and a data bus for enabling connection communication between the processor and the memory, wherein the computer program, when executed by the processor, implements the steps of the message scheduling method according to any one of claims 1 to 8.
10. A storage medium for computer readable storage, wherein the storage medium stores one or more programs which are executable by one or more processors to implement the steps of the message scheduling method of any of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211348884.0A CN115776469A (en) | 2022-10-31 | 2022-10-31 | Message scheduling method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211348884.0A CN115776469A (en) | 2022-10-31 | 2022-10-31 | Message scheduling method, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115776469A true CN115776469A (en) | 2023-03-10 |
Family
ID=85388633
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211348884.0A Pending CN115776469A (en) | 2022-10-31 | 2022-10-31 | Message scheduling method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115776469A (en) |
-
2022
- 2022-10-31 CN CN202211348884.0A patent/CN115776469A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10326713B2 (en) | Data enqueuing method, data dequeuing method, and queue management circuit | |
| US10628216B2 (en) | I/O request scheduling method and apparatus by adjusting queue depth associated with storage device based on hige or low priority status | |
| CN102035732B (en) | Service scheduling method and device | |
| US11025745B2 (en) | Technologies for end-to-end quality of service deadline-aware I/O scheduling | |
| CN113485822A (en) | Memory management method, system, client, server and storage medium | |
| WO2021109767A1 (en) | Network device and method for reducing transmission delay therefor | |
| US11258717B2 (en) | Method for sending service packet, network device, and system | |
| CN111490947A (en) | Data packet transmitting method, data packet receiving method, system, device and medium | |
| US20220091892A1 (en) | Method and system of processing data based on quic protocol stack, device and storage medium | |
| CN112040001A (en) | Request processing method and device based on distributed storage | |
| CN113986497B (en) | Queue scheduling method, device and system based on multi-tenant technology | |
| WO2021012506A1 (en) | Method and apparatus for realizing load balancing in speech recognition system, and computer device | |
| CN111586140A (en) | Data interaction method and server | |
| CN112073327B (en) | Anti-congestion software distribution method, device and storage medium | |
| CN115776469A (en) | Message scheduling method, device and storage medium | |
| CN113157465B (en) | Message sending method and device based on pointer linked list | |
| CN113765796B (en) | Flow forwarding control method and device | |
| CN108984112B (en) | Method and device for realizing storage QoS control strategy | |
| CN114296897A (en) | Method and device for sending advertisement request | |
| CN113453285A (en) | Resource adjusting method, device and storage medium | |
| CN113608885B (en) | Client request processing method, device, equipment and storage medium | |
| EP3379423A1 (en) | Technologies for fine-grained completion tracking of memory buffer accesses | |
| CN112148426A (en) | Bandwidth allocation method and device | |
| CN111459514A (en) | Terminal upgrading processing method, server and base station | |
| CN115174689A (en) | Access processing method and device for edge node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication |