CN115766876A - Resource scheduling method, device, equipment and storage medium - Google Patents
Resource scheduling method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN115766876A CN115766876A CN202211466488.8A CN202211466488A CN115766876A CN 115766876 A CN115766876 A CN 115766876A CN 202211466488 A CN202211466488 A CN 202211466488A CN 115766876 A CN115766876 A CN 115766876A
- Authority
- CN
- China
- Prior art keywords
- target
- scheduling
- node
- computing
- determining
- 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 52
- 238000004364 calculation method Methods 0.000 claims abstract description 65
- 238000004590 computer program Methods 0.000 claims description 6
- 238000004891 communication Methods 0.000 abstract description 13
- 230000006978 adaptation Effects 0.000 abstract description 4
- 238000013461 design Methods 0.000 description 17
- 230000006870 function Effects 0.000 description 13
- 210000004556 brain Anatomy 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 230000004044 response Effects 0.000 description 6
- 238000011161 development Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000005265 energy consumption Methods 0.000 description 3
- 238000012423 maintenance Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a resource scheduling method, a resource scheduling device, a resource scheduling apparatus and a storage medium, which relate to the technical field of communication and are used for determining a computing power node with the highest adaptation degree of a scheduling request of user equipment and providing computing power service for the user equipment. The method comprises the following steps: the resource scheduling device responds to a scheduling request of computing resources initiated by user equipment and determines a plurality of target computing nodes; and determining a scheduling strategy for scheduling the computational resources according to the scheduling request. Further, the resource scheduling device determines a first target score of each target computational power node in the plurality of target computational power nodes according to a plurality of indexes corresponding to the sub-scheduling policies under the condition that the scheduling policies include one sub-scheduling policy. Finally, the resource scheduling device determines a computational power node to be scheduled; the calculation force node to be scheduled is a target calculation force node with the largest first target score in the target calculation force nodes, and the calculation force node to be scheduled is used for providing calculation force service for the user equipment.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a resource scheduling method, apparatus, device, and storage medium.
Background
Under the development trend of cloud computing and edge computing, computing power of many different scales can be distributed at different distances close to users in future society, and various personalized services are provided for the users through a global network. From billions of intelligent terminals, to billions of home gateways around the world, to thousands of edge clouds with computing power brought by future edge computing in each city, and to dozens of large cloud data centers of operators, a huge amount of ubiquitous computing power is formed, and the development trend of computing and network deep fusion is formed.
In the prior art, in a scenario of computing resource scheduling, an operator generally performs computing resource scheduling according to a single-aspect requirement provided by a user, and with the development of computing network technology and services, the user's requirement on a computing network is richer and more refined.
Disclosure of Invention
The application provides a resource scheduling method, a resource scheduling device, a resource scheduling apparatus and a storage medium, which are used for determining a computational power node with the highest adaptation degree with a scheduling request of user equipment, and providing computational power service for the user equipment.
In a first aspect, a method for scheduling resources is provided, where the method includes: the resource scheduling device responds to a scheduling request of computing resources initiated by user equipment and determines a plurality of target computing nodes; the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request. And the resource scheduling device determines a scheduling strategy for scheduling the computational resource according to the scheduling request, wherein the scheduling strategy comprises at least one sub-scheduling strategy, and the sub-scheduling strategy corresponds to a plurality of indexes. Further, the resource scheduling device determines a first target score of each target computing power node in the plurality of target computing power nodes according to a plurality of indexes corresponding to the sub-scheduling policy under the condition that the scheduling policy includes one sub-scheduling policy. Finally, the resource scheduling device determines a computational power node to be scheduled; the calculation force node to be scheduled is a target calculation force node with the largest first target score in the target calculation force nodes, and the calculation force node to be scheduled is used for providing calculation force service for the user equipment.
In the resource scheduling method provided by the application, a resource scheduling device firstly determines a target computation power node with computation power capacity capable of meeting the computation power requirement in a user equipment scheduling request, determines a scheduling strategy for scheduling the computation power resource based on the scheduling request, determines a first target score of each target computation power node based on a plurality of indexes included in the scheduling strategy, determines a target computation power node with the highest first target score as a computation power node to be scheduled, and provides computation power service for the user equipment based on the computation power node to be scheduled so as to meet the refined requirement of a user.
In one possible design, the determining, by the resource scheduling apparatus, a first target score of each target computing power node in the plurality of target computing power nodes according to the plurality of indexes corresponding to the sub-scheduling policy includes: the resource scheduling device determines the index weight of a plurality of indexes in the scheduling request; and determining a plurality of index scores corresponding to each target computing force node according to each index in the plurality of indexes. Further, the resource scheduling device determines a first target score of each target computing power node according to the index scores and the index weights corresponding to the target computing power nodes. In the design, under the condition that the index weight is carried in the scheduling request, the scheduling request of the user equipment is responded more accurately, and the calculation resources are scheduled for the user equipment.
In one possible design, in a case that the scheduling policy includes multiple sub-scheduling policies, the resource scheduling apparatus determines a computation node to be scheduled, including: and the resource scheduling device determines a plurality of first target scores corresponding to each target force calculation node according to a plurality of indexes corresponding to each sub-scheduling strategy in the plurality of sub-scheduling strategies. Further, the resource scheduling device determines a second target score of each target computing force node according to the plurality of first target scores corresponding to each target computing force node. And finally, the resource scheduling device determines the calculation force node to be scheduled, wherein the calculation force node to be scheduled is the target calculation force node with the maximum second target score in the plurality of target calculation force nodes. In the design, the calculation force node with the highest adaptation degree with the scheduling request is determined to provide calculation force service for the user under the condition that the scheduling request initiated by the user equipment comprises a plurality of sub-scheduling strategies.
In one possible design, the determining, by the resource scheduling apparatus, a second target score of each target computing force node according to a plurality of first target scores corresponding to each target computing force node includes: the resource scheduling device determines the strategy weight of a plurality of sub-scheduling strategies in the scheduling request. Further, the resource scheduling device determines a second target score of each target computing force node according to the plurality of first target scores corresponding to each target computing force node and the strategy weight. In the design, an implementation manner that the resource scheduling device determines the second target score of the target computation force node is provided, and the second target score can meet a scheduling request provided by user equipment.
In a second aspect, an apparatus for scheduling resources is provided, which includes an obtaining unit and a determining unit. The obtaining unit is used for obtaining a scheduling request of computing resources initiated by user equipment. The determining unit is used for responding to the scheduling request and determining a plurality of target computing power nodes; the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request. The determining unit is further configured to determine a scheduling policy for scheduling the computational resource according to the scheduling request, where the scheduling policy includes at least one sub-scheduling policy, and the sub-scheduling policy corresponds to multiple indicators. The determining unit is further configured to determine, when the scheduling policy includes one sub-scheduling policy, a first target score of each target computation power node in the plurality of target computation power nodes according to a plurality of indexes corresponding to the sub-scheduling policy. The determining unit is also used for determining a computational power node to be scheduled; the calculation force node to be scheduled is a target calculation force node with the largest first target score in the target calculation force nodes, and the calculation force node to be scheduled is used for providing calculation force service for the user equipment.
In one possible design, the determining unit is specifically configured to determine an index weight of a plurality of indexes in the scheduling request; determining a plurality of index scores corresponding to each target force calculation node according to each index in the plurality of indexes; and determining a first target score of each target calculation force node according to the index scores and the index weights corresponding to the target calculation force nodes.
In one possible design, the determining unit is further configured to determine, according to a plurality of indexes corresponding to each of the plurality of sub-scheduling policies, a plurality of first target scores corresponding to each of the target force calculation nodes; determining a second target score of each target calculation force node according to a plurality of first target scores corresponding to each target calculation force node; and determining a computational power node to be scheduled, wherein the computational power node to be scheduled is a target computational power node with the largest second target score in the plurality of target computational power nodes.
In one possible design, the determining unit is specifically configured to determine policy weights of a plurality of sub-scheduling policies in the scheduling request; and determining a second target score of each target calculation force node according to the plurality of first target scores corresponding to each target calculation force node and the strategy weight.
In a third aspect, a resource scheduling apparatus is provided, which includes a memory and a processor; a memory for storing computer program code comprising computer instructions which, when executed by the processor, cause the resource scheduling apparatus to perform the method of resource scheduling as provided by the first aspect or any one of its possible designs, is coupled to the processor.
In a fourth aspect, a computer-readable storage medium is provided, in which instructions are stored, and when the instructions are executed on a resource scheduling apparatus, the resource scheduling apparatus is caused to execute the resource scheduling method as provided in the first aspect or any one of its possible implementations.
Drawings
Fig. 1 is a schematic structural diagram of a resource scheduling system according to an embodiment of the present application;
fig. 2 is a first flowchart illustrating a resource scheduling method according to an embodiment of the present application;
fig. 3 is a schematic diagram of a scheduling policy structure according to an embodiment of the present application;
fig. 4 is a schematic flowchart of a resource scheduling method according to an embodiment of the present application;
fig. 5 is a schematic flowchart of a resource scheduling method provided in an embodiment of the present application;
fig. 6 is a fourth schematic flowchart of a resource scheduling method according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present application;
fig. 8 is a first schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of a resource scheduling device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.
In the embodiments of the present application, words such as "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
In the description of this application, "/" means "or" unless otherwise stated, for example, A/B may mean A or B. "and/or" herein is merely an association describing an associated object, and means that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. Further, "at least one" or "a plurality" means two or more. The terms "first," "second," and the like do not denote any order or importance, but rather the terms "first," "second," and the like do not denote any order or importance.
In the prior art, in a scenario of computing resource scheduling, an operator generally performs computing resource scheduling according to a single-aspect requirement provided by a user, and with the development of computing network technology and services, the user's requirement on a computing network is richer and more refined.
In order to solve the above problems, the present application provides a resource scheduling method, device, apparatus and storage medium, where the resource scheduling device determines a plurality of target computation force nodes in response to a scheduling request of computation force resources initiated by a user equipment; the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request. And the resource scheduling device determines a scheduling strategy for scheduling the computational resources according to the scheduling request, wherein the scheduling strategy comprises at least one sub-scheduling strategy, and the sub-scheduling strategy corresponds to a plurality of indexes. Further, the resource scheduling device determines a first target score of each target computing power node in the plurality of target computing power nodes according to a plurality of indexes corresponding to the sub-scheduling policy under the condition that the scheduling policy includes one sub-scheduling policy. Finally, the resource scheduling device determines a computational power node to be scheduled; the computational power node to be scheduled is a target computational power node with the largest first target score in the plurality of target computational power nodes, and the computational power node to be scheduled is used for providing computational power service for user equipment. Therefore, in the resource scheduling method provided by the application, the resource scheduling device firstly determines a target computation power node with computation power capacity capable of meeting the computation power requirement in the user equipment scheduling request, determines a scheduling policy for scheduling the computation power resource based on the scheduling request, determines a first target score of each target computation power node based on a plurality of indexes included in the scheduling policy, determines a target computation power node with the highest first target score as a computation power node to be scheduled, and provides computation power service for the user equipment based on the computation power node to be scheduled so as to meet the refined requirement of the user.
Fig. 1 illustrates a resource scheduling system, and the resource scheduling method provided in the embodiment of the present application may be applied to the resource scheduling system illustrated in fig. 1, and is used to determine a computation node with the highest adaptation degree to a scheduling request of a user equipment, and provide a computation service for the user equipment. As shown in fig. 1, the resource scheduling system 10 includes a resource scheduling apparatus 11, an access device a12, an access device B13, an access device C14, a computational node a15, a computational node B16, a user device 17, a network controller 18, and a computational brain 19.
The resource scheduling device 11 and the network computing brain 19 are integrated in the same device, the network computing brain 19 may be configured to execute the action performed by the resource scheduling device 11, and the resource scheduling method may be applied to the resource scheduling device 11 and may also be applied to the network computing brain 19. In order to introduce the interaction process between the devices more clearly, the embodiment of the present application describes the resource scheduling method by taking the application of the resource scheduling method to the resource scheduling apparatus 11 as an example.
The resource scheduling device 11 is connected with a network controller 18 and a network computing brain 19, and is respectively connected with an access device A12, an access device B13 and an access device C14 through the network controller 18; the computing power node A15 is accessed to the computing power network of the operator through an access device A12, the computing power node B16 is accessed to the computing power network of the operator through an access device B13, and the user device 17 is accessed to the computing power network of the operator through an access device C14.
It should be noted that, the resource scheduling system only exemplarily shows 3 access devices, 2 power nodes and 1 user device, and does not limit the number of the access devices, the power nodes and the user devices, and in the connection relationship among the devices, the devices may be connected in a wired manner or in a wireless manner, which is not specifically limited in this embodiment of the present invention.
The user equipment 17 may be configured to generate scheduling requests for computing resources in response to computing traffic entered by a user at the user equipment.
The user equipment 17 may also be configured to report the scheduling request to the operator effort network through the access equipment C14 after generating the scheduling request of the effort resource.
The resource scheduling means 11 may be configured to obtain, through the network controller 18, a scheduling request for computing resources initiated by the user equipment 17 through the access device C14 from the operator computing network.
The resource scheduler 11 may also be configured to query and screen target computation force nodes capable of satisfying the computation force requirements in the scheduling request through the computation force brain 19.
The resource scheduling device 11 may further be configured to determine a scheduling policy for scheduling the computational resource according to the scheduling request, and determine a computational node to be scheduled for providing computational service for the user equipment based on the scheduling policy.
In some embodiments, if the determined computing power node is computing power node a15, the resource scheduling apparatus schedules the computing power node a15 to provide computing power service for the user equipment 17, the user equipment 17 sends the computing power service/computing power application to the computing power node a15 through the access equipment C14 and the access equipment a12, and the computing power node a15 executes the received computing power service/computing power application.
Fig. 2 is a flowchart illustrating a method of resource scheduling, according to some example embodiments. In some embodiments, the above resource scheduling method may be applied to the resource scheduling apparatus 11 in the resource scheduling system 10 shown in fig. 1. Hereinafter, the present embodiment will describe the resource scheduling method by taking an example in which the resource scheduling method is applied to the resource scheduling apparatus 11.
As shown in fig. 2, the resource scheduling method provided in the embodiment of the present application includes the following steps S201 to S205.
S201, the resource scheduling device obtains a scheduling request of computing resources initiated by user equipment.
As a possible implementation manner, the user equipment initiates a scheduling request of the computing power resource based on the access equipment accessing the computing power network of the operator in response to the computing power service input by the user on the user equipment.
Correspondingly, the resource scheduling device obtains the scheduling request of the computing resource initiated by the user equipment based on the network controller connected with the access equipment.
In some embodiments, the scheduling request of the computing resource initiated by the user equipment includes a device identifier of the user equipment, a device identifier of the access device, a computing requirement, a computing resource scheduling time period, and description information of a computing node providing the computing service. Wherein the computing power requirement is used for indicating the computing power capacity requirement of the user equipment for a computing power node providing the computing power service; the description information of the computing power node can be, for example, the cost, the performance, the reliability, the efficiency, the energy consumption and the like.
For example, the user may input the computing power service on the user equipment by typing through a keyboard, or by clicking through a mouse or a screen touch, which is not specifically limited in this embodiment of the present application. For example, a user may select a computational resource scheduling time period on a user equipment, e.g., 8; inputting a computing power capacity requirement for a computing power node, such as 10GOPS (10 hundred million Operations per second, giga Operations per second); and selecting a description of the computational power node, such as low cost, moderate performance, low energy consumption, etc.
S202, the resource scheduling device responds to a scheduling request of computing power resources initiated by user equipment, and a plurality of target computing power nodes are determined.
And the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request.
As a possible implementation manner, the resource scheduling apparatus first determines whether the user equipment handles the computing service based on the equipment identifier of the user equipment in the scheduling request.
Further, after determining that the user equipment is handling the computing power service, the resource scheduling apparatus determines a computing power node connected to the access equipment based on the equipment identifier of the access equipment in the scheduling request.
Furthermore, the resource scheduling device calls a computing brain to inquire computing nodes connected with the access equipment, and computing capacity in the computing resource scheduling time period.
Further, the resource scheduling device determines a computing power node capable of providing a computing power capacity at least meeting the computing power requirement in the resource scheduling time period from the computing power nodes connected with the access equipment based on the computing power requirement of the access equipment in the scheduling request and the computing power resource scheduling time period. And finally, the resource scheduling device determines the determined computational power node as a target computational power node.
In some embodiments, if the resource scheduling apparatus determines that the user equipment does not handle the computing power service, the resource scheduling apparatus rejects the scheduling request of the computing power resource initiated by the user equipment, and sends a reason for failure in scheduling the computing power resource and a confirmation message indicating whether to handle the computing power service to the user equipment through the network controller.
Exemplarily, if a device identifier of a user equipment is a user equipment a, a device identifier of an access device is an access device a, the computational power requirement is at least 5GOPS, and the computational power resource scheduling time period is 15-00-15 in a scheduling request of computational power resources initiated by the user equipment. The resource scheduling apparatus first queries whether the user equipment a is included based on the user equipment list of the management computing power service. Further, the resource scheduling device queries a computational power node connected to the access device a based on the network controller. Further, the resource scheduling device queries the computational capacity of the computational node connected with the access device a in the following steps of 15. Finally, the resource scheduling device determines that at 15-00-15.
S203, the resource scheduling device determines a scheduling strategy for scheduling the computational resources according to the scheduling request.
The scheduling strategy comprises at least one sub-scheduling strategy, and the sub-scheduling strategy corresponds to a plurality of indexes.
As a possible implementation manner, after acquiring a scheduling request initiated by user equipment, a resource scheduling apparatus determines, through a text recognition technology, an index corresponding to the scheduling request based on description information of a computational power node providing computational power service included in the scheduling request. Further, the resource scheduling device determines sub-scheduling strategies corresponding to the scheduling request based on the determined indexes corresponding to the scheduling request and the corresponding relation between each sub-scheduling strategy and the indexes, and the sub-scheduling strategies are combined to form the scheduling strategy for scheduling the computational resources.
It should be noted that the correspondence between the sub-scheduling policy and the index may be set in advance in the resource scheduling device by an operation and maintenance person of the resource scheduling system, which is not specifically limited in this embodiment of the application.
For example, the structural relationship between the scheduling policy, the sub-scheduling policy and the index may be as shown in fig. 3, where the scheduling policy includes at least one sub-scheduling policy, and the sub-scheduling policy includes multiple indexes.
For example, the correspondence between the sub-scheduling policies and the indicators may be shown in table 1 below.
Table 1: corresponding relation table of sub-scheduling strategy and index
Illustratively, if the scheduling request of the computational resource initiated by the user equipment, the description information of the computational node providing the computational service is as follows: low time delay, low cost and sufficient available computational resources. The resource scheduling apparatus recognizes the index corresponding to the scheduling request as a delay, a cost, and an available computational resource based on a text recognition technique. Further, the resource scheduling device determines a scheduling policy that needs to adopt a combination of a performance-priority sub-scheduling policy and a cost-priority sub-scheduling policy based on a correspondence between the sub-scheduling policies and the indexes.
For example, if a user requests for scheduling of computing resources initiated by a user equipment due to the importance of computing services, only a requirement for reliability is made. The resource scheduling device determines that a single sub-scheduling policy with priority on reliability needs to be adopted as a scheduling policy to schedule the computational power resources.
S204, under the condition that the scheduling strategy comprises a sub-scheduling strategy, the resource scheduling device determines a first target score of each target computing power node in the plurality of target computing power nodes according to a plurality of indexes corresponding to the sub-scheduling strategy.
As a possible implementation manner, the resource scheduling apparatus determines, based on that the scheduling policy determined in step S203 includes one sub-scheduling policy, a plurality of indexes corresponding to the sub-scheduling policy according to a corresponding relationship between the sub-scheduling policy and the indexes. Further, the resource scheduling apparatus determines, for each target computational power node of the plurality of target computational power nodes, an index score for each target computational power node corresponding to each index of the plurality of indices. And finally, the resource scheduling device determines a first target score of each target calculation force node according to the preset index weight and the index score of each index, and obtains a plurality of first target scores which are in one-to-one correspondence with the target calculation force nodes.
It should be noted that the preset index weight may be preset in the resource scheduling device by an operation and maintenance person of the resource scheduling system, which is not specifically limited in this embodiment of the present application.
Illustratively, if the sub-scheduling policy determined by the resource scheduling apparatus is reliability priority, the plurality of target computation nodes include a computation node a, a computation node B, and a computation node C, and there are 3 selectable circuit paths from the access device connected to the user equipment to the computation node a, which are A1, A2, and A3, respectively; the access device connected with the user equipment has 2 selectable circuit paths from the computational node B, which are B1 and B2 respectively; there are 3 selectable circuit paths from the access device to which the user device is connected to the computational node C, which are C1, C2 and C3, respectively.
The resource scheduling device firstly determines the node reliability index data of the computational power node a, the computational power node B and the computational power node C and the path reliability index data of each circuit path based on the computational network brain to obtain the scheduling scheme of the computational power node + the circuit path shown in the following table.
Table 2: scheduling scheme for computational power node + circuit path
| Scheduling scheme | Target computing force node | Node reliability | Path numbering | Path reliability |
| 1 | A | 0.8 | A1 | 0.8 |
| 2 | A | 0.8 | A2 | 0.6 |
| 3 | A | 0.8 | A3 | 0.3 |
| 4 | B | 0.6 | B1 | 0.8 |
| 5 | B | 0.6 | B2 | 0.9 |
| 6 | C | 0.4 | C1 | 0.7 |
| 7 | C | 0.4 | C2 | 0.5 |
| 8 | C | 0.4 | C3 | 0.9 |
Further, the resource scheduling device determines index scores of the target computation force nodes, normalized index scores of the circuit paths and first target scores of the target computation force nodes under the condition that preset index weights account for 50% of each index score based on the node reliability data of each target computation force node and the reliability data of each circuit path.
Table 3: index score and first target score table
It should be noted that, how the resource scheduling device specifically determines the index score of each index corresponding to the target computational power node in the multiple indexes may refer to the records in the subsequent embodiments of the present application, and details are not repeated here.
S205, the resource scheduling device determines the computational power node to be scheduled.
The computational power node to be scheduled is a target computational power node with the largest first target score in the plurality of target computational power nodes, and the computational power node to be scheduled is used for providing computational power service for user equipment.
As a possible implementation manner, the resource scheduling apparatus determines, based on the score ranking of each scheduling scheme determined in step S204, a target computation power node corresponding to the score ranking of 1, and determines the target computation power node as a computation power node to be scheduled, and provides computation power service for the user equipment through a circuit path corresponding to the score ranking of 1 based on the computation power node to be scheduled, where the scheduling scheme corresponding to the score ranking of 1 is an optimal scheduling scheme capable of satisfying the scheduling request of the user equipment.
Illustratively, taking table 3 in step S204 of the above embodiment as an example, the resource scheduling apparatus determines that the target computational power node corresponding to the score rank of 1 is target computational power node a, and the path number of the circuit path is 1. Further, the resource scheduling device provides the computing service for the user equipment according to the scheduling scheme of the target computing node A + the circuit path A1.
In one design, in order to achieve more accurate scheduling of computing resources for a user equipment in response to a scheduling request of the user equipment, the resource scheduling method provided in this embodiment of the present application, as shown in fig. 4, further includes S301 to S303.
S301, the resource scheduling device determines index weights of a plurality of indexes in the scheduling request.
As a possible implementation manner, the resource scheduling apparatus obtains an index weight of each index of the plurality of indexes according to the analysis scheduling request.
Illustratively, the sub-scheduling policy included in the scheduling request is performance priority, where the circuit delay weight is 50%, the available computational resource weight is 30%, and the circuit jitter weight is 20%. The resource scheduling apparatus may determine an index weight for each index of the plurality of indices based on the scheduling request.
S302, the resource scheduling device determines a plurality of index scores corresponding to each target computing power node according to each index in the plurality of indexes.
As a possible implementation manner, the resource scheduling device determines, based on the index data of each target computational power node for each index, the index data of each index corresponding to each target computational power node, and further obtains a plurality of index data of the target computational power node corresponding to each index.
The resource scheduling device determines, for each index, index data for the index for each target computation power node, and determines a target computation power node having the optimal index data as a reference score of 100. Further, the resource scheduling device determines the index score of each target computing power node according to the optimal index data and the index data of other target computing power nodes.
Illustratively, if the value of the optimal index data is a, the value of the index data of the index score to be calculated is x, and the index score is Q. In the case that the smaller the index data is, the better the index data is, the following formula can be adopted for calculation:
Q＝a/x*100
in the case that the larger the index data is, the better the index data is, the following formula can be adopted for calculation:
Q＝x/a*100
for example, taking the node cost index as an example, if the unit computation power usage cost of the computation power node 1 is 1000 yuan, the unit computation power usage cost of the computation power node 2 is 1250 yuan, and the unit computation power usage cost of the computation power node 3 is 1500 yuan, then the computation power node 1 is scored as 100 minutes, the computation power node 2 is scored as [1000/1250 × 100] =80 minutes, and the computation power node 3 is scored as [1000/1500 × 100] =67 minutes.
Taking the delay index as an example, if there are three selectable circuit paths from the access device corresponding to the ue to the target node, and the path delays are 4ms, 5ms, and 6ms, respectively, then the score of path 1 is 100, the score of path 2 is [4/5 × 100] =80, and the score of path 3 is [4/6 × 100] = 67. Similarly, if a plurality of selectable circuit paths exist from the access device corresponding to the user equipment to a plurality of computation nodes, the resource scheduling device takes the circuit path with the shortest time delay as 100 full-score reference score, and scores other circuit paths according to the algorithm.
Taking the energy consumption index as an example, if the PUE of computational node 1 is 1.2, the PUE of computational node 2 is 1.3, and the PUE of computational node 3 is 1.5, the PUE score of computational node 3 is 100 points, the PUE score of computational node 1 is [1.2/1.5 x 100] =80 points, and the PUE score of computational node 2 is [1.3/1.5 x 100] =92 points.
Note that, the index scores of other indexes may refer to the descriptions of the above embodiments, and are not described herein again.
S303, the resource scheduling device determines a first target score of each target calculation force node according to the index scores and the index weights corresponding to the target calculation force nodes.
As a possible implementation manner, the resource scheduling apparatus calculates the first target score of each target computational power node according to the index weight determined in the step S301 and a plurality of index scores corresponding to the index of each target computational power node determined in the step S302.
For example, if the scheduling request determined by the resource scheduling device includes 3 indexes, the index scores of the target computation force node are a, b, and c, respectively, and the weight ratios of the indexes are x, y, and z, respectively, the resource scheduling device determines that the first target score of the target computation force node is ax + by + cz.
In one design, in order to meet a requirement of a user for a computing power service when a scheduling request initiated by a user equipment includes multiple sub-scheduling policies, an embodiment of the present application provides a resource scheduling method, which, as shown in fig. 5, further includes S401 to S403.
S401, the resource scheduling device determines a plurality of first target scores corresponding to each target force calculation node according to a plurality of indexes corresponding to each sub-scheduling strategy in the plurality of sub-scheduling strategies.
As a possible implementation manner, the resource scheduling device determines each target calculation force node, determines a first target score of the target calculation force node based on a plurality of indexes corresponding to each sub-scheduling strategy in a plurality of sub-scheduling strategies, and obtains a plurality of first target scores corresponding to the sub-scheduling strategies one by one.
It should be noted that, the resource scheduling apparatus determines the first target score of each target computation power node according to a plurality of indexes corresponding to each sub-scheduling policy, which may refer to the records in step S204 or step S303 in the foregoing embodiment of the present application, and details are not described here again.
S402, the resource scheduling device determines a second target score of each target calculation force node according to the plurality of first target scores corresponding to each target calculation force node.
As a possible implementation manner, the resource scheduling apparatus calculates a second target score of each target computation force node according to a preset weight of each sub-scheduling policy of the plurality of sub-scheduling policies and the first target score corresponding to each sub-scheduling policy.
As another possible implementation manner, the resource scheduling apparatus adds and sums the first target scores corresponding to each of the plurality of sub-scheduling policies, and determines the obtained sum as the second target score of each target computation force node.
It should be noted that the preset weight of each sub-scheduling policy may be preset in the resource scheduling device by an operation and maintenance person of the resource scheduling system, which is not specifically limited in this embodiment of the present application.
For example, if the plurality of sub-scheduling policies includes a sub-scheduling policy a and a sub-scheduling policy B, the preset weights are both 50%, the first target score corresponding to the sub-scheduling policy a is 90, and the first target score corresponding to the sub-scheduling policy B is 80. The resource scheduling device determines the second target score to be 90 × 50% +80 × 50% =85 based on the preset weight and the first target score.
If the second target score is determined in the second implementation manner, the resource scheduling device determines that the second target score is 90+80=170.
S403, the resource scheduling device determines the computational power node to be scheduled.
And the calculation force node to be scheduled is the target calculation force node with the largest second target score in the plurality of target calculation force nodes.
As a possible implementation manner, the resource scheduling apparatus determines, according to the second target score of each target computation power node in the plurality of target computation power nodes, the target computation power node with the largest second target score as the computation power node to be scheduled, and provides the computation power service for the user equipment based on the computation power node to be scheduled.
In one design, in order to achieve more accurate scheduling of computing resources for a user equipment in response to a scheduling request of the user equipment, the resource scheduling method provided in this embodiment of the present application, as shown in fig. 6, further includes S501-S502.
S501, the resource scheduling device determines the strategy weight of a plurality of sub-scheduling strategies in the scheduling request.
As a possible implementation manner, the resource scheduling apparatus obtains the policy weight of each sub-scheduling policy of the plurality of sub-scheduling policies according to the parsed scheduling request.
Illustratively, the scheduling request includes a sub-scheduling policy a, a sub-scheduling policy B, and a sub-scheduling policy C, and the weight ratio of the sub-scheduling policy a is 50%, the weight ratio of the sub-scheduling policy a is 30%, and the weight ratio of the sub-scheduling policy C is 20%. The resource scheduling device may determine a policy weight for each of the plurality of sub-scheduling policies based on the scheduling request.
S502, the resource scheduling device determines a second target score of each target computing force node according to the plurality of first target scores corresponding to each target computing force node and the strategy weight.
As a possible implementation manner, the resource scheduling apparatus calculates the second target score of each target computation power node according to the policy weight determined in step S501 and the first target scores of each target computation power node determined in step S302, which are in one-to-one correspondence with the sub-scheduling policies.
The scheme provided by the embodiment of the application is mainly introduced from the perspective of a method. To implement the above functions, it includes hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiment of the present application, the user equipment may be divided into the functional modules according to the method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. Optionally, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and another division manner may be provided in actual implementation.
Fig. 7 is a schematic structural diagram of a resource scheduling apparatus according to an embodiment of the present application. The resource scheduling device is used for executing the resource scheduling method. As shown in fig. 7, the resource scheduling apparatus 60 includes an obtaining unit 601 and a determining unit 602.
An obtaining unit 601, configured to obtain a scheduling request of computing resources initiated by a user equipment. For example, as shown in fig. 2, the obtaining unit 601 may be configured to execute S201.
A determining unit 602, configured to determine a plurality of target compute power nodes in response to a scheduling request; the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request. For example, as shown in fig. 2, the determining unit 602 may be configured to perform S202.
The determining unit 602 is further configured to determine a scheduling policy for scheduling the computational resource according to the scheduling request, where the scheduling policy includes at least one sub-scheduling policy, and the sub-scheduling policy corresponds to multiple indicators. For example, as shown in fig. 2, the determining unit 602 may be configured to execute S203.
The determining unit 602 is further configured to determine, when the scheduling policy includes one sub-scheduling policy, a first target score of each target computation power node in the plurality of target computation power nodes according to a plurality of indexes corresponding to the sub-scheduling policy. For example, as shown in fig. 2, the determining unit 602 may be configured to execute S204.
The determining unit 602 is further configured to determine a computation force node to be scheduled; the calculation force node to be scheduled is a target calculation force node with the largest first target score in the target calculation force nodes, and the calculation force node to be scheduled is used for providing calculation force service for the user equipment. For example, as shown in fig. 2, the determining unit 602 may be configured to execute S205.
Optionally, as shown in fig. 7, in the resource scheduling apparatus 60 provided in the embodiment of the present application, the determining unit 602 is specifically configured to determine index weights of multiple indexes in the scheduling request. For example, as shown in fig. 4, the determining unit 602 may be configured to execute S301.
Determining a plurality of index scores corresponding to each target computing force node according to each index in the plurality of indexes. For example, as shown in fig. 4, the determining unit 602 may be configured to execute S302.
And determining a first target score of each target calculation force node according to the index scores and the index weights corresponding to each target calculation force node. For example, as shown in fig. 4, the determining unit 602 may be configured to execute S303.
Optionally, as shown in fig. 7, in the resource scheduling apparatus 60 provided in the embodiment of the present application, the determining unit 602 is further configured to determine, according to a plurality of indexes corresponding to each of a plurality of sub-scheduling policies, a plurality of first target scores corresponding to each target force node. For example, as shown in fig. 5, the determining unit 602 may be configured to execute S401.
And determining a second target score of each target calculation force node according to the plurality of first target scores corresponding to each target calculation force node. For example, as shown in fig. 5, the determining unit 602 may be configured to execute S402.
And determining a computational power node to be scheduled, wherein the computational power node to be scheduled is a target computational power node with the largest second target score in the plurality of target computational power nodes. For example, as shown in fig. 5, the determining unit 602 may be configured to execute S403.
Optionally, as shown in fig. 7, in the resource scheduling apparatus 60 provided in the embodiment of the present application, the determining unit 602 is specifically configured to determine the policy weights of multiple sub-scheduling policies in the scheduling request. For example, as shown in fig. 6, the determining unit 602 may be configured to perform S501.
And determining a second target score of each target calculation force node according to the plurality of first target scores corresponding to each target calculation force node and the strategy weight. For example, as shown in fig. 6, the determining unit 602 may be configured to execute S502.
In the case that the functions of the integrated modules are implemented in the form of hardware, the embodiment of the present application provides a possible structural schematic diagram of a resource scheduling device. The resource scheduling apparatus is configured to execute the resource scheduling method executed by the resource scheduling device in the foregoing embodiment. As shown in fig. 8, the resource scheduling apparatus 70 includes a processor 701, a memory 702, and a bus 703. The processor 701 and the memory 702 may be connected by a bus 703.
The processor 701 is a control center of the resource scheduling device, and may be a single processor or a collective term for multiple processing elements. For example, the processor 701 may be a Central Processing Unit (CPU), or may be another general-purpose processor. Wherein the general purpose processor may be a microprocessor or any conventional processor or the like.
For one embodiment, processor 701 may include one or more CPUs, such as CPU 0 and CPU 1 shown in FIG. 8.
The memory 702 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a magnetic disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer.
As a possible implementation, the memory 702 may be present separately from the processor 701, and the memory 702 may be connected to the processor 701 via the bus 703 for storing instructions or program code. The processor 701 can implement the resource scheduling method provided by the embodiment of the present application when calling and executing the instructions or program codes stored in the memory 702.
In another possible implementation, the memory 702 may also be integrated with the processor 701.
The bus 703 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 8, but this is not intended to represent only one bus or type of bus.
It is to be noted that the structure shown in fig. 8 does not constitute a limitation of the resource scheduling device 70. The resource scheduling device 70 may include more or fewer components than shown in fig. 8, or some components may be combined, or a different arrangement of components than shown in fig. 8.
As an example, in conjunction with fig. 7, the functions implemented by the obtaining unit 601 and the determining unit 602 in the resource scheduling device 60 are the same as the functions of the processor 701 in fig. 8.
Optionally, as shown in fig. 8, the resource scheduling apparatus provided in the embodiment of the present application may further include a communication interface 704.
A communication interface 704 for connecting with other devices through a communication network. The communication network may be an ethernet network, a radio access network, a Wireless Local Area Network (WLAN), etc. The communication interface 704 may include an acquisition unit for receiving data and a transmission unit for transmitting data.
In one design, in the resource scheduling apparatus provided in this embodiment of the present application, the communication interface may also be integrated in the processor.
Fig. 9 shows another hardware structure of the resource scheduling apparatus in the embodiment of the present application. As shown in fig. 9, the resource scheduling apparatus 80 may include a processor 801 and a communication interface 802. The processor 801 is coupled to a communication interface 802.
The functions of the processor 801 may refer to the description of the processor 701 above. The processor 801 also has a memory function, and the function of the memory 702 can be referred to.
The communication interface 802 is used to provide data to the processor 801. The communication interface 802 may be an internal interface of the resource scheduling apparatus, or an external interface (corresponding to the communication interface 704) of the resource scheduling apparatus.
It is noted that the structure shown in fig. 9 does not constitute a limitation of the resource scheduling apparatus, and the resource scheduling apparatus 80 may include more or less components than those shown in fig. 9, or combine some components, or a different arrangement of components, in addition to the components shown in fig. 9.
Through the above description of the embodiments, it is clear for a person skilled in the art that, for convenience and simplicity of description, only the division of the above functional units is illustrated. In practical applications, the above function allocation may be performed by different functional units according to requirements, that is, the internal structure of the device is divided into different functional units to perform all or part of the above described functions. For the specific working processes of the system, the apparatus and the unit described above, reference may be made to the corresponding processes in the foregoing method embodiments, and details are not described here again.
The embodiment of the present application further provides a computer-readable storage medium, where instructions are stored in the computer-readable storage medium, and when the instructions are executed by a computer, the computer executes each step in the method flow shown in the above method embodiment.
Embodiments of the present application provide a computer program product containing instructions which, when run on a computer, cause the computer to perform the method of resource scheduling in the above method embodiments.
The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, and a hard disk. Random Access Memory (RAM), read-Only Memory (ROM), erasable Programmable Read-Only Memory (EPROM), registers, a hard disk, an optical fiber, a portable Compact disk Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any other form of computer-readable storage medium, in any suitable combination, or as appropriate in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuit (ASIC). In embodiments of the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Since the apparatus, the device computer-readable storage medium, and the computer program product in the embodiments of the present application may be applied to the method described above, for technical effects that can be obtained by the apparatus, the apparatus computer-readable storage medium, and the computer program product, reference may also be made to the method embodiments described above, and details of the embodiments of the present application are not repeated herein.
The above description is only an embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions within the technical scope disclosed in the present application should be covered within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for scheduling resources, the method comprising:
responding to a scheduling request of computing power resources initiated by user equipment, and determining a plurality of target computing power nodes; the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request;
determining a scheduling strategy for scheduling computational resources according to the scheduling request, wherein the scheduling strategy comprises at least one sub-scheduling strategy, and the sub-scheduling strategy corresponds to a plurality of indexes;
under the condition that the scheduling strategy comprises a sub-scheduling strategy, determining a first target score of each target computing power node in the target computing power nodes according to a plurality of indexes corresponding to the sub-scheduling strategy;
determining a computational power node to be scheduled; the computing power node to be scheduled is a target computing power node with the largest first target score in the target computing power nodes, and the computing power node to be scheduled is used for providing computing power service for the user equipment.
2. The method according to claim 1, wherein the determining the first target score of each target computing power node of the plurality of target computing power nodes according to the plurality of indexes corresponding to the sub-scheduling policy comprises:
determining metric weights for the plurality of metrics in the scheduling request;
determining a plurality of index scores corresponding to each target force calculation node according to each index in the plurality of indexes;
and determining the first target score of each target force calculation node according to the index scores corresponding to the target force calculation nodes and the index weight.
3. The method according to claim 1 or 2, wherein in the case that the scheduling policy includes a plurality of sub-scheduling policies, the determining the computation power node to be scheduled includes:
determining a plurality of first target scores corresponding to each target calculation force node according to a plurality of indexes corresponding to each sub-scheduling strategy in the plurality of sub-scheduling strategies;
determining a second target score of each target computing force node according to the plurality of first target scores corresponding to each target computing force node;
and determining the computational power node to be dispatched, wherein the computational power node to be dispatched is the target computational power node with the largest second target score in the plurality of target computational power nodes.
4. The method according to claim 3, wherein the determining a second target score for each target computing force node according to the plurality of first target scores corresponding to each target computing force node comprises:
determining the strategy weight of the plurality of sub-scheduling strategies in the scheduling request;
and determining the second target score of each target computing force node according to the plurality of first target scores corresponding to each target computing force node and the strategy weight.
5. A resource scheduling device is characterized by comprising an acquisition unit and a determination unit;
the acquiring unit is used for acquiring a scheduling request of computing resources initiated by user equipment;
the determining unit is used for responding to the scheduling request and determining a plurality of target computing power nodes; the computing capacity of the target computing power node can meet the computing power requirement in the scheduling request;
the determining unit is further configured to determine a scheduling policy for scheduling computational resources according to the scheduling request, where the scheduling policy includes at least one sub-scheduling policy, and the sub-scheduling policy corresponds to multiple indexes;
the determining unit is further configured to determine, according to a plurality of indexes corresponding to the sub-scheduling policies, a first target score of each target computational power node in the plurality of target computational power nodes when the scheduling policy includes one sub-scheduling policy;
the determining unit is further configured to determine a computational power node to be scheduled; the computing power node to be scheduled is a target computing power node with the largest first target score in the target computing power nodes, and the computing power node to be scheduled is used for providing computing power service for the user equipment.
6. The resource scheduling apparatus according to claim 5, wherein the determining unit is specifically configured to determine an index weight of the plurality of indexes in the scheduling request;
determining a plurality of index scores corresponding to each target force calculation node according to each index in the plurality of indexes;
and determining the first target score of each target force calculation node according to the index scores corresponding to each target force calculation node and the index weight.
7. The apparatus according to claim 5 or 6, wherein the determining unit is further configured to determine, according to a plurality of indicators corresponding to each of the plurality of sub-scheduling policies, a plurality of the first target scores corresponding to each of the target compute power nodes;
determining a second target score of each target calculation force node according to the plurality of first target scores corresponding to each target calculation force node;
and determining the computational power node to be dispatched, wherein the computational power node to be dispatched is the target computational power node with the largest second target score in the plurality of target computational power nodes.
8. The apparatus according to claim 7, wherein the determining unit is specifically configured to determine the policy weights of the plurality of sub-scheduling policies in the scheduling request;
and determining the second target score of each target computing force node according to the plurality of first target scores corresponding to each target computing force node and the strategy weight.
9. A resource scheduling apparatus comprising a memory and a processor;
the memory and the processor are coupled;
the memory for storing computer program code, the computer program code comprising computer instructions;
the resource scheduling apparatus, when executing the computer instructions by the processor, performs the resource scheduling method according to any one of claims 1 to 4.
10. A computer-readable storage medium having instructions stored therein, which when run on a resource scheduling device, cause the resource scheduling device to perform the resource scheduling method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211466488.8A CN115766876A (en) | 2022-11-22 | 2022-11-22 | Resource scheduling method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211466488.8A CN115766876A (en) | 2022-11-22 | 2022-11-22 | Resource scheduling method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115766876A true CN115766876A (en) | 2023-03-07 |
Family
ID=85335347
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211466488.8A Pending CN115766876A (en) | 2022-11-22 | 2022-11-22 | Resource scheduling method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115766876A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116302568A (en) * | 2023-05-17 | 2023-06-23 | 算力互联(北京)科技有限公司 | Computing power resource scheduling method and system, scheduling center and data center |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9794136B1 (en) * | 2015-01-21 | 2017-10-17 | Pivotal Software, Inc. | Distributed resource allocation |
| CN109684065A (en) * | 2018-12-26 | 2019-04-26 | 北京云联万维技术有限公司 | A kind of resource regulating method, apparatus and system |
| CN113938442A (en) * | 2020-07-10 | 2022-01-14 | 中国移动通信有限公司研究院 | Configuration method, device and equipment of reserved resources and storage medium |
| CN114461382A (en) * | 2021-12-27 | 2022-05-10 | 天翼云科技有限公司 | Flexibly configurable computing power scheduling implementation method and device and storage medium |
| CN114756340A (en) * | 2022-03-17 | 2022-07-15 | 中国联合网络通信集团有限公司 | Computing power scheduling system, method, device and storage medium |
| CN114816738A (en) * | 2022-04-11 | 2022-07-29 | 中国联合网络通信集团有限公司 | Method, device and equipment for determining calculation force node and computer readable storage medium |
| CN115002117A (en) * | 2022-05-30 | 2022-09-02 | 中移（杭州）信息技术有限公司 | Content distribution network dynamic scheduling method, system, device and storage medium |
| CN115118784A (en) * | 2022-06-30 | 2022-09-27 | 中国电信股份有限公司 | Computing resource scheduling method, device and system |
| CN115292046A (en) * | 2022-08-10 | 2022-11-04 | 中国电信股份有限公司 | Calculation force distribution method and device, storage medium and electronic equipment |
| CN115328612A (en) * | 2022-07-26 | 2022-11-11 | 北京百度网讯科技有限公司 | Resource allocation method, device, equipment and storage medium |
-
2022
- 2022-11-22 CN CN202211466488.8A patent/CN115766876A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9794136B1 (en) * | 2015-01-21 | 2017-10-17 | Pivotal Software, Inc. | Distributed resource allocation |
| CN109684065A (en) * | 2018-12-26 | 2019-04-26 | 北京云联万维技术有限公司 | A kind of resource regulating method, apparatus and system |
| CN113938442A (en) * | 2020-07-10 | 2022-01-14 | 中国移动通信有限公司研究院 | Configuration method, device and equipment of reserved resources and storage medium |
| CN114461382A (en) * | 2021-12-27 | 2022-05-10 | 天翼云科技有限公司 | Flexibly configurable computing power scheduling implementation method and device and storage medium |
| CN114756340A (en) * | 2022-03-17 | 2022-07-15 | 中国联合网络通信集团有限公司 | Computing power scheduling system, method, device and storage medium |
| CN114816738A (en) * | 2022-04-11 | 2022-07-29 | 中国联合网络通信集团有限公司 | Method, device and equipment for determining calculation force node and computer readable storage medium |
| CN115002117A (en) * | 2022-05-30 | 2022-09-02 | 中移（杭州）信息技术有限公司 | Content distribution network dynamic scheduling method, system, device and storage medium |
| CN115118784A (en) * | 2022-06-30 | 2022-09-27 | 中国电信股份有限公司 | Computing resource scheduling method, device and system |
| CN115328612A (en) * | 2022-07-26 | 2022-11-11 | 北京百度网讯科技有限公司 | Resource allocation method, device, equipment and storage medium |
| CN115292046A (en) * | 2022-08-10 | 2022-11-04 | 中国电信股份有限公司 | Calculation force distribution method and device, storage medium and electronic equipment |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116302568A (en) * | 2023-05-17 | 2023-06-23 | 算力互联(北京)科技有限公司 | Computing power resource scheduling method and system, scheduling center and data center |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10574545B2 (en) | Techniques for analytics-driven hybrid concurrency control in clouds | |
| Zeng et al. | Joint optimization of task scheduling and image placement in fog computing supported software-defined embedded system | |
| US7856572B2 (en) | Information processing device, program thereof, modular type system operation management system, and component selection method | |
| CN109347947A (en) | A kind of method of load balancing, name server and cluster nas server | |
| CN109710405B (en) | Block chain intelligent contract management method and device, electronic equipment and storage medium | |
| CN109831524B (en) | Load balancing processing method and device | |
| AU2018100381A4 (en) | A physical resource scheduling method in cloud cluster | |
| CN110162388A (en) | A kind of method for scheduling task, system and terminal device | |
| CN109962855A (en) | A kind of current-limiting method of WEB server, current-limiting apparatus and terminal device | |
| CN105144109A (en) | Distributed data center technology | |
| CN112465359A (en) | Calculation power calling method and device | |
| Li et al. | Resource scheduling based on improved spectral clustering algorithm in edge computing | |
| JP2022554384A (en) | Network data analysis method, functional entity and electronic device | |
| CN108600344A (en) | A kind of network access request dispatching method, device and storage medium | |
| CN115766876A (en) | Resource scheduling method, device, equipment and storage medium | |
| CN114816738A (en) | Method, device and equipment for determining calculation force node and computer readable storage medium | |
| CN111324429B (en) | Micro-service combination scheduling method based on multi-generation ancestry reference distance | |
| CN109951540A (en) | A kind of data transmission method, device and electronic equipment | |
| CN116700929A (en) | Task batch processing method and system based on artificial intelligence | |
| CN114157583B (en) | Reliability-based network resource heuristic mapping method and system | |
| US10264061B2 (en) | User service access allocation method and system | |
| Li et al. | PAS: Performance‐Aware Job Scheduling for Big Data Processing Systems | |
| CN113076197A (en) | Load balancing method and device, storage medium and electronic equipment | |
| CN114266168A (en) | Load scheduling parameter optimization method for shared node | |
| Wen et al. | Load balancing consideration of both transmission and process responding time for multi-task assignment |
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 |