Task scheduling method and device, electronic equipment and storage medium

Abstract

The invention provides a task scheduling method and device, electronic equipment and a storage medium, and the method comprises the steps: obtaining first description information of a to-be-executed task, determining a first task dependency relationship, first task execution time, first task starting time, first resource consumption information and a first task priority of the to-be-executed task according to the first description information, task execution information of candidate tasks in each task execution server and residual resource information of the task execution server are determined, and the task execution information describes task execution conditions of the candidate tasks; and determining a task scheduling strategy of the to-be-executed task according to the first task dependency relationship, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the residual resource information, and executing the to-be-executed task according to the task scheduling strategy. Therefore, the instantaneity and flexibility of task scheduling can be improved, and the task scheduling requirement in an actual service scene is effectively met.

Description

Technical Field

[0001] The present disclosure relates to the field of artificial intelligence technology, and in particular to a task scheduling method, device, electronic device and storage medium. Background Art

[0002] In existing task scheduling methods, task scheduling often relies on static task scheduling plans and preset resource allocations, lacking the ability to monitor and dynamically adjust tasks during task execution, thus failing to meet the task scheduling needs in actual business scenarios and failing to reasonably allocate remaining resources. Summary of the invention

[0003] The present disclosure proposes a task scheduling method, device, electronic device, storage medium and computer program product, aiming to solve the technical problems in the related technologies at least to a certain extent.

[0004] The first aspect of the present disclosure proposes a task scheduling method, which includes: obtaining first description information of the task to be executed; determining a first task dependency, a first task execution time, a first task start time, a first resource consumption information and a first task priority of the task to be executed based on the first description information; determining task execution information of candidate tasks in each task execution server, and remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate tasks; determining a task scheduling strategy for the task to be executed based on the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information; and executing the task to be executed according to the task scheduling strategy.

[0005] The second aspect embodiment of the present disclosure proposes a task scheduling device, which includes: an acquisition module, used to acquire first description information of the task to be executed; a first determination module, used to determine the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority of the task to be executed based on the first description information; a second determination module, used to determine the task execution information of the candidate tasks in each task execution server, and the remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate tasks; a third determination module, used to determine the task scheduling policy of the task to be executed based on the first task dependency, first task execution time, first task start time, first resource consumption information, first task priority, task execution information and remaining resource information; and an execution module, used to execute the task to be executed according to the task scheduling policy.

[0006] The third aspect embodiment of the present disclosure proposes an electronic device, comprising: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to execute instructions to implement a task scheduling method as the first aspect embodiment of the present disclosure.

[0007] The fourth aspect embodiment of the present disclosure proposes a computer-readable storage medium. When instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device can implement a task scheduling method as in the first aspect embodiment of the present disclosure.

[0008] The fifth aspect of the present disclosure provides a computer program product, including a computer program, characterized in that the computer program is executed by a processor as the task scheduling method of the first aspect of the present disclosure.

[0009] The task scheduling method, device, electronic device, storage medium and computer program product proposed in this embodiment have at least the following beneficial effects: by obtaining the first description information of the task to be executed, determining the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority of the task to be executed according to the first description information, and then determining the task execution information of the candidate tasks in each task execution server and the remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate tasks, and determining the task scheduling strategy of the task to be executed according to the first task dependency, first task execution time, first task start time, first resource consumption information, first task priority, task execution information and remaining resource information, and executing the task to be executed according to the task scheduling strategy, thereby improving the immediacy and flexibility of task scheduling, effectively meeting the task scheduling needs in actual business scenarios, and reasonably allocating the resources of the server, thereby improving resource utilization.

[0010] Additional aspects and advantages of the present disclosure will be given in part in the following description and in part will be obvious from the following description or learned through practice of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The above and / or additional aspects and advantages of the present disclosure will become apparent and easily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0012] Figure 1 is a flowchart of a task scheduling method according to the first embodiment of the present disclosure;

[0013] Figure 2 is a flowchart of a task scheduling method according to the second embodiment of the present disclosure;

[0014] Figure 3is a block diagram of a task scheduling device according to the present disclosure;

[0015] Figure 4 A block diagram of an exemplary electronic device suitable for implementing embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0016] Embodiments of the present disclosure are described in detail below, and examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present disclosure, and are not to be construed as limitations of the present disclosure. On the contrary, the embodiments of the present disclosure include all changes, modifications, and equivalents that fall within the spirit and connotation of the appended claims.

[0017] It should be noted that the execution subject of the task scheduling method of this embodiment may be a first server, and the first server may be configured in an electronic device, and the electronic device may include but is not limited to a terminal, a server, and the like.

[0018] It should be noted that the process of obtaining, storing, using, and processing information in the disclosed technical solution complies with the relevant provisions of national laws and regulations and does not violate public order and good morals.

[0019] It should be noted that in the embodiments of the present application, there may be existing solutions in the industry such as certain software, components, models, etc., which should be regarded as exemplary. Their purpose is only to illustrate the feasibility of implementing the technical solution of the present application, but it does not mean that the applicant has or will necessarily use the relevant content of the solution.

[0020] Figure 1 is a flowchart of a task scheduling method according to the first embodiment of the present disclosure, such as Figure 1 As shown, the method includes:

[0021] S101: Obtain first description information of a task to be executed.

[0022] Among them, the pending tasks are tasks to be executed in the current business scenario, and the tasks may be, for example, data acquisition tasks, data storage tasks, etc., without limitation.

[0023] The first description information may be used to describe the task to be performed. The first description information may be, for example, functional description information of the task to be performed, attribute information of the task to be performed, etc., and there is no limitation on this.

[0024] In the embodiments of the present disclosure, it is possible to obtain task requests from different data sources, and then process the task requests based on natural language processing technology to obtain first description information of the task to be executed. Alternatively, it is possible to obtain the task to be executed, and then determine the functional description information of the task to be executed based on a predetermined mapping relationship between the task to be executed and the functional description information, and use the functional description information of the task to be executed as the first description information of the task to be executed, and there is no limitation on this.

[0025] S102: Determine, according to the first description information, a first task dependency, a first task execution time, a first task start time, first resource consumption information, and a first task priority of the task to be executed.

[0026] Among them, the first task dependency means that the execution of a task to be executed needs to depend on the execution of another task to be executed. For example, in the execution process of multiple tasks to be executed, the data that needs to be processed during the execution of a task to be executed may be the execution result of another task to be executed, or the completion of the execution of a task to be executed is the triggering execution condition of another task to be executed. There is no restriction on this.

[0027] The first task execution time refers to the time required for the task to be executed from the start to the completion of the execution.

[0028] The first task start time refers to the time when the task to be executed starts to be executed.

[0029] Among them, the first resource consumption information can be used to describe the resource consumption of the task to be executed during the execution process, for example, the server resources occupied by the task to be executed during the execution process, the computing resources consumed by the task to be executed, etc., without limitation.

[0030] Among the multiple tasks to be executed, the tasks to be executed with a higher first priority will be executed first, and the tasks to be executed with a lower first priority will be executed later, and there is no restriction on this.

[0031] In some embodiments, based on the first description information, the first task dependency, the first task execution time, the first task start time, the first resource consumption information and the first task priority of the task to be executed are determined. It can be that keyword templates corresponding to the task dependency, task execution time, task start time, resource consumption information and task priority are obtained respectively, and then keywords are extracted from the first description information based on the keyword module to determine the first task dependency, the first task execution time, the first task start time, the first resource consumption information and the first task priority of the task to be executed.

[0032] Optionally, in some other embodiments, determining the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority of the task to be executed based on the first descriptive information can be done by inputting the first descriptive information into the first large model to obtain the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority output by the first large model.

[0033] The first large model is used to determine the first task dependency, the first task execution time, the first task start time, the first resource consumption information and the first task priority of the task to be executed according to the first description information.

[0034] That is to say, in the embodiments of the present disclosure, the first description information can be input into the first large model to obtain the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority output by the first large model. Thus, the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority of the task to be executed can be determined efficiently and accurately in combination with the first large model.

[0035] S103: Determine task execution information of the candidate tasks in each task execution server and remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate tasks.

[0036] The candidate tasks are current tasks being executed in the task execution server, or historical tasks that have been completed, and there is no restriction on this.

[0037] The task execution information is used to describe the task execution status of the candidate task, for example, the task execution status (being executed, or completed), the task execution time, etc., and there is no restriction on this.

[0038] The remaining resource information is used to describe the remaining resource situation of the task execution server, such as the remaining amount of processing resources, the remaining amount of memory, etc., and there is no restriction on this.

[0039] That is to say, in the embodiment of the present disclosure, determining the task execution information of the candidate tasks in each task execution server can be to obtain the log information of the task execution server and parse the log information of the task execution server to determine the task execution information of the candidate tasks in each task execution server and the remaining resource information of each task execution server, and there is no limitation on this.

[0040] Optionally, in some embodiments, determining the task execution information of the candidate tasks in each task execution server may be by obtaining the task execution status, the second task execution time, and the second resource consumption information of the current task, and taking the task execution status, the second task execution time, and the second resource consumption information of the current task together as the task execution information; and / or obtaining the third task execution time, the third resource consumption information, the second task dependency, and the second task priority of the historical task, and taking the third task execution time, the third resource consumption information, the second task dependency, and the second task priority of the historical task together as the task execution information.

[0041] The task execution status may be, for example, being executed, suspended, etc., and there is no restriction on this.

[0042] The task execution time of the current task is the second task execution time.

[0043] Among them, the second resource consumption information can be used to describe the resource consumption of the current task during execution, for example, the server resources occupied by the current task during execution, the computing resources consumed by the current task execution, etc., without limitation.

[0044] Among them, the task execution time of the historical task is the third task execution time.

[0045] Among them, the third resource consumption information can be used to describe the resource consumption of the historical task during the execution process, for example, the server resources occupied by the historical task during the execution process, the computing resources consumed by the historical task execution, etc., without limitation.

[0046] Among them, the second task dependency means that the execution of a certain historical task needs to rely on the execution of another historical task. For example, in the execution process of multiple historical tasks, the data that needs to be processed during the execution of a certain historical task can be the execution result of another historical task, or the completion of the execution of a certain historical task is the trigger execution condition of another historical task. There is no restriction on this.

[0047] That is to say, in the embodiments of the present disclosure, the task execution information of the candidate tasks in each task execution server may be determined, and the task execution status, the second task execution time, and the second resource consumption information of the current task may be obtained, and the task execution status, the second task execution time, and the second resource consumption information of the current task may be taken together as the task execution information; and / or the third task execution time, the third resource consumption information, the second task dependency, and the second task priority of the historical task may be obtained, and the third task execution time, the third resource consumption information, the second task dependency, and the second task priority of the historical task may be taken together as the task execution information. Thus, the relevant information of the current task and the relevant information of the historical task may be taken together as the task execution information, thereby improving the comprehensiveness of the task execution information and thus improving the referenceability of the task execution information.

[0048] S104: Determine a task scheduling strategy for the task to be executed according to the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information.

[0049] Among them, the task scheduling strategy can be used to determine the task execution order of the tasks to be executed, and can be used to reasonably allocate task execution servers for the tasks to be executed.

[0050] In some embodiments, the task scheduling strategy for the task to be executed is determined based on the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information. This can be by obtaining a mapping relationship between a reference task scheduling strategy and reference information (the reference information includes: the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information), and then determining the task scheduling strategy for the task to be executed based on the mapping relationship between the reference information and the reference task scheduling strategy. There is no limitation on this.

[0051] In other embodiments, the corresponding deep learning model can be pre-trained based on sample data (the sample data includes: task dependency, task execution time, task start time, resource consumption information, task priority, task execution information and remaining resource information) and the labeled task scheduling strategy, and then the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information are input into the trained deep learning model to obtain the task scheduling strategy for the tasks to be executed output by the model, without any restriction.

[0052] S105: Execute the task to be executed according to the task scheduling strategy.

[0053] In an embodiment of the present disclosure, after determining the task scheduling strategy for the task to be executed based on the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information, the task to be executed can be executed according to the task scheduling strategy.

[0054] The task scheduling strategy may include: the task execution order of the tasks to be executed, and / or the task execution servers assigned to the tasks to be executed.

[0055] In some embodiments, executing tasks to be executed according to a task scheduling strategy may be to execute multiple tasks to be executed sequentially according to the task execution order in the task scheduling strategy, or, may be to assign corresponding task execution servers to the tasks to be executed according to the task scheduling strategy to control the task execution servers to execute the tasks to be executed, and there is no limitation on this.

