CN114138465A - Method and device for scheduling queue resources - Google Patents
Method and device for scheduling queue resources Download PDFInfo
- Publication number
- CN114138465A CN114138465A CN202111329284.5A CN202111329284A CN114138465A CN 114138465 A CN114138465 A CN 114138465A CN 202111329284 A CN202111329284 A CN 202111329284A CN 114138465 A CN114138465 A CN 114138465A
- Authority
- CN
- China
- Prior art keywords
- queue
- operating system
- network card
- message
- application program
- 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
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000005540 biological transmission Effects 0.000 claims description 26
- 238000004590 computer program Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Telephonic Communication Services (AREA)
Abstract
The application discloses a method and a device for scheduling queue resources, wherein the method is applied to an operating system and comprises the following steps: the operating system identifies the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain a global identification; the operating system acquires the state information of each queue in the queue resources based on the global identification; and the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state. Therefore, in the method, the application program running on the operating system can also utilize the queue resource of the network card, and the utilization rate of the queue resource is improved.
Description
Technical Field
The present application relates to the technical field of resource scheduling, and in particular, to a method and an apparatus for scheduling queue resources.
Background
Queue resources refer to the number of queues a hardware device (e.g., a physical network card) provides to an operating system. The operating system can execute corresponding tasks based on queue resources provided by the hardware device. For example, the operating system executes task A using 6 queues provided by the hardware device.
With the increase of service requirements (such as the requirement of the operating system for network bandwidth), the industry has provided a large bandwidth network card (such as 100G network card) for the operating system, however, the operating system cannot effectively utilize the queue resource provided by the 100G network card. For example, a 100G network card can provide queue resources for 128 queues, and the operating system may only use queue resources for a portion of the queues (e.g., 28 queues), which may result in a situation where queue resources for 100 queues are idle.
Since the queue resources of 100 queues in the idle state are invisible to the operating system, although some service requirements are met in the above scheme, a large amount of queue resources are wasted, and the utilization rate of the queue resources is low.
Disclosure of Invention
The purpose of this application lies in: the method and the device for scheduling the queue resources can improve the utilization rate of the queue resources.
In a first aspect, the present application provides a method for scheduling queue resources, which is applied to an operating system, and the method includes:
the operating system identifies the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain a global identification;
the operating system acquires the state information of each queue in the queue resources based on the global identification;
and the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state.
In some possible implementation manners, when there are a plurality of queues whose state information is in an idle state, the operating system transmits, by using the queue whose state information is in the idle state, a message that needs to be transmitted by an application running on the operating system, where the message includes:
and the operating system transmits messages to be transmitted by an application program running on the operating system in parallel by using a plurality of queues with the state information in an idle state.
In some possible implementations, the method further includes:
when the application program running on the operating system needs to transmit the message, the operating system releases the queue resource occupied by transmitting the message.
In some possible implementations, the operating system includes a plurality of processors; the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state, and the method comprises the following steps:
the operating system selects a processor with load lower than a preset threshold value, and receives a message transmission request of an application program running on the operating system;
and the operating system transmits the message required to be transmitted by the application program according to the message transmission request based on the processor with the load lower than the preset threshold value.
In some possible implementations, the obtaining, by the operating system, the state information of each queue in the queue resource based on the global identifier includes:
and the operating system acquires the state information of each queue in the queue resources from a resource pool through an Application Programming Interface (API) based on the global identification.
In a second aspect, the present application provides an apparatus for scheduling queue resources, including:
the identification module is used for identifying the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain a global identification;
a state information obtaining module, configured to obtain state information of each queue in the queue resources based on the global identifier;
and the transmission module is used for transmitting the message which needs to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state.
In some possible implementation manners, the transmission module is specifically configured to, when there are a plurality of queues whose state information is in an idle state, transmit, in parallel, a message that needs to be transmitted by an application program running on the operating system, using the plurality of queues whose state information is in the idle state.
In some possible implementations, the apparatus further includes:
and the releasing module is used for releasing queue resources occupied by transmitting the messages when the messages required to be transmitted by the application program running on the operating system are transmitted.
In some possible implementations, the operating system includes a plurality of processors; the transmission module is specifically configured to select a processor with a load lower than a preset threshold, and receive a message transmission request of an application program running on the operating system; and transmitting the message required to be transmitted by the application program according to the message transmission request based on the processor with the load lower than the preset threshold value.
In some possible implementation manners, the state information obtaining module is specifically configured to obtain, through an application programming interface API, the state information of each queue in the queue resource from the resource pool based on the global identifier.
In a third aspect, the present application provides an electronic device comprising a processor and a memory:
the memory is used for storing a computer program and transmitting the computer program to the processor;
the processor is configured to perform the method of any one of the above in accordance with instructions in the computer program.
In a fourth aspect, the present application provides a computer readable storage medium for storing a computer program for performing the method of any one of the above.
Compared with the prior art, the technical scheme of the application has the advantages that:
the method comprises the steps that an operating system identifies queues in queue resources provided by a network card by using network card addresses of the network card and labels of the queues in the queue resources provided by the network card to obtain a global identifier, and the global identifier can uniquely identify each queue in the queue resources provided by all the network cards. The operating system can then obtain status information for each queue in the queue resource based on the global identification. This allows the operating system to learn of the queue in an idle state. And then the operating system transmits the message which needs to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state. Thus, the application program on the operating system can also utilize the queue in the queue resource provided by the network card to transmit the message. The condition that the queue resources provided by the network card are wasted is reduced, and the utilization rate of the queue resources is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of a method for scheduling queue resources according to an embodiment of the present application;
fig. 2 is a schematic diagram of a scheduling apparatus for queue resources according to an embodiment of the present disclosure.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. 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 application.
In application scenes such as multimedia and short video, the requirement on network bandwidth is higher and higher. In order to meet service requirements, an internet data center hundred G network has become the mainstream, but the value of the network bandwidth is increased by an operating system, which is not good at all. For example. An operating system (for example, Linux kernel, etc.) cannot effectively utilize queue resources provided by hardware devices such as a hundred G network card, and thus a large amount of queue resources provided by the hardware devices are idle or wasted.
For example, most network cards in an internet data center include two interfaces, and each interface can provide queue resources of 48-128 queues according to the model of the network card. Taking the queue resource of 128 queues as an example, when the operating system has queue resources of 28 queues, there are queue resources of 100 queues in idle state, since the queue in idle state is not visible to the operating system, that is, the operating system does not know which queues are in idle state. Further, these queues in the idle state are not known by the application running on the operating system, and thus the application cannot utilize the queues in the idle state. It can be seen that although the service requirement of the network bandwidth is satisfied to some extent, the utilization rate of the queue resource is reduced.
In view of the above, the present application provides a method for scheduling queue resources. The method can be applied to an operating system. Specifically, the method comprises the following steps: the operating system identifies the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain a global identification; the operating system acquires the state information of each queue in the queue resources based on the global identification; and the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state. Therefore, the method obtains the state information of each queue through the global identification of each queue, and then learns the global identification of the queue in the idle state. In this way, the application program running on the operating system can also transmit the message by using the queue in the idle state based on the global identifier of the queue in the idle state. Therefore, the method reduces the waste of queue resources provided by the network card and improves the utilization rate of the queue resources.
In order to make the technical solution of the present application clearer and easier to understand, the following introduces a scheduling method of queue resources provided in the embodiment of the present application from the perspective of an operating system.
Referring to fig. 1, this figure is a flowchart of a scheduling method for queue resources according to an embodiment of the present application. The method can be applied to an operating system, as shown in fig. 1, and comprises the following steps:
s101: and the operating system identifies the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain the global identification.
In some embodiments, the internet data center includes a network card 1 and a network card 2. The operating system may identify the queue in the queue resource provided by the network card 1 by using the network card address of the network card 1 and the number of the queue in the queue resource provided by the network card 1, so as to obtain the global identifier. The global identifier can uniquely identify queues in queue resources provided by different network cards. Similarly, the operating system may also identify the queue in the queue resource provided by the network card 2 by using the network card address of the network card 2 and the number of the queue in the queue resource provided by the network card 2, so as to obtain the global identifier.
In some examples, the global identification includes two fields, one of which may be a network card address and the other of which may be a number. For example, the global identifier may be "12345678," where "1234" is the network card address and "5678" is the number.
It should be noted that the above global identifier is only an illustration.
After the operating system identifies the queue in the queue resource provided by the network card, the operating system can find the queue uniquely corresponding to the global identification according to the global identification. In other embodiments, the operating system may also find the queues in the queue resources provided by the same network card based on the network card address, and further may determine the status information of each queue.
S102: and the operating system acquires the state information of each queue in the queue resources based on the global identification.
In some possible implementations, the operating system may monitor status information for each queue in the queue resource based on the global identification. The state information may include an occupied state and an idle state, among others. Thus, the operating system can know the queue in the idle state in the queue resources provided by the network card.
In some embodiments, the operating system may obtain status information for each queue in the queue resource from the resource pool based on the global identification through an application programming interface API. The resource pool comprises queue resources provided by all network cards in the internet data center, and the operating system can query the queue corresponding to the global identifier in the resource pool through an application programming interface and acquire the state information of the queue. Therefore, an effective means is provided for the operating system to acquire the state information of the queue in the resource pool by providing the application programming interface.
S103: and the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state.
The application program running on the operating system may be a video application, a shopping application, or the like, and in the process of using the application program by a user, the application program needs to transmit a corresponding message by using a queue in an idle state.
In some possible implementation manners, when there are a plurality of queues whose state information is in an idle state, the operating system may transmit, in parallel, messages that need to be transmitted by an application running on the operating system, by using the plurality of queues whose state information is in the idle state. For example, when there are 6 queues in the idle state, the operating system may transmit the message to be transmitted by the application program 1 in parallel by using 2 queues in the idle state, so as to improve the transmission efficiency of the message. In addition, the operating system can also utilize the remaining 4 queues in the idle state to transmit the messages that need to be transmitted by the application program 2 in parallel.
In some embodiments, the operating system may utilize bind (fd, ifindexs, queue _ ids) to extend the bind socket interface, may bind the socket to a queue in an idle state, and transmit a packet through the queue in the idle state, for example, receive a packet and send a packet. Wherein, ifindexs is the network card address, and queue _ ids is the queue number.
In some possible implementation manners, when the operating system utilizes the queue to transmit the message which needs to be transmitted by the application program, the state information of the queue is changed from an idle state to an occupied state. And then when the message to be transmitted by the application program running on the operating system is transmitted, releasing the queue resource occupied by the transmitted message by the operating system, and changing the state information of the queue from the occupied state to an idle state so as to facilitate the operating system to transmit the message to be transmitted by other application programs.
In some possible implementations, the operating system includes a plurality of processors; the operating system selects a processor with the load lower than a preset threshold value, and receives a message transmission request of an application program running on the operating system; and the operating system transmits the message required to be transmitted by the application program according to the message transmission request based on the processor with the load lower than the preset threshold value. For example, the plurality of processors may include processor 1, processor 2, and processor 3. The load on processor 1 is 90%, the load on processor 2 is 40%, and the load on processor 3 is 25%. The preset threshold may be 50%, and then the operating system may randomly determine one of processors 2 and 3, for example processor 2. The operating system may receive, with the processor 2, a message transmission request of an application running on the operating system, and then transmit, with the processor 2, a message that the application needs to transmit according to the message transmission request. In this way, the method can balance the load of a plurality of processes, so that the load of the processors is more balanced.
In some possible implementations, the operating system may also use different functions through different interfaces, as follows:
queue _ list (ifindex) may be used to query a Queue for a specified device;
queue < list > Queue _ list () can be used to query Queue resources of all devices;
queue _ id Queue _ alloc (ifindex) can be used for applying for a Queue resource from the resource pool;
queue _ get (Queue _ ID) can be used to obtain Queue-related attribute information according to the Queue ID;
queue _ set (queue _ id, attr) may be used to set attribute information of one queue;
queue _ free (queue _ id) can be used to release a queue resource.
In some examples, the operating system may set the interrupt affinity of the queue through a set _ queue _ affinity (queue _ id, cpu _ mask) interface. Specifically, the operating system performs affinity binding on the interruption of the queue according to the CPU load, and improves the message transmission performance. For example, if processor 1 is processing multiple queues of transceiving messages, and the load may reach 90%, then the operating system may bind the queue affinity to other processors, for example, processors with a load less than 50%, such as processor 1 and processor 2 described above. Thus, the operating system can further improve the message transmission performance.
Based on the above description, an embodiment of the present application provides a method for scheduling queue resources, where the method includes that an operating system identifies a queue in queue resources provided by a network card by using a network card address of the network card and a label of the queue in the queue resources provided by the network card, so as to obtain a global identifier, where the global identifier can uniquely identify each queue in the queue resources provided by all the network cards. The operating system can then obtain status information for each queue in the queue resource based on the global identification. This allows the operating system to learn of the queue in an idle state. And then the operating system transmits the message which needs to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state. Thus, the application program on the operating system can also utilize the queue in the queue resource provided by the network card to transmit the message. The condition that the queue resources provided by the network card are wasted is reduced, and the utilization rate of the queue resources is improved.
The embodiment of the application provides a scheduling device of queue resources. Referring to fig. 2, this figure is a schematic diagram of an apparatus for scheduling queue resources according to an embodiment of the present application, where the apparatus includes:
the identification module 201 is configured to identify a queue in queue resources provided by a network card by using a network card address of the network card and a number of the queue in the queue resources provided by the network card, so as to obtain a global identifier;
a status information obtaining module 202, configured to obtain status information of each queue in the queue resources based on the global identifier;
the transmission module 203 is configured to transmit a message that needs to be transmitted by an application running on the operating system, using the queue whose state information is an idle state.
In some possible implementation manners, the transmission module 203 is specifically configured to, when there are a plurality of queues whose state information is in an idle state, utilize the plurality of queues whose state information is in the idle state to transmit, in parallel, a message that needs to be transmitted by an application program running on the operating system.
In some possible implementations, the apparatus further includes:
the releasing module 204 is configured to release a queue resource occupied by transmitting the message when the message that needs to be transmitted by the application program running on the operating system is transmitted.
In some possible implementations, the operating system includes a plurality of processors; the transmission module 203 is specifically configured to select a processor with a load lower than a preset threshold, and receive a message transmission request of an application program running on the operating system; and transmitting the message required to be transmitted by the application program according to the message transmission request based on the processor with the load lower than the preset threshold value.
In some possible implementations, the status information obtaining module 202 is specifically configured to obtain, through an application programming interface API, status information of each queue in the queue resource from a resource pool based on the global identifier.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to some descriptions of the method embodiment for relevant points. The above-described apparatus embodiments are merely illustrative, and the units and modules described as separate components may or may not be physically separate. In addition, some or all of the units and modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The foregoing is directed to embodiments of the present application and it is noted that numerous modifications and adaptations may be made by those skilled in the art without departing from the principles of the present application and are intended to be within the scope of the present application.
Claims (10)
1. A method for scheduling queue resources is applied to an operating system, and the method comprises the following steps:
the operating system identifies the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain a global identification;
the operating system acquires the state information of each queue in the queue resources based on the global identification;
and the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state.
2. The method according to claim 1, wherein when there are a plurality of queues with idle status information, the operating system uses the queues with idle status information to transmit the messages that need to be transmitted by the application running on the operating system, and the method includes:
and the operating system transmits messages to be transmitted by an application program running on the operating system in parallel by using a plurality of queues with the state information in an idle state.
3. The method of claim 1, further comprising:
when the application program running on the operating system needs to transmit the message, the operating system releases the queue resource occupied by transmitting the message.
4. The method of claim 1, wherein the operating system comprises a plurality of processors; the operating system transmits the message to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state, and the method comprises the following steps:
the operating system selects a processor with load lower than a preset threshold value, and receives a message transmission request of an application program running on the operating system;
and the operating system transmits the message required to be transmitted by the application program according to the message transmission request based on the processor with the load lower than the preset threshold value.
5. The method of any of claims 1-4, wherein the operating system obtaining status information for each queue in the queue resource based on the global identification comprises:
and the operating system acquires the state information of each queue in the queue resources from a resource pool through an Application Programming Interface (API) based on the global identification.
6. An apparatus for scheduling queue resources, comprising:
the identification module is used for identifying the queue in the queue resource provided by the network card by using the network card address of the network card and the serial number of the queue in the queue resource provided by the network card to obtain a global identification;
a state information obtaining module, configured to obtain state information of each queue in the queue resources based on the global identifier;
and the transmission module is used for transmitting the message which needs to be transmitted by the application program running on the operating system by using the queue with the state information in the idle state.
7. The apparatus according to claim 6, wherein the transmission module is specifically configured to, when there are a plurality of queues whose state information is idle, transmit, in parallel, the packet that needs to be transmitted by the application running on the operating system, using the plurality of queues whose state information is idle.
8. The apparatus of claim 6, further comprising:
and the releasing module is used for releasing queue resources occupied by transmitting the messages when the messages required to be transmitted by the application program running on the operating system are transmitted.
9. The apparatus of claim 6, wherein the operating system comprises a plurality of processors; the transmission module is specifically configured to select a processor with a load lower than a preset threshold, and receive a message transmission request of an application program running on the operating system; and transmitting the message required to be transmitted by the application program according to the message transmission request based on the processor with the load lower than the preset threshold value.
10. The apparatus according to any one of claims 6 to 9, wherein the status information obtaining module is specifically configured to obtain, through an application programming interface API, the status information of each queue in the queue resource from a resource pool based on the global identifier.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111329284.5A CN114138465A (en) | 2021-11-10 | 2021-11-10 | Method and device for scheduling queue resources |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111329284.5A CN114138465A (en) | 2021-11-10 | 2021-11-10 | Method and device for scheduling queue resources |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114138465A true CN114138465A (en) | 2022-03-04 |
Family
ID=80393521
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111329284.5A Pending CN114138465A (en) | 2021-11-10 | 2021-11-10 | Method and device for scheduling queue resources |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114138465A (en) |
-
2021
- 2021-11-10 CN CN202111329284.5A patent/CN114138465A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108200134B (en) | Request message management method and device, and storage medium | |
| US11159411B2 (en) | Distributed testing service | |
| CN110677277B (en) | Data processing method, device, server and computer readable storage medium | |
| CN109729106B (en) | Method, system and computer program product for processing computing tasks | |
| JP2009282807A (en) | Apparatus, method and program for message binding processing | |
| CN106897299B (en) | Database access method and device | |
| US20200081755A1 (en) | Link optimization for callout request messages | |
| CN107133109B (en) | Method and device for communication between modules and computing equipment | |
| CN111427694A (en) | Task execution method, device, system and server | |
| CN110636124B (en) | VPP cluster management method and device, electronic equipment and storage medium | |
| WO2021159831A1 (en) | Programming platform user code running method, platform, node, device and medium | |
| CN113259415B (en) | Network message processing method and device and network server | |
| US8199668B2 (en) | Method for attaching to a partitioned queue spread across a plurality of messaging servers | |
| CN115237589A (en) | SR-IOV-based virtualization method, device and equipment | |
| CN115445194A (en) | Rendering method, device and equipment of game and storage medium | |
| CN108028806A (en) | The method and apparatus that virtual resource is distributed in network function virtualization NFV networks | |
| EP4123449A1 (en) | Resource scheduling method and related device | |
| CN111835809B (en) | Work order message distribution method, work order message distribution device, server and storage medium | |
| CN114138465A (en) | Method and device for scheduling queue resources | |
| CN109218371B (en) | Method and equipment for calling data | |
| US20150373095A1 (en) | Method and apparatus for determining service quality profile on data distribution service | |
| CN112073215A (en) | Method for realizing application and service controller | |
| CN112436982B (en) | Network flow automatic mixed running test method, system, terminal and storage medium | |
| CN111835770B (en) | Data processing method, device, server and storage medium | |
| CN110275778B (en) | Online program running method and device, electronic equipment and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |