CN113821326A - Job scheduling method and device, electronic equipment and storage medium - Google Patents
Job scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113821326A CN113821326A CN202111123656.9A CN202111123656A CN113821326A CN 113821326 A CN113821326 A CN 113821326A CN 202111123656 A CN202111123656 A CN 202111123656A CN 113821326 A CN113821326 A CN 113821326A
- Authority
- CN
- China
- Prior art keywords
- subtask
- information
- subtasks
- condition
- task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Abstract
The application provides a job scheduling method, a job scheduling device, an electronic device and a storage medium, wherein the method is applied to each scheduler of a plurality of schedulers in a scheduling system, and comprises the following steps: acquiring subtask information in job information, wherein the subtask information comprises subtasks and corresponding dependence conditions, the dependence conditions represent pre-tasks on which the subtasks depend for execution, the job information comprises a plurality of subtask information, and the subtask information acquired by different schedulers is different; judging whether the obtained dependent conditions corresponding to the subtasks are finished or not; and if the dependency condition is completed, executing the acquired subtasks.
Description
Technical Field
The present application relates to the field of job scheduling technologies, and in particular, to a job scheduling method, an apparatus, an electronic device, and a storage medium.
Background
Currently, scheduling systems are based on scheduling among jobs, that is, a job is scheduled by a scheduler, where the job has a plurality of subtasks, each subtask has a corresponding dependency relationship, and the scheduler will execute the plurality of subtasks in sequence according to the dependency relationship among the plurality of subtasks.
However, in the above scheduling method, when the pre-task that a certain subtask in a job depends on is not executed completely, the scheduler places the job and then schedules other jobs, and when the placed job is scheduled again, the scheduler reads the completion status of all subtasks again and then sequentially determines the dependency relationship among the plurality of subtasks of the job again.
For example, as shown in fig. 1, when the scheduler executes task 6, it finds that task 2 has been executed and completed, but task 3 has not yet been executed and completed, at this time, the scheduler places job task1 to schedule other jobs, and when job task1 is scheduled again, the scheduler repeatedly reads the completion status of all subtasks and determines the dependency relationship among the plurality of subtasks of the job again, for example, reads the completion statuses of subtasks 1 to 8, and then reselects and determines whether the dependency relationship between task 2 and task 3 is completed, and then scans whether task 2 and task 3 that task 6 depends on are completed.
Disclosure of Invention
An object of the embodiments of the present application is to provide a job scheduling method, an apparatus, an electronic device, and a storage medium, so as to solve the problems of low fine granularity of job scheduling and low concurrency of task execution in the current scheduling manner.
In a first aspect, the present invention provides a job scheduling method, applied to each scheduler of a plurality of schedulers in a scheduling system, the method comprising: acquiring subtask information in job information, wherein the subtask information comprises subtasks and corresponding dependency conditions, the dependency conditions represent pre-tasks on which the subtasks depend for execution, the job information comprises a plurality of subtask information, and the subtask information acquired by different schedulers is different; judging whether the obtained dependent conditions corresponding to the subtasks are finished or not; and if the dependency condition is completed, executing the acquired subtasks.
In the job scheduling method designed above, the job information in this scheme is split into multiple pieces of sub-task information, then each scheduler in the scheduling system acquires one piece of subtask information, so that each scheduler judges the dependence condition in the subtask information acquired by itself, in case that the dependency condition is satisfied, the scheduler executes the subtask in the obtained subtask information, because each scheduler only needs to judge the dependence condition of the obtained subtask information, specifically only needs to read and judge the completion condition of the preposed task of the subtask in charge of the scheduler, without repeatedly scanning the execution state of the sub-task that has been previously completed as in the conventional manner, the scheduling method designed by the scheme of the application has the advantages that the scheduling of the job information is finer in granularity and higher in scheduling efficiency, and meanwhile, the scheduling concurrency is enhanced.
In an optional implementation manner of the first aspect, the determining whether the obtained dependency condition corresponding to the subtask is completed includes: reading the completion condition of a front task in the dependency condition according to the dependency condition corresponding to the subtask; and judging whether the acquired dependent conditions corresponding to the subtasks are finished or not according to the finishing condition of the front task in the dependent conditions.
In the embodiment designed above, the scheme only reads the completion condition of the pre-task in the dependency condition of the subtask in charge of the scheme, and then judges whether the dependency condition is completed, without rescanning the already-executed task like the existing scheme, thereby improving the scheduling efficiency.
In an optional implementation manner of the first aspect, each of the plurality of schedulers is assigned with an identifier of subtask information, and the obtaining one of the job information includes: and reading corresponding subtask information from the job information according to the identifier corresponding to the distributed subtask information.
In an optional implementation manner of the first aspect, the obtaining of one subtask information in the job information includes: when the read is turned to, one piece of subtask information which is not read by other schedulers is randomly read from the job information.
In an optional implementation manner of the first aspect, the dependency condition corresponding to the sub-task includes a single pre-task or multiple pre-tasks or 0 pre-tasks on which the sub-task executes.
In an optional implementation manner of the first aspect, the determining whether the obtained dependency condition corresponding to the subtask is completed includes: judging whether the number of the preposed tasks in the dependence condition of the subtasks is 0 or not; and if so, determining that the dependent condition is completed to execute the acquired subtasks.
In a second aspect, the present invention provides a job scheduling apparatus, which is applied to each scheduler of a plurality of schedulers in a scheduling system, the apparatus comprising:
the task scheduling system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is used for acquiring subtask information in job information, the subtask information comprises subtasks and corresponding dependence conditions, the dependence conditions represent pre-tasks on which the subtasks depend for execution, the job information comprises a plurality of subtask information, and the subtask information acquired by different schedulers is different; the judging module is used for judging whether the acquired dependent conditions corresponding to the subtasks are finished or not; and the execution module is used for executing the acquired subtasks under the condition that the dependent condition is completed.
In the job scheduling device designed above, the job information is split into a plurality of sub-task information, then each scheduler in the scheduling system acquires one piece of subtask information, so that each scheduler judges the dependence condition in the subtask information acquired by itself, in case that the dependency condition is satisfied, the scheduler executes the subtask in the obtained subtask information, because each scheduler only needs to judge the dependence condition of the obtained subtask information, specifically only needs to read and judge the completion condition of the preposed task of the subtask in charge of the scheduler, without repeatedly scanning the execution state of the sub-task that has been previously completed as in the conventional manner, the scheduling method designed by the scheme of the application has the advantages that the scheduling of the job information is finer in granularity and higher in scheduling efficiency, and meanwhile, the scheduling concurrency is enhanced.
In an optional implementation manner of the second aspect, the determining module is specifically configured to read, according to a dependency condition corresponding to the subtask, a completion condition of a pre-task in the dependency condition; and judging whether the acquired dependent conditions corresponding to the subtasks are finished or not according to the finishing condition of the front task in the dependent conditions.
In an optional implementation manner of the second aspect, each of the plurality of schedulers is assigned with an identifier of subtask information, and the obtaining module is specifically configured to read corresponding subtask information from the job information according to the identifier corresponding to the assigned subtask information.
In an optional implementation manner of the second aspect, the plurality of pieces of subtask information are sequentially read by the plurality of schedulers according to a preset reading order, and the obtaining module is further specifically configured to randomly read one piece of subtask information that is not read by another scheduler from the job information when the obtaining module is in turn to read itself.
In a third aspect, the present application provides an electronic device, including a memory and a processor, where the memory stores a computer program, and the processor executes the computer program to perform the method in the first aspect or any optional implementation manner of the first aspect.
In a fourth aspect, the present application provides a storage medium having stored thereon a computer program which, when executed by a processor, performs the method of the first aspect, any of the alternative implementations of the first aspect.
In a fifth aspect, the present application provides a computer program product, which when run on a computer, causes the computer to perform the method of the first aspect, any optional implementation manner of the first aspect.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments of the present application will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and that those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.
FIG. 1 is a diagram illustrating example job information provided in an embodiment of the present application;
fig. 2 is a first flowchart of a job scheduling method according to an embodiment of the present application;
FIG. 3 is an exemplary diagram of a scheduling system for scheduling job information according to an embodiment of the present application;
fig. 4 is a second flowchart of a job scheduling method according to an embodiment of the present application;
fig. 5 is a third flow diagram of a job scheduling method according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a job scheduling apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Icon: 600-an acquisition module; 610-a judgment module; 620-an execution module; 7-an electronic device; 701-a processor; 702-a memory; 703-communication bus.
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.
An embodiment of the present application provides a job scheduling method, which is applied to each scheduler of a plurality of schedulers in a scheduling system, and as shown in fig. 2, the method may include the following steps:
step S200: and acquiring one piece of subtask information in the job information.
Step S210: and judging whether the acquired dependency condition corresponding to the subtask is completed, if so, turning to step S120.
Step S220: and executing the acquired subtasks.
In step S200, the job information includes a plurality of subtask information, each subtask information includes a subtask and a corresponding dependency condition, the dependency condition indicates a pre-task on which the subtask is executed, that is, the dependency condition indicates that the subtask can be executed only after the condition that the execution of the dependent pre-task is completed is satisfied, where the pre-task in the dependency condition may be single, multiple, or 0, and the 0 pre-task may consider that the subtask has no dependency condition.
For example, the subtask information 1 includes the subtask 1 in fig. 1 and the dependency condition of the subtask 1 (the subtask 1 has no pre-task), and the subtask information 2 includes the subtask 2 and the subtask 2 dependency condition in fig. 1, where the dependency condition of the subtask 2 is the task1, that is, the subtask 2 can be executed only after the execution of the subtask 1 is completed.
Similarly, the subtask information 3 includes the dependent conditions of the subtask 3 and the subtask 3 in fig. 1, and the dependent condition of the subtask 3 is the subtask 1 and the subtask 5, that is, the subtask 3 can only be executed after the respective execution of the subtask 1 and the subtask 5 is completed.
The subtask information 4 contains the subtask 4 and the dependency condition of the subtask 4 in fig. 1, and the dependency condition of the subtask information 4 is the subtask 6 and the subtask 8.
The subtask information 5 contains the subtask 5 and the dependency condition of the subtask 5 in fig. 1, and the subtask 5 has no dependency condition.
The subtask information 6 contains the subtask 6 and the dependency condition of the subtask 6 in fig. 1, and the dependency condition of the subtask 6 is the subtask 2 and the subtask 3.
The subtask information 7 contains the subtask 7 and the dependency condition of the subtask 7 in fig. 1, and the dependency condition of the subtask 7 is the subtask 5.
The subtask information 8 contains the subtask 8 and the dependency condition of the subtask 8 in fig. 1, and the dependency condition of the subtask 8 is the subtask 7.
In step S200, each scheduler in the scheduling system may serve as an execution subject of the method, and each scheduler in the scheduling system acquires one piece of sub-task information in the job information, and the sub-task information acquired by different schedulers is different.
For example, taking the job information shown in fig. 3 as an example, if the job information includes 8 pieces of sub-task information, there may be 8 schedulers, and each scheduler acquires one piece of sub-task information, for example, scheduler a acquires sub-task information 1, scheduler B acquires sub-task information 2, scheduler C acquires sub-task information 3, scheduler D acquires sub-task information 4, scheduler E acquires sub-task information 5, scheduler F acquires sub-task information 6, scheduler G acquires sub-task information 7, and scheduler H acquires sub-task information 8.
As a possible implementation, the scheduler acquiring one subtask information in the job information may include the following steps, as shown in fig. 4:
step S400: and reading corresponding subtask information from the job information according to the identifier corresponding to the distributed subtask information.
In the above embodiment, the scheduler is allocated with an identifier corresponding to the subtask information in advance, for example, the subtask information 1 corresponds to the identifier a, the identifier a is allocated or stored in the scheduler a in advance, and when the scheduler a acquires the subtask information, the scheduler a may find the subtask information 1 in the job information according to the identifier a, so as to obtain the dependency conditions of the subtask 1 and the subtask 1.
As another possible implementation, when the scheduler turns to read itself, it randomly reads a piece of subtask information that is not read by other schedulers from the job information to obtain one piece of subtask information in the job information.
For example, according to the foregoing example, if it is assumed that, when the scheduler C is in turn reading, the subtask information 1 in the job information is already read by the scheduler a, and the subtask information 5 is already read by the scheduler B, then when the scheduler C reads, one subtask information that is not read by the other schedulers in the job information is read: that is, one piece of subtask information is randomly read from the subtask information 2, the subtask information 3, the subtask information 4, the subtask information 6, the subtask information 7, and the subtask information 8.
The scheduler is made available to one of the job information in the foregoing manner, thereby performing step S210.
In step S210, the scheduler determines whether the dependency condition corresponding to the subtask in the acquired subtask information is completed, that is, whether the pre-task corresponding to the subtask is completed.
As a possible implementation, as shown in fig. 5, step S210 can also be implemented as follows:
step S500: reading the completion condition of a front task in a dependency condition according to the dependency condition corresponding to the subtask;
step S510: and judging whether the acquired dependent conditions corresponding to the subtasks are finished or not according to the finishing condition of the front task in the dependent conditions.
In the above embodiment, after obtaining the subtask information, the scheduler may obtain the dependency condition corresponding to the subtask in the subtask information, so as to obtain the pre-task of the subtask, and then the scheduler only needs to read and determine whether the pre-task of the subtask is completed, without reading the states of all subtasks, and when the pre-task of the subtask is completed, it is determined that the dependency condition corresponding to the subtask is completed, and then step S120 is performed to execute the subtask in the subtask information.
For example, according to the foregoing example, after the device B obtains the subtask information 2, it can be known that the dependency condition of the subtask 2 is the pre-task 1, at this time, the device B only needs to read the completion condition of the subtask 1, and when the subtask 1 has not been executed, it indicates that the dependency condition of the subtask 2 is not satisfied; when the execution of the subtask 1 is completed, it indicates that the dependency condition of the subtask 2 is satisfied, and the subtask 2 is executed.
In the job scheduling method designed above, the job information in this scheme is split into multiple pieces of sub-task information, then each scheduler in the scheduling system acquires one piece of subtask information, so that each scheduler judges the dependence condition in the subtask information acquired by itself, in case that the dependency condition is satisfied, the scheduler executes the subtask in the obtained subtask information, because each scheduler only needs to judge the dependence condition of the obtained subtask information, specifically only needs to read and judge the completion condition of the preposed task of the subtask in charge of the scheduler, without repeatedly scanning the execution state of the sub-task that has been previously completed as in the conventional manner, the scheduling method designed by the scheme of the application has the advantages that the scheduling of the job information is finer in granularity and higher in scheduling efficiency, and meanwhile, the scheduling concurrency is enhanced.
In an optional implementation manner of this embodiment, the aforementioned descriptions may include that the number of the pre-tasks in the dependency condition corresponding to the sub-task is single, multiple, and 0, on this basis, it is determined in step S110 whether the dependency condition corresponding to the sub-task is completed, and it may further include determining whether the number of the pre-tasks in the dependency condition of the sub-task is 0, and if the number is 0, directly executing the sub-task whose number is 0.
Fig. 6 shows a schematic block diagram of a job scheduling apparatus provided by the present application, and it should be understood that the apparatus corresponds to the method embodiments executed in fig. 2 to 5, and can execute the steps related to the foregoing method, and the specific functions of the apparatus can be referred to the description above, and a detailed description is appropriately omitted here to avoid redundancy. The device includes at least one software function that can be stored in memory in the form of software or firmware (firmware) or solidified in the Operating System (OS) of the device. Specifically, the apparatus includes: an obtaining module 600, configured to obtain subtask information in job information, where the subtask information includes a subtask and a corresponding dependency condition, where the dependency condition indicates a pre-task on which the subtask is dependent for execution, and the job information includes a plurality of subtask information, where subtask information obtained by different schedulers is different; the judging module 610 is configured to judge whether the obtained dependency condition corresponding to the sub-task is completed; and an executing module 620, configured to execute the acquired subtask when the dependent condition is completed.
In the job scheduling device designed above, the job information is split into a plurality of sub-task information, then each scheduler in the scheduling system acquires one piece of subtask information, so that each scheduler judges the dependence condition in the subtask information acquired by itself, in case that the dependency condition is satisfied, the scheduler executes the subtask in the obtained subtask information, because each scheduler only needs to judge the dependence condition of the obtained subtask information, specifically only needs to read and judge the completion condition of the preposed task of the subtask in charge of the scheduler, without repeatedly scanning the execution state of the sub-task that has been previously completed as in the conventional manner, the scheduling method designed by the scheme of the application has the advantages that the scheduling of the job information is finer in granularity and higher in scheduling efficiency, and meanwhile, the scheduling concurrency is enhanced.
In an optional implementation manner of this embodiment, the determining module 610 is specifically configured to read a completion condition of a pre-task in a dependency condition according to the dependency condition corresponding to the sub-task; and judging whether the acquired dependent conditions corresponding to the subtasks are finished or not according to the finishing condition of the front task in the dependent conditions.
In an optional implementation manner of this embodiment, each scheduler in the multiple schedulers is assigned with an identifier of one piece of subtask information, and the obtaining module 600 is specifically configured to read corresponding subtask information from the job information according to the identifier corresponding to the assigned subtask information.
In an optional implementation manner of this embodiment, the plurality of pieces of subtask information are sequentially read by the plurality of schedulers according to a preset reading order, and the obtaining module 600 is further specifically configured to randomly read one piece of subtask information that is not read by another scheduler from the job information when the reading is in turn.
It should be clear that the present application provides a job scheduling apparatus (shown in fig. 6) that can be used to perform the job scheduling method described in the first aspect of the present application, and can also be used to perform other job scheduling methods without departing from the scope of the present invention.
As shown in fig. 7, the present application provides an electronic device 7 including: the processor 701 and the memory 702, the processor 701 and the memory 702 being interconnected and communicating with each other via a communication bus 703 and/or other form of connection mechanism (not shown), the memory 702 storing a computer program executable by the processor 701, the processor 701 executing the computer program when the computing device is running to perform the method in any alternative implementation, such as steps S200 to S220: acquiring subtask information in the operation information; and judging whether the dependency condition corresponding to the acquired subtask is completed, if so, executing the acquired subtask.
The present application provides a storage medium having stored thereon a computer program which, when executed by a processor, performs the method of any of the preceding alternative implementations.
The storage medium may be implemented by any type of volatile or nonvolatile storage device or combination thereof, such as a Static Random Access Memory (SRAM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), an Erasable Programmable Read-Only Memory (EPROM), a Programmable Read-Only Memory (PROM), a Read-Only Memory (ROM), a magnetic Memory, a flash Memory, a magnetic disk, or an optical disk.
The present application provides a computer program product which, when run on a computer, causes the computer to perform the method of any of the alternative implementations.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
In addition, units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
Furthermore, the functional modules in the embodiments of the present application may be integrated together to form an independent part, or each module may exist separately, or two or more modules may be integrated to form an independent part.
It should be noted that the functions, if implemented in the form of software functional modules and sold or used as independent products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
In this document, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. A method for scheduling jobs, the method being applied to each scheduler of a plurality of schedulers in a scheduling system, the method comprising:
acquiring subtask information in job information, wherein the subtask information comprises subtasks and corresponding dependency conditions, the dependency conditions represent pre-tasks on which the subtasks depend for execution, the job information comprises a plurality of subtask information, and the subtask information acquired by different schedulers is different;
judging whether the obtained dependent conditions corresponding to the subtasks are finished or not;
and if the dependency condition is completed, executing the acquired subtasks.
2. The method according to claim 1, wherein the determining whether the dependency condition corresponding to the obtained subtask is completed includes:
reading the completion condition of a front task in the dependency condition according to the dependency condition corresponding to the subtask;
and judging whether the acquired dependent conditions corresponding to the subtasks are finished or not according to the finishing condition of the front task in the dependent conditions.
3. The method of claim 1, wherein each of the plurality of schedulers is assigned an identification of one of the subtask information, and wherein obtaining one of the job information comprises:
and reading corresponding subtask information from the job information according to the identifier corresponding to the distributed subtask information.
4. The method according to claim 1, wherein the obtaining of one subtask information in the job information includes:
when the read is turned to, one piece of subtask information which is not read by other schedulers is randomly read from the job information.
5. The method of claim 1, wherein the dependency conditions corresponding to the subtasks include a single pre-task or multiple pre-tasks or 0 pre-tasks on which the subtasks depend for execution.
6. The method according to claim 5, wherein the determining whether the dependency condition corresponding to the obtained subtask is completed includes:
judging whether the number of the preposed tasks in the dependence condition of the subtasks is 0 or not;
and if so, determining that the dependent condition is completed to execute the acquired subtasks.
7. An apparatus for scheduling jobs, the apparatus being applied to each scheduler of a plurality of schedulers in a scheduling system, the apparatus comprising:
the task scheduling system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is used for acquiring subtask information in job information, the subtask information comprises subtasks and corresponding dependence conditions, the dependence conditions represent pre-tasks on which the subtasks depend for execution, the job information comprises a plurality of subtask information, and the subtask information acquired by different schedulers is different;
the judging module is used for judging whether the acquired dependent conditions corresponding to the subtasks are finished or not;
and the execution module is used for executing the acquired subtasks under the condition that the dependent condition is completed.
8. The apparatus according to claim 7, wherein the determining module is specifically configured to read, according to a dependency condition corresponding to the subtask, a completion condition of a pre-task in the dependency condition; and judging whether the acquired dependent conditions corresponding to the subtasks are finished or not according to the finishing condition of the front task in the dependent conditions.
9. An electronic device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the method of any of claims 1 to 6 when executing the computer program.
10. A storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111123656.9A CN113821326A (en) | 2021-09-24 | 2021-09-24 | Job scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111123656.9A CN113821326A (en) | 2021-09-24 | 2021-09-24 | Job scheduling method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113821326A true CN113821326A (en) | 2021-12-21 |
Family
ID=78915410
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111123656.9A Pending CN113821326A (en) | 2021-09-24 | 2021-09-24 | Job scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113821326A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103034554A (en) * | 2012-12-30 | 2013-04-10 | 焦点科技股份有限公司 | ETL (Extraction-Transformation-Loading) dispatching system and method for error-correction restarting and automatic-judgment starting |
| CN106371918A (en) * | 2016-08-23 | 2017-02-01 | 北京云纵信息技术有限公司 | Task cluster scheduling management method and apparatus |
| CN108287756A (en) * | 2018-01-25 | 2018-07-17 | 联动优势科技有限公司 | A kind of method and device of processing task |
| CN110471754A (en) * | 2019-08-22 | 2019-11-19 | 中国工商银行股份有限公司 | Method for exhibiting data, device, equipment and storage medium in job scheduling |
| CN111858010A (en) * | 2020-07-30 | 2020-10-30 | 中国工商银行股份有限公司 | Batch data processing method and device |
| CN113010280A (en) * | 2021-02-19 | 2021-06-22 | 北京字节跳动网络技术有限公司 | Distributed task processing method, system, device, equipment and medium |
-
2021
- 2021-09-24 CN CN202111123656.9A patent/CN113821326A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103034554A (en) * | 2012-12-30 | 2013-04-10 | 焦点科技股份有限公司 | ETL (Extraction-Transformation-Loading) dispatching system and method for error-correction restarting and automatic-judgment starting |
| CN106371918A (en) * | 2016-08-23 | 2017-02-01 | 北京云纵信息技术有限公司 | Task cluster scheduling management method and apparatus |
| CN108287756A (en) * | 2018-01-25 | 2018-07-17 | 联动优势科技有限公司 | A kind of method and device of processing task |
| CN110471754A (en) * | 2019-08-22 | 2019-11-19 | 中国工商银行股份有限公司 | Method for exhibiting data, device, equipment and storage medium in job scheduling |
| CN111858010A (en) * | 2020-07-30 | 2020-10-30 | 中国工商银行股份有限公司 | Batch data processing method and device |
| CN113010280A (en) * | 2021-02-19 | 2021-06-22 | 北京字节跳动网络技术有限公司 | Distributed task processing method, system, device, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9946577B1 (en) | Systems and methods for distributed resource management | |
| US11645121B2 (en) | Systems and methods for distributed resource management | |
| US9477460B2 (en) | Non-transitory computer-readable storage medium for selective application of update programs dependent upon a load of a virtual machine and related apparatus and method | |
| CN110119306B (en) | Method, device and equipment for balancing automatic scheduling of jobs and storage medium | |
| US20160139949A1 (en) | Virtual machine resource management system and method thereof | |
| CN110471754B (en) | Data display method, device, equipment and storage medium in job scheduling | |
| JPWO2016016975A1 (en) | Development support system | |
| CN112035238A (en) | Task scheduling processing method and device, cluster system and readable storage medium | |
| CN111104227B (en) | Resource control method and device of K8s platform and related components | |
| CN109865292B (en) | Game resource construction method and device based on game engine | |
| CN111752822A (en) | Containerization pressure measurement scheduling method, computer equipment and readable storage medium | |
| CN107315631B (en) | Task scheduling method and device | |
| CN113821326A (en) | Job scheduling method and device, electronic equipment and storage medium | |
| CN108521524B (en) | Agent collaborative task management method and device, computer equipment and storage medium | |
| CN110764911A (en) | Resource scheduling method, device and control system based on order | |
| CN112860387A (en) | Distributed task scheduling method and device, computer equipment and storage medium | |
| CN114691321A (en) | Task scheduling method, device, equipment and storage medium | |
| CN114675954A (en) | Task scheduling method and device | |
| WO2018198745A1 (en) | Calculation resource management device, calculation resource management method, and computer-readable recording medium | |
| CN107967549B (en) | Multi-process task processing device and method | |
| CN107832124B (en) | Method and device for processing task in file processing system | |
| CN110113434B (en) | Method, device and equipment for balancing automatic scheduling of jobs and storage medium | |
| CN114995981A (en) | Parallel task scheduling method, system, storage medium and terminal | |
| CN113127221A (en) | Method, device, equipment and storage medium for limiting message consumption rate | |
| CN108009007B (en) | Scheduling method of lightweight thread, cooperative manager and vCPU scheduler |
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 |