[0056] In the disclosed embodiment, by obtaining first description information of the task to be executed, the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority of the task to be executed are determined according to the first description information, and then the task execution information of the candidate tasks in each task execution server and the remaining resource information of each task execution server are determined, wherein the task execution information is used to describe the task execution status of the candidate tasks, and the task scheduling strategy of the task to be executed is determined according to the first task dependency, first task execution time, first task start time, first resource consumption information, first task priority, task execution information and remaining resource information, and the task to be executed is executed according to the task scheduling strategy, thereby improving the immediacy and flexibility of task scheduling, effectively meeting the task scheduling requirements in actual business scenarios, and reasonably allocating the resources of the server, thereby improving resource utilization.

[0057] Figure 2 is a flowchart of a task scheduling method according to a second embodiment of the present disclosure, such as Figure 2 As shown, the method includes:

[0058] S201: Obtain first description information of a task to be executed.

[0059] S202: Determine, according to the first description information, a first task dependency, a first task execution time, a first task start time, first resource consumption information, and a first task priority of the task to be executed.

[0060] S203: Determine task execution information of the candidate tasks in each task execution server and remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate tasks.

[0061] The specific description of S201 - S203 can be found in the above embodiments, which will not be repeated here.

[0062] S204: Input the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information into the second largest model to obtain the task scheduling strategy output by the second largest model.

[0063] Among them, the second largest model is used to determine the task scheduling strategy of the task to be executed based on the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information.

[0064] That is to say, in the embodiment of the present disclosure, the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information can be input into the second largest model to obtain the task scheduling strategy output by the second largest model. Thus, the task scheduling strategy for the task to be executed can be determined efficiently and accurately in combination with the second largest model.

[0065] S205: Determine the task execution order and task execution server corresponding to each task to be executed according to the task scheduling strategy.

[0066] In the disclosed embodiment, after the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information are input into the second large model to obtain the task scheduling strategy output by the second large model, the task execution order and the task execution server corresponding to each task to be executed can be determined according to the task scheduling strategy.

[0067] S206: Providing each task to be executed to a corresponding task execution server.

[0068] In the embodiment of the present disclosure, after determining the task execution order and the task execution server corresponding to each task to be executed according to the task scheduling strategy, each task to be executed can be provided to the corresponding task execution server.

[0069] S207: Control the task execution servers to execute the tasks to be executed in sequence according to the task execution order.

[0070] In the embodiment of the present disclosure, after each task to be executed is provided to the corresponding task execution server, the task execution server can be controlled in sequence to execute the task to be executed according to the task execution order. In this way, the task execution server with better resources can be reasonably arranged for the task to be executed, ensuring that the task execution is not affected by resource limitations and ensuring that the tasks to be executed can be executed efficiently and orderly.

[0071] In the disclosed embodiment, by obtaining the first description information of the task to be executed, the first task dependency, the first task execution time, the first task start time, the first resource consumption information and the first task priority of the task to be executed are determined according to the first description information, the task execution information of the candidate task in each task execution server and the remaining resource information of each task execution server are determined, wherein the task execution information is used to describe the task execution status of the candidate task, the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information are input into the second large model together to obtain the task scheduling strategy output by the second large model, thereby, the task scheduling strategy of the task to be executed can be efficiently and accurately determined in conjunction with the second large model, according to the task scheduling strategy, the task execution order and the task execution server corresponding to each task to be executed are determined, each task to be executed is provided to the corresponding task execution server, and the task execution server is controlled in turn to execute the task to be executed according to the task execution order, thereby, the task execution server with better resources can be reasonably arranged for the task to be executed, the task execution is guaranteed not to be affected by resource limitations, and the task to be executed can be ensured to be executed efficiently and orderly.

[0072] Figure 3 is a block diagram of a task scheduling device according to the present disclosure, such as Figure 3 As shown, the task scheduling device 30 includes:

[0073] An acquisition module 301 is used to acquire first description information of a task to be executed;

[0074] A first determination module 302, configured to determine a first task dependency, a first task execution time, a first task start time, first resource consumption information, and a first task priority of the task to be executed according to the first description information;

[0075] The second determination module 303 is used to determine the task execution information of the candidate task in each task execution server and the remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate task;

[0076] A third determination module 304 is used to determine a task scheduling strategy for the task to be executed according to the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information;

[0077] The execution module 305 is used to execute the task to be executed according to the task scheduling strategy.

[0078] In some embodiments of the present disclosure, the first determining module 302 is further configured to:

