CN112433850A - Method, device and equipment for global scheduling of tasks and readable medium - Google Patents
Method, device and equipment for global scheduling of tasks and readable medium Download PDFInfo
- Publication number
- CN112433850A CN112433850A CN202011302992.5A CN202011302992A CN112433850A CN 112433850 A CN112433850 A CN 112433850A CN 202011302992 A CN202011302992 A CN 202011302992A CN 112433850 A CN112433850 A CN 112433850A
- Authority
- CN
- China
- Prior art keywords
- node
- resource
- resource application
- optimal scheduling
- application request
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000012545 processing Methods 0.000 claims abstract description 10
- 230000015654 memory Effects 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 5
- 230000007246 mechanism Effects 0.000 claims description 5
- 238000005457 optimization Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000010354 integration Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 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/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/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/5016—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 the resource being the memory
-
- 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/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
- G06F9/505—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 considering the load
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for global scheduling of tasks, which comprises the following steps: receiving a plurality of resource application requests; collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to each resource application request based on the resource use condition of each node; allocating a resource application request to each optimal scheduling node based on the state value of the resource application request at the corresponding optimal scheduling node, and returning the resource application requests which are not allocated to the optimal scheduling nodes to the previous step; and scheduling the distributed resource application request to the corresponding optimal scheduling node for processing. The invention also discloses a device for global task scheduling, computer equipment and a readable storage medium. The invention simultaneously measures a plurality of requests on the basis of global scheduling, realizes that each resource request can be matched with the most appropriate node, simultaneously realizes the optimization maximization of the global scheduling, is not limited to the optimal node pursuing one request, and realizes the ordered and efficient utilization of resources.
Description
Technical Field
The present invention relates to the field of task scheduling technologies, and in particular, to a method, an apparatus, a device, and a readable medium for task global scheduling.
Background
In the era of big data cloud computing, efficient computing has essentially determined data productivity. The most important point of computation is scheduling, distributed computation is very common at present, but problems are generated at the same time, namely how to efficiently schedule computation tasks to nodes for execution.
Inefficient scheduling often causes various problems, such as fragmentation of cluster resources, unbalanced node load, and the like, which seriously affects efficient operation of tasks. For example, a certain proportion of users still use heartbeat scheduling, a task resource request waits for a node to heartbeat, and then whether matching is satisfied, i.e. scheduling is satisfied, but the node is obviously not necessarily the optimal choice of the request.
The global scheduling just started greatly improves the defects brought by heartbeat scheduling, and the nodes meeting the requirements of the nodes are screened out firstly instead of passively waiting for the heartbeat of the nodes, so that the resource request selects the most suitable node to schedule. The method subverts the idea of heartbeat scheduling, so that the resource scheduling is more efficient. However, there is a problem that the node is the optimal node for the request, but more so, according to the global scheduling, the node is occupied by the first request, and the second request can only be returned to the second. If the second request occupies the node and the first request goes back to maximize the overall optimization, the global scheduling approach is somewhat inadequate.
Disclosure of Invention
In view of this, an object of the embodiments of the present invention is to provide a method, an apparatus, a device, and a readable medium for task global scheduling, which measure multiple requests simultaneously on the basis of global scheduling, implement that each resource request can be matched to the most appropriate node, implement global scheduling optimization maximization, are not limited to the optimal node that pursues one request, and implement ordered and efficient utilization of resources.
Based on the above object, an aspect of the embodiments of the present invention provides a method for task global scheduling, including the following steps performed at a maintenance device: receiving a plurality of resource application requests; collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to each resource application request based on the resource use condition of each node; allocating a resource application request to each optimal scheduling node based on the state value of the resource application request at the corresponding optimal scheduling node, and returning the resource application requests which are not allocated to the optimal scheduling nodes to the previous step; and scheduling the distributed resource application request to the corresponding optimal scheduling node for processing.
In some embodiments, receiving a number of resource application requests includes: and receiving resource application requests, and summarizing the received resource application requests at preset time intervals.
In some embodiments, collecting resource usage of each node comprises: and collecting the resource use condition of each node through a heartbeat mechanism, and updating the resource use condition of each node at preset time intervals.
In some embodiments, collecting resource usage of each node comprises: and collecting available memories and available CPUs (central processing units) of each node, wherein the available memories comprise idle memories and releasable memories, and the available CPUs comprise idle CPUs and releasable CPUs.
In some embodiments, allocating one resource application request to each optimal scheduling node based on the state value of the resource application request at the optimal scheduling node includes: if the optimal scheduling nodes corresponding to the resource application requests are the same in the resource application requests, acquiring state information of the resource application requests at the optimal scheduling nodes, and respectively calculating state values of the resource application requests at the optimal scheduling nodes based on the state information; and allocating the optimal scheduling node to the resource application request with the maximum state value.
In some embodiments, the method further comprises: and calculating to obtain a state value of the resource application request at the optimal scheduling node based on the state information of the resource application request at the optimal scheduling node, wherein the state information comprises data locality and/or load comparison.
In some embodiments, the returning the resource application request which is not allocated to the optimal scheduling node comprises: and re-collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to the resource application request which is not distributed to the optimal scheduling node based on the updated resource use condition.
In another aspect of the embodiments of the present invention, a device for global task scheduling is further provided, including: the receiving module is configured to receive a plurality of resource application requests; the first calculation module is configured to collect resource use conditions of each node, and respectively calculate an optimal scheduling node corresponding to each resource application request based on the resource use conditions of each node; the second computing module is configured to allocate a resource application request to each optimal scheduling node based on the state value of the resource application request at the corresponding optimal scheduling node, and return the resource application request which is not allocated to the optimal scheduling node to the first computing module; and the scheduling module is configured to schedule the allocated resource application request to the corresponding optimal scheduling node for processing.
In another aspect of the embodiments of the present invention, there is also provided a computer device, including: at least one processor; and a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method.
In a further aspect of the embodiments of the present invention, a computer-readable storage medium is also provided, in which a computer program for implementing the above method steps is stored when the computer program is executed by a processor.
The invention has the following beneficial technical effects: the method has the advantages that multiple requests are measured on the basis of global scheduling, each resource request can be matched with the most appropriate node, the global scheduling optimization maximization is realized, the resource requests are not limited to the optimal node pursuing one request, and the ordered and efficient utilization of resources is realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
FIG. 1 is a diagram illustrating an embodiment of a method for global scheduling of tasks according to the present invention;
FIG. 2 is a diagram illustrating an embodiment of an apparatus for global task scheduling according to the present invention;
FIG. 3 is a schematic diagram of an embodiment of a computer device provided by the present invention;
FIG. 4 is a schematic diagram of an embodiment of a computer-readable storage medium provided by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.
In view of the above, a first aspect of the embodiments of the present invention provides an embodiment of a method for global task scheduling. Fig. 1 is a schematic diagram illustrating an embodiment of a method for global task scheduling provided by the present invention. As shown in fig. 1, the embodiment of the present invention includes the following steps performed at the maintenance device side:
s01, receiving a plurality of resource application requests;
s02, collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to each resource application request based on the resource use condition of each node;
s03, allocating a resource application request to each optimal scheduling node based on the state value of the corresponding optimal scheduling node of the resource application request, and returning the resource application request which is not allocated to the optimal scheduling node to the previous step; and
and S04, scheduling the distributed resource application request to the corresponding optimal scheduling node for processing.
In this embodiment, the resource scheduling apparatus includes a resource application apparatus, a resource reporting apparatus, a resource integration apparatus, a resource scheduling apparatus, and an optimal computing apparatus. The resource reporting device continuously sends the resource use condition of the resource reporting device to the resource integration device through a heartbeat mechanism, for example, how much memory, cpu and the like are left or how much memory and cpu need to be released; a resource application device initiates a resource request to a resource scheduling device; the resource scheduling device sends a batch of resource requests to the optimal computing device at intervals; the optimal computing device receives a batch of resource requests and acquires the latest resource information of the nodes from the resource integration device; the optimal computing device sends the result after scheduling to the resource scheduling device; the resource scheduling device speaks the result and sends the result to the resource application device, and therefore task scheduling is completed.
In this embodiment, the optimal computing device first obtains each scheduling node with an optimal request; and carrying out dimension comparison, such as data local comparison, load comparison and the like on the coincident node request. Taking a comparative example of data locality, firstly, a yellow request and a green request arrive first according to the existing global scheduling, according to the characteristic of data locality, the optimal node is node2, at the moment, the green request arrives, and if the memory or cpu resources on node2 do not meet the green request, the green request can only be scheduled on node1, but the data processed by the green request are all on node2, a large amount of IO performance is inevitably consumed in the middle, so that the consumed time is increased, the optimal nodes of the green device and the yellow device are both node2, after passing through the optimal computing device, according to the comparison of data locality, the green request is scheduled to node2, and the yellow request is scheduled to node1, so that the overall scheduling is more harmonious; obtaining the scheduled sequence.
In some embodiments of the invention, receiving a number of resource application requests comprises: and receiving resource application requests, and summarizing the received resource application requests at preset time intervals.
In some embodiments of the invention, collecting resource usage by each node comprises: and collecting the resource use condition of each node through a heartbeat mechanism, and updating the resource use condition of each node at preset time intervals.
In this embodiment, the heartbeat mechanism is to wait for the node to heartbeat, and then compare the resource requests in sequence to perform the allocation in accordance with the resource requests.
In some embodiments of the invention, collecting resource usage by each node comprises: and collecting available memories and available CPUs (central processing units) of each node, wherein the available memories comprise idle memories and releasable memories, and the available CPUs comprise idle CPUs and releasable CPUs.
In some embodiments of the present invention, allocating a resource application request to each optimal scheduling node based on the state value of the resource application request at the optimal scheduling node comprises: if the optimal scheduling nodes corresponding to the resource application requests are the same in the resource application requests, acquiring state information of the resource application requests at the optimal scheduling nodes, and respectively calculating state values of the resource application requests at the optimal scheduling nodes based on the state information; and allocating the optimal scheduling node to the resource application request with the maximum state value.
In some embodiments of the invention, the method further comprises: and calculating to obtain a state value of the resource application request at the optimal scheduling node based on the state information of the resource application request at the optimal scheduling node, wherein the state information comprises data locality and/or load comparison.
In some embodiments of the present invention, returning the resource application request that is not allocated to the optimal scheduling node to the previous step includes: and re-collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to the resource application request which is not distributed to the optimal scheduling node based on the updated resource use condition.
It should be particularly noted that, the steps in the embodiments of the method for task global scheduling described above may be intersected, replaced, added, or deleted, and therefore, these methods for task global scheduling transformed by reasonable permutation and combination should also belong to the scope of the present invention, and should not limit the scope of the present invention to the embodiments.
In view of the above object, a second aspect of the embodiments of the present invention provides an apparatus for global task scheduling. Fig. 2 is a schematic diagram illustrating an embodiment of an apparatus for global task scheduling provided by the present invention. As shown in fig. 2, the embodiment of the present invention includes the following modules: a receiving module S11 configured to receive a plurality of resource application requests; the first calculation module S12 is configured to collect resource usage of each node, and calculate an optimal scheduling node corresponding to each resource application request based on the resource usage of each node; the second calculation module S13, configured to allocate a resource application request to each optimal scheduling node based on the state value of the resource application request at the corresponding optimal scheduling node, and return the resource application request that is not allocated to the optimal scheduling node to the first calculation module; and a scheduling module S14 configured to schedule the allocated resource application request to the corresponding optimal scheduling node for processing.
In view of the above object, a third aspect of the embodiments of the present invention provides a computer device. Fig. 3 is a schematic diagram of an embodiment of a computer device provided by the present invention. As shown in fig. 3, an embodiment of the present invention includes the following means: at least one processor S21; and a memory S22, the memory S22 storing computer instructions S23 executable on the processor, the instructions when executed by the processor implementing the steps of the above method.
The invention also provides a computer readable storage medium. FIG. 4 is a schematic diagram illustrating an embodiment of a computer-readable storage medium provided by the present invention. As shown in fig. 4, the computer readable storage medium stores S31 a computer program that, when executed by a processor, performs the method as described above S32.
Finally, it should be noted that, as one of ordinary skill in the art can appreciate that all or part of the processes of the methods of the above embodiments can be implemented by a computer program to instruct related hardware to implement the methods of global task scheduling, where the program can be stored in a computer-readable storage medium, and when executed, the program can include the processes of the embodiments of the methods as described above. The storage medium of the program may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like. The embodiments of the computer program may achieve the same or similar effects as any of the above-described method embodiments.
Furthermore, the methods disclosed according to embodiments of the present invention may also be implemented as a computer program executed by a processor, which may be stored in a computer-readable storage medium. Which when executed by a processor performs the above-described functions defined in the methods disclosed in embodiments of the invention.
Further, the above method steps and system elements may also be implemented using a controller and a computer readable storage medium for storing a computer program for causing the controller to implement the functions of the above steps or elements.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. 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 disclosed embodiments of the present invention.
In one or more exemplary designs, the functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, 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 general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes Compact Disc (CD), laser disc, optical disc, Digital Versatile Disc (DVD), floppy disk, blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (10)
1. A method for global scheduling of tasks, comprising the steps of:
receiving a plurality of resource application requests;
collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to each resource application request based on the resource use condition of each node;
allocating a resource application request to each optimal scheduling node based on the state value of the resource application request at the corresponding optimal scheduling node, and returning the resource application request which is not allocated to the optimal scheduling node to the previous step; and
and scheduling the distributed resource application request to the corresponding optimal scheduling node for processing.
2. The method of claim 1, wherein receiving a plurality of resource application requests comprises:
receiving a resource application request, and summarizing the received resource application request at preset time intervals.
3. The method of global task scheduling according to claim 1, wherein collecting resource usage of each node comprises:
and collecting the resource use condition of each node through a heartbeat mechanism, and updating the resource use condition of each node at preset time intervals.
4. The method of global task scheduling according to claim 1, wherein collecting resource usage of each node comprises:
and collecting available memories and available CPUs (central processing units) of each node, wherein the available memories comprise idle memories and releasable memories, and the available CPUs comprise idle CPUs and releasable CPUs.
5. The method according to claim 1, wherein allocating one resource application request to each optimal scheduling node based on the state values of the resource application requests at the optimal scheduling nodes comprises:
if the optimal scheduling nodes corresponding to a plurality of resource application requests are the same in the plurality of resource application requests, acquiring the state information of the plurality of resource application requests at the optimal scheduling nodes, and respectively calculating the state values of the plurality of resource application requests at the optimal scheduling nodes based on the state information;
and allocating the optimal scheduling node to the resource application request with the maximum state value.
6. The method for global task scheduling according to claim 1, further comprising:
and calculating the state value of the resource application request at the optimal scheduling node based on the state information of the resource application request at the optimal scheduling node, wherein the state information comprises data locality and/or load comparison.
7. The method of claim 1, wherein the step of returning the resource application request not allocated to the optimal scheduling node comprises:
and re-collecting the resource use condition of each node, and respectively calculating the optimal scheduling node corresponding to the resource application request which is not distributed to the optimal scheduling node based on the updated resource use condition.
8. An apparatus for global scheduling of tasks, comprising:
the receiving module is configured to receive a plurality of resource application requests;
the first calculation module is configured to collect resource use conditions of each node, and calculate an optimal scheduling node corresponding to each resource application request based on the resource use conditions of each node;
the second computing module is configured to allocate one resource application request to each optimal scheduling node based on the state value of the resource application request at the corresponding optimal scheduling node, and return the resource application request which is not allocated to the optimal scheduling node to the first computing module; and
and the scheduling module is configured to schedule the allocated resource application request to the corresponding optimal scheduling node for processing.
9. A computer device, comprising:
at least one processor; and
a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of any of the methods 1-7.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011302992.5A CN112433850A (en) | 2020-11-19 | 2020-11-19 | Method, device and equipment for global scheduling of tasks and readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011302992.5A CN112433850A (en) | 2020-11-19 | 2020-11-19 | Method, device and equipment for global scheduling of tasks and readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112433850A true CN112433850A (en) | 2021-03-02 |
Family
ID=74694498
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011302992.5A Withdrawn CN112433850A (en) | 2020-11-19 | 2020-11-19 | Method, device and equipment for global scheduling of tasks and readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112433850A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113992758A (en) * | 2021-12-27 | 2022-01-28 | 杭州金线连科技有限公司 | Dynamic scheduling method and device for system data resources and electronic equipment |
| CN114237892A (en) * | 2021-12-17 | 2022-03-25 | 北京达佳互联信息技术有限公司 | Key value data processing method and device, electronic equipment and storage medium |
| CN114237891A (en) * | 2021-12-17 | 2022-03-25 | 北京达佳互联信息技术有限公司 | Resource scheduling method and device, electronic equipment and storage medium |
-
2020
- 2020-11-19 CN CN202011302992.5A patent/CN112433850A/en not_active Withdrawn
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114237892A (en) * | 2021-12-17 | 2022-03-25 | 北京达佳互联信息技术有限公司 | Key value data processing method and device, electronic equipment and storage medium |
| CN114237891A (en) * | 2021-12-17 | 2022-03-25 | 北京达佳互联信息技术有限公司 | Resource scheduling method and device, electronic equipment and storage medium |
| CN113992758A (en) * | 2021-12-27 | 2022-01-28 | 杭州金线连科技有限公司 | Dynamic scheduling method and device for system data resources and electronic equipment |
| CN113992758B (en) * | 2021-12-27 | 2022-04-19 | 杭州金线连科技有限公司 | Dynamic scheduling method and device for system data resources and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107545338B (en) | Service data processing method and service data processing system | |
| CN112433850A (en) | Method, device and equipment for global scheduling of tasks and readable medium | |
| CN104052803A (en) | Decentralized distributed rendering method and system | |
| US9888065B2 (en) | Defragmenting clusters with reserved resources | |
| CN112053105B (en) | Method and device for dividing service area | |
| Chen et al. | Latency minimization for mobile edge computing networks | |
| CN109196807B (en) | Network node and method of operating a network node for resource distribution | |
| CN106302640A (en) | Data request processing method and device | |
| CN103414657A (en) | Cross-data-center resource scheduling method, super scheduling center and system | |
| US9164800B2 (en) | Optimizing latencies in cloud systems by intelligent compute node placement | |
| US8832215B2 (en) | Load-balancing in replication engine of directory server | |
| CN105450784B (en) | The device and method of message distribution consumption node into MQ | |
| CN110650209A (en) | Method and device for realizing load balance | |
| CN106331160A (en) | Data migration method and system | |
| CN115129463A (en) | Computing power scheduling method, device, system and storage medium | |
| JP2023545985A (en) | Managing task flows in edge computing environments | |
| CN114546493A (en) | Core sharing method and device, processing core, electronic device and medium | |
| CN114466031A (en) | CDN system node configuration method, device, equipment and storage medium | |
| CN113535673B (en) | Method and device for generating configuration file and data processing | |
| CN112561301A (en) | Work order distribution method, device, equipment and computer readable medium | |
| CN111694670A (en) | Resource allocation method, device, equipment and computer readable medium | |
| CN112988738A (en) | Data slicing method and device for block chain | |
| CN114756173A (en) | Method, system, device and computer readable medium for file merging | |
| CN112616143A (en) | Method and device for distributing communication number, electronic equipment and storage medium | |
| CN116436978B (en) | Cloud computing-oriented memory allocation method, memory acquisition method, device and equipment |
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 | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20210302 |