[0079] The first description information is input into the first large model to obtain the first task dependency, the first task execution time, the first task start time, the first resource consumption information and the first task priority output by the first large model.

[0080] In some embodiments of the present disclosure, the third determining module 304 is further configured to:

[0081] The first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information are input into the second largest model to obtain the task scheduling strategy output by the second largest model.

[0082] In some embodiments of the present disclosure, the execution module 305 is further configured to:

[0083] According to the task scheduling strategy, determine the task execution order and task execution server corresponding to each task to be executed;

[0084] Providing each task to be executed to the corresponding task execution server;

[0085] The task execution servers are controlled to execute the tasks to be executed in sequence according to the task execution order.

[0086] In some embodiments of the present disclosure, the candidate tasks include: current tasks and historical tasks.

[0087] In some embodiments of the present disclosure, the second determining module 303 is further configured to:

[0088] Obtaining the task execution status, the second task execution time and the second resource consumption information of the current task, and using the task execution status, the second task execution time and the second resource consumption information of the current task as the task execution information; and / or

[0089] The third task execution time, third resource consumption information, second task dependency and second task priority of the historical task are obtained, and the third task execution time, third resource consumption information, second task dependency and second task priority of the historical task are taken together as task execution information.

[0090] It should be noted that the above explanation of the task scheduling method is also applicable to the task scheduling device of this embodiment and will not be repeated here.

[0091] In the disclosed embodiment, by obtaining first description information of the task to be executed, the first task dependency, first task execution time, first task start time, first resource consumption information and first task priority of the task to be executed are determined according to the first description information, and then the task execution information of the candidate tasks in each task execution server and the remaining resource information of each task execution server are determined, wherein the task execution information is used to describe the task execution status of the candidate tasks, and the task scheduling strategy of the task to be executed is determined according to the first task dependency, first task execution time, first task start time, first resource consumption information, first task priority, task execution information and remaining resource information, and the task to be executed is executed according to the task scheduling strategy, thereby improving the immediacy and flexibility of task scheduling, effectively meeting the task scheduling requirements in actual business scenarios, and reasonably allocating the resources of the server, thereby improving resource utilization.

[0092] Figure 4 A block diagram of an exemplary electronic device suitable for implementing embodiments of the present disclosure is shown.

[0093] Figure 4 The electronic device 12 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0094] like Figure 4 As shown, the electronic device 12 is in the form of a general purpose computing device. The components of the electronic device 12 may include, but are not limited to: one or more processors or processing units 16, a memory 28, and a bus 18 that connects various system components (including the memory 28 and the processing unit 16).

[0095] The bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor or a local bus using any of a variety of bus structures. For example, these architectures include but are not limited to Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MAC) bus, Enhanced ISA bus, Video Electronics Standards Association (VESA) local bus and Peripheral Component Interconnection (PCI) bus.

[0096] The electronic device 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the electronic device 12, including volatile and non-volatile media, removable and non-removable media.

[0097] The memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and / or cache memory 32. The electronic device 12 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media ( Figure 4 Not shown, often called a "hard drive").

[0098] although Figure 4 Not shown in the figure, a disk drive for reading and writing a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing a removable non-volatile optical disk (e.g., a compact disc read only memory (hereinafter referred to as: CD-ROM), a digital versatile disc read only memory (hereinafter referred to as: DVD-ROM) or other optical media) may be provided. In these cases, each drive may be connected to the bus 18 via one or more data medium interfaces. The memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present disclosure.

[0099] A program / utility 40 having a set (at least one) of program modules 42 may be stored, for example, in the memory 28, such program modules 42 including but not limited to an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment. The program modules 42 generally perform the functions and / or methods of the embodiments described in the present disclosure.

[0100] The electronic device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), may also communicate with one or more devices that enable the human body to interact with the electronic device 12, and / or communicate with any device that enables the electronic device 12 to communicate with one or more other computing devices (e.g., network card, modem, etc.). Such communication may be performed through an input / output (I / O) interface 22. In addition, the electronic device 12 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) through a network adapter 20. As shown, the network adapter 20 communicates with other modules of the electronic device 12 through a bus 18. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0101] The processing unit 16 executes various functional applications and parameter information determination by running the program stored in the memory 28, such as implementing the business data storage method mentioned in the above embodiment, or implementing the business data acquisition method mentioned in the above embodiment.

[0102] It should be noted that, in the description of the present disclosure, the terms "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or implying relative importance. In addition, in the description of the present disclosure, unless otherwise specified, the meaning of "plurality" is two or more.

[0103] Any process or method description in a flowchart or otherwise described herein may be understood to represent a module, segment or portion of code that includes one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present disclosure includes alternative implementations in which functions may not be performed in the order shown or discussed, including performing functions in a substantially simultaneous manner or in the reverse order depending on the functions involved, which should be understood by those skilled in the art to which the embodiments of the present disclosure belong.

[0104] It should be understood that the various parts of the present disclosure can be implemented in hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, multiple steps or methods can be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0105] A person of ordinary skill in the art may understand that all or part of the steps in the method for implementing the above-mentioned embodiment may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, which, when executed, includes one or a combination of the steps of the method embodiment.

[0106] In addition, each functional unit in each embodiment of the present disclosure may be integrated into a processing module, or each unit may exist physically separately, or two or more units may be integrated into one module. The above-mentioned integrated module may be implemented in the form of hardware or in the form of a software functional module. If the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may also be stored in a computer-readable storage medium.

[0107] The storage medium mentioned above can be a read-only memory, a magnetic disk or an optical disk, etc.

[0108] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present disclosure. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0109] Although the embodiments of the present disclosure have been shown and described above, it is to be understood that the above embodiments are exemplary and are not to be construed as limitations of the present disclosure. A person skilled in the art may change, modify, replace and vary the above embodiments within the scope of the present disclosure.

Claims

1. A task scheduling method, characterized in that: The method comprises: Obtaining first description information of the task to be executed; Determine, according to the first description information, a first task dependency, a first task execution time, a first task start time, first resource consumption information, and a first task priority of the task to be executed; Determine task execution information of the candidate task in each task execution server and remaining resource information of each task execution server, wherein the task execution information is used to describe the task execution status of the candidate task; Determine a task scheduling strategy for the task to be executed according to the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information; The to-be-executed tasks are executed according to the task scheduling strategy.

2. The method according to claim 1, characterized in that The determining, according to the first description information, a first task dependency, a first task execution time, a first task start time, first resource consumption information, and a first task priority of the task to be executed includes: The first description information is input into the first large model to obtain the first task dependency, the first task execution time, the first task start time, the first resource consumption information and the first task priority output by the first large model.

3. The method according to claim 1, characterized in that The determining, according to the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information, a task scheduling strategy for the task to be executed includes: The first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information are input into the second large model to obtain the task scheduling strategy output by the second large model.

4. The method according to claim 1, characterized in that The executing the to-be-executed task according to the task scheduling strategy includes: Determine the task execution order and task execution server corresponding to each of the tasks to be executed according to the task scheduling strategy; Providing each of the tasks to be executed to the corresponding task execution server; The task execution servers are controlled to execute the tasks to be executed in sequence according to the task execution order.

5. The method according to claim 1, characterized in that The candidate tasks include: current tasks and historical tasks.

6. The method according to claim 5, characterized in that The step of determining the task execution information of the candidate tasks in each task execution server includes: Acquire the task execution status, the second task execution time and the second resource consumption information of the current task, and use the task execution status, the second task execution time and the second resource consumption information of the current task together as the task execution information; and / or The third task execution time, third resource consumption information, second task dependency and second task priority of the historical task are obtained, and the third task execution time, third resource consumption information, second task dependency and second task priority of the historical task are taken together as the task execution information.

7. A task scheduling device, characterized in that: The device comprises: An acquisition module, used to acquire first description information of a task to be executed; A first determination module, used to determine a first task dependency, a first task execution time, a first task start time, first resource consumption information and a first task priority of the task to be executed according to the first description information; A second determination module is used to determine task execution information of the candidate task in each task execution server and remaining resource information of each of the task execution servers, wherein the task execution information is used to describe the task execution status of the candidate task; A third determination module is used to determine the task scheduling strategy of the task to be executed according to the first task dependency, the first task execution time, the first task start time, the first resource consumption information, the first task priority, the task execution information and the remaining resource information; An execution module is used to execute the task to be executed according to the task scheduling strategy.

8. An electronic device, characterized in that: include: processor; a memory for storing instructions executable by the processor; The processor is configured to execute the instructions to implement the method according to any one of claims 1 to 6.

9. A computer-readable storage medium, when instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device is enabled to execute the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

Images