Task scheduling method, device, system and electronic equipment

Abstract

The embodiments of the present application provide a task scheduling method, device, system and electronic device, which relate to the field of task scheduling technology. The task scheduling method includes: in response to a version update instruction for a first algorithm, determining a target task in a task scheduling system; the target task is an ongoing and pending task that needs to be analyzed using the first algorithm; resetting the target task to an initialization state; obtaining a second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; adjusting the point rule information of the target task according to the algorithm rule information of the second algorithm so that the target task complies with the algorithm rule information of the second algorithm; and executing the target task based on the second algorithm.

Description

Technical Field

[0001] The present application relates to the technical field of task scheduling, and in particular to a task scheduling method, device, system and electronic equipment. Background Art

[0002] The intelligent task scheduling system is an automated management tool based on artificial intelligence technology that can allocate, schedule and manage various tasks in an efficient and intelligent way. The system can process the corresponding algorithm for each task allocation according to actual needs and resource conditions to improve work efficiency, reduce costs and optimize resource allocation.

[0003] When the algorithm version in the intelligent task scheduling system is iteratively updated, the rule information of the task points corresponding to the algorithm needs to be reconfigured so that the task can be processed based on the updated algorithm. However, if there are many task points, it is very time-consuming and the accuracy cannot be guaranteed if the rule information of each task point is manually reconfigured. Summary of the invention

[0004] The present application provides a task scheduling method, device, system and electronic device, which are used to automatically adjust the point rule information of the target task corresponding to the old version of the algorithm according to the algorithm rule information of the new version of the algorithm when the algorithm version in the task scheduling system is iteratively updated, so as to automatically execute the target task based on the new version of the algorithm.

[0005] A first aspect of an embodiment of the present application provides a task scheduling method, including: in response to a version update instruction for a first algorithm, determining a target task in a task scheduling system; the target task is an executing and to-be-executed task that needs to be analyzed using the first algorithm; resetting the target task to an initialized state; obtaining a second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; adjusting the point rule information of the target task according to the algorithm rule information of the second algorithm so that the target task complies with the algorithm rule information of the second algorithm; and executing the target task based on the second algorithm.

[0006] The task scheduling method provided in the embodiment of the present application, after receiving the version update instruction for the first algorithm, determines the target tasks in the task scheduling system that need to be analyzed using the first algorithm and are being executed and to be executed; resets the target task to the initialization state, and adjusts the point rule information of the target task according to the algorithm rule information of the second algorithm, and the target task can be executed based on the second algorithm. There is no need to manually reconfigure the rule information of the task corresponding to the first algorithm, and the task scheduling system can process the target task based on the updated algorithm, which can greatly save the working time of the staff, and thus can improve the processing efficiency of the target task.

[0007] In combination with the first implementation method of the first aspect, the method also includes: replacing the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information in the task scheduling system with a second algorithm; the pre-allocated resource information includes all algorithms loaded in the task scheduling system; the default algorithm configuration information includes the correspondence between the task type and the default algorithm.

[0008] In combination with the second implementation method of the first aspect, the method also includes: in response to a deletion instruction for the first algorithm, determining the target task corresponding to the first algorithm; stopping execution of the target task; deleting the first algorithm, algorithm rule information corresponding to the first algorithm, and cached data; the cached data includes intermediate data generated by the algorithm during the execution of the task; and outputting a prompt message, the prompt message being used to prompt that the target task has stopped execution.

[0009] In combination with the third implementation method of the first aspect, the method also includes: in response to a deletion instruction for the first algorithm, deleting the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information; wherein the pre-allocated resource information includes all algorithms loaded in the task scheduling system; the default algorithm configuration information represents the correspondence between the task type and the default algorithm.

[0010] In combination with the fourth implementation method of the first aspect, the method also includes: in response to a new algorithm instruction, obtaining a target algorithm corresponding to the new algorithm instruction; when it is determined that there is a task corresponding to the target algorithm, executing the task corresponding to the target algorithm, and the task corresponding to the target algorithm is a task that needs to be analyzed using the target algorithm.

[0011] In combination with the fifth implementation manner of the first aspect, the method further includes: adding a target algorithm to the pre-allocated resource information, and the pre-allocated resource information includes all algorithms loaded in the task scheduling system.

[0012] In combination with the sixth implementation manner of the first aspect, the method also includes: in response to an algorithm delisting instruction, determining a delisting algorithm corresponding to the algorithm delisting instruction; determining a task corresponding to the delisting algorithm from tasks being executed in a task scheduling system; stopping execution of the task corresponding to the delisting algorithm; and / or; in response to an algorithm listing instruction, determining a listing algorithm corresponding to the algorithm listing instruction; determining a task corresponding to the listing algorithm from tasks stopped from execution in the task scheduling system; and continuing execution of the task corresponding to the listing algorithm.

[0013] The second aspect of an embodiment of the present application provides a task scheduling device, including: a determination module, used to determine a target task in a task scheduling system in response to a version update instruction for a first algorithm; the target task is an executing and to-be-executed task that needs to be analyzed using the first algorithm; a reset module, used to reset the target task to an initialized state; an acquisition module, used to acquire a second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; an adjustment module, used to adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task complies with the algorithm rule information of the second algorithm; and an execution module, used to execute the target task based on the second algorithm.

[0014] The third aspect of an embodiment of the present application provides a task scheduling system, including: an algorithm adaptive processing module, which is used to receive an algorithm change notification and, after determining that the algorithm change notification is a version update instruction for a first algorithm, sends an indication message to a task scheduling module; a task scheduling module is used to determine a target task in the task scheduling system; the target task is an executing and pending task that needs to be analyzed using a first algorithm; the task scheduling module is also used to reset the target task to an initialized state; a synchronization module, which is used to obtain a second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; the task scheduling module is also used to adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task complies with the algorithm rule information of the second algorithm; an engine service module, which is used to execute the target task based on the second algorithm.

[0015] The fourth aspect of an embodiment of the present application provides an electronic device, comprising: one or more processors; one or more memories; wherein the one or more memories are used to store computer program codes, the computer program codes include computer instructions, and when the one or more processors execute the computer instructions, the electronic device executes the task scheduling method provided by the first aspect and its possible implementation methods.

[0016] The fifth aspect of the embodiments of the present application provides a computer-readable storage medium, which stores computer execution instructions. When the computer execution instructions are executed on a computer, the computer executes the task scheduling method provided by the first aspect and its possible implementation methods.

[0017] A sixth aspect of an embodiment of the present application provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the steps of the task scheduling method provided in the first aspect and its possible implementation methods.

[0018] Among them, the beneficial effects described in the second to sixth aspects can refer to the beneficial effect analysis of the first aspect, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The accompanying drawings are used to provide a further understanding of the technical solution of the present invention and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the technical solution of the present invention and do not constitute a limitation on the technical solution of the present invention.

[0020] Figure 1 A structural diagram of a task scheduling system provided in an embodiment of the present application;

[0021] Figure 2 A flowchart of a task scheduling method provided in an embodiment of the present application;

[0022] Figure 3 A method flow of a task scheduling method provided in an embodiment of the present application Figure 1 ;

[0023] Figure 4 A method flow of a task scheduling method provided in an embodiment of the present application Figure 2 ;

[0024] Figure 5 A schematic diagram of the structure of a task scheduling device provided in an embodiment of the present application;

[0025] Figure 6 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0026] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0027] The terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of this application, unless otherwise specified, "plurality" means two or more.

[0028] In the description of this application, it should be noted that, unless otherwise clearly specified and limited, the terms "connected" and "connection" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to specific circumstances. In addition, when describing a pipeline, the "connected" and "connection" used in this application have the meaning of conduction. The specific meaning needs to be understood in conjunction with the context.

[0029] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0030] The task scheduling system is an automated management tool based on artificial intelligence technology that can allocate, schedule and manage various tasks in an efficient and intelligent way. The system can process the corresponding algorithm for each task allocation according to actual needs and resource conditions to improve work efficiency, reduce costs and optimize resource allocation.

[0031] For example, suppose there is an image processing task, the goal is to automatically identify and locate the precise position (i.e., point position) of a specific object (such as a human body, a vehicle, a building sign, etc.) in an image. This task requires a task scheduling system to assign different image processing algorithms to analyze different images or image regions to improve processing efficiency and accuracy. Specifically, it can include the following aspects:

[0032] Task reception and analysis: The task scheduling system first receives the image processing task, including the image set to be processed and the specific processing requirements, and then analyzes the processing requirements of the task to determine the type and number of algorithms that need to be called.

[0033] Image preprocessing: Before assigning an algorithm, the system may preprocess the image, such as denoising, contrast enhancement, etc., to improve the accuracy of subsequent processing.

[0034] Feature extraction and point recognition: The system automatically selects the appropriate feature extraction algorithm to extract feature information from the image based on the characteristics and processing requirements of the image. The system then determines the corresponding point recognition algorithm (such as sliding window, region proposal network in convolutional neural network, etc.) based on the result of feature extraction to locate and identify specific points in the image.

[0035] Algorithm allocation and optimization: The task scheduling system dynamically allocates the most appropriate processing algorithm to each point or multiple points based on the characteristics and complexity of the image and the current system load.

[0036] As a feasible implementation, the task scheduling system may adopt a load balancing strategy to ensure that all processing resources are fully utilized while avoiding overloading of certain resources. If it is found that an algorithm does not work well when processing a specific type of image, the system can automatically adjust the algorithm allocation strategy and try other more suitable algorithms.

[0037] Parallel processing and result aggregation: To improve processing efficiency, the system may use parallel processing technology to process multiple images or different areas of an image at the same time. After processing is completed, the system aggregates and integrates the output results of each algorithm to form the final recognition result.

[0038] It can be seen that before executing a task in the task scheduling system, it is necessary to set processing requirements for the task, that is, to configure rule information for the task points. During the execution process, it is necessary to analyze the rule information that each point needs to meet under its corresponding algorithm, such as data processing, feature extraction, and recognition accuracy. When the algorithm version in the task scheduling system is iteratively updated, it is necessary to reconfigure the rule information for the task points corresponding to the algorithm so that the task can be processed based on the updated algorithm. However, when there are many task points, it is very time-consuming and the accuracy cannot be guaranteed if the rule information for each point in the task is manually reconfigured.

[0039] Based on this, an embodiment of the present application provides a task scheduling method, which is used to determine the target tasks that need to be analyzed using the first algorithm and are being executed and to be executed in the task scheduling system after receiving a version update instruction for a first algorithm; and then reset the target task to an initialized state to avoid the target task being unable to continue to be executed due to algorithm inconsistency; after obtaining the second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm, adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task complies with the algorithm rule information of the second algorithm; finally, execute the target task based on the second algorithm, so that the target task can be continued to be executed.

[0040] It can be seen that the task scheduling method provided in the embodiment of the present application, after receiving the version update instruction for the first algorithm, resets the target task to the initialization state, and adjusts the point rule information of the target task according to the algorithm rule information of the second algorithm, and the target task can be executed based on the second algorithm. There is no need to manually reconfigure the rule information of the task corresponding to the first algorithm. The task scheduling system can process the target task based on the updated algorithm, which can greatly save the working time of the staff, and thus can improve the processing efficiency of the target task.

[0041] The task scheduling method provided in the embodiment of the present application can be applied to Figure 1 In the task scheduling system shown in Figure 1 The task scheduling system 10 may include: a task scheduling unit 11 and a task execution unit 12 .

[0042] The task scheduling unit 11 is used to generate and schedule multiple tasks, such as Figure 1 As shown, the task scheduling unit 11 may include an algorithm adaptive processing module 111 , an algorithm synchronization module 112 , a resource processing module 113 and a task scheduling module 114 .

[0043] The algorithm adaptation processing module 111 is used to receive the algorithm change notification sent by the algorithm warehouse 20, and determine the corresponding algorithm change process according to the algorithm change notification.

[0044] It should be understood that the algorithm warehouse 20 is used to store algorithms, and can receive algorithm packages uploaded by users and algorithm rule information generated by device self-training, and save them in the algorithm warehouse 20. When there is a change in the algorithm required by the task scheduling system 10 (algorithm version update, algorithm deletion, algorithm addition, algorithm listing or algorithm delisting), the algorithm warehouse 20 needs to send an algorithm change notification to the task scheduling system 10. The algorithm change notification can specifically be an algorithm version update, algorithm deletion, algorithm addition, algorithm listing or algorithm delisting notification, and this application does not limit this.

[0045] The algorithm synchronization module 112 is used to obtain the algorithm and algorithm rule information from the algorithm warehouse 20 according to the instructions of the algorithm adaptive processing module 111.

[0046] The resource processing module 113 is used to process the algorithms and graphics processing unit (GPU) resources in the task scheduling system 10, and send information such as algorithm allocation / destruction and algorithm engine resource configuration to the task execution unit 12.

[0047] The task scheduling module 114 is used to automatically schedule tasks in the task scheduling system 10 according to information such as task time and task execution status, that is, to configure point rule information for each task.

[0048] The task execution unit 12 is used to receive the algorithm engine resource configuration information and execute the corresponding task according to the point rule information configured by the task scheduling module 114. Figure 1 As shown, the task execution unit 12 may include an engine service module 121 and multiple algorithm engine nodes 122 .

[0049] The engine service module 121 is used to schedule the algorithm engine node 122 according to the point rule information of the task, so that the corresponding algorithm of the algorithm engine node 122 can process the task.

[0050] It should be understood that the task scheduling system 10 in the embodiment of the present application can be deployed on a task scheduling device, and the task scheduling device can be a personal computer (PC), a laptop computer, a mobile device, a tablet computer, a laptop computer and other electronic devices. The embodiment of the present application does not limit the specific form of the electronic device. Alternatively, the task scheduling device can also be a single server, or a server cluster composed of multiple servers. In some implementations, the server cluster can be a distributed cluster server. The embodiment of the present application does not impose any restrictions on this.

[0051] It should be pointed out that Figure 1 The structure shown does not constitute a limitation on the task scheduling system 10. In other embodiments, the system may include fewer or more components than shown in the figure, or a combination of certain components, or a different arrangement of components. The embodiments of the present application do not impose any limitations on this.

[0052] See also Figure 2 The process of executing the task scheduling method provided in the embodiment of the present application is as follows:

[0053] S201 : In response to a version update instruction for a first algorithm, determine a target task in a task scheduling system.

[0054] The target task is a task being executed or to be executed in the task scheduling system that needs to be analyzed using the first algorithm.

[0055] It is understandable that the task scheduling system uses a large number of algorithms to perform algorithmic analysis on tasks during the execution of tasks. The algorithms are stored in the algorithm warehouse, and the task scheduling system loads them into its own memory when using them. After the user updates the version of an algorithm, it will be uploaded to the algorithm warehouse, but the old version of the algorithm is still loaded in the task scheduling system.

[0056] Therefore, after the version of the first algorithm in the algorithm warehouse is updated, an algorithm change notification will be sent to the task scheduling system to notify the task scheduling system that the version of the first algorithm has been updated and the task scheduling system cannot continue to execute tasks using the first algorithm and needs to use the updated algorithm to execute the corresponding tasks.

[0057] It is understandable that after the first algorithm stops being used, the tasks being executed and to be executed that need to be analyzed using the first algorithm will not be executed. Therefore, after receiving the version update instruction for the first algorithm, the task scheduling system needs to determine the target tasks being executed and to be executed that need to be analyzed using the first algorithm among all the tasks in the task scheduling system.

[0058] For example, suppose there is an image processing task in the task scheduling system, and the goal is to automatically identify and locate the precise position of a specific object in the target image. This task requires a feature extraction algorithm to extract the feature information of the target image, and then use a point recognition algorithm to locate and identify specific points in the image, and then obtain the precise position of the specific object. It can be seen that this image processing task needs to be executed using a feature extraction algorithm and a point recognition algorithm.

[0059] If the recognition result of the image processing task is not accurate enough, it may be that the algorithm result of the feature extraction algorithm or the point recognition algorithm is not accurate enough, so the feature extraction algorithm or the point recognition algorithm needs to be updated. Assuming that the user updates the feature extraction algorithm, the new version of the algorithm will be uploaded to the algorithm warehouse after the update. After receiving the updated new version of the algorithm, the algorithm warehouse will send an algorithm change notification to the task scheduling system to notify the task scheduling system that the version of the feature extraction algorithm has been updated and the updated feature extraction algorithm needs to be used to perform the image processing task.

[0060] S202: Reset the target task to an initialization state.

[0061] It is understandable that when the target task is a task that is being executed, the execution logic or data structure of the existing task may not match the updated algorithm due to inconsistent algorithm versions. If the algorithm version update involves changing key parts such as the execution logic, data structure or interface of the existing task, the task being executed may not be able to continue due to incompatibility. In this case, the relevant technology usually needs to wait until the task is completed before updating the version, or take other measures (such as rolling back to the old version) to ensure the smooth execution of the task. In this case, the target task being executed is still executed using the first algorithm (the old version of the algorithm).

[0062] Since the old version of the algorithm will inevitably have some problems, such as low algorithm performance and low computational efficiency, if the old version of the algorithm is continued to be used to perform tasks, it will inevitably affect the execution of the target task. Therefore, in the embodiment of the present application, the target task is reset to the initialization state so that the new version of the algorithm can be used to re-execute the target task.

[0063] S203: Acquire a second algorithm after the first algorithm is updated and algorithm rule information of the second algorithm.

[0064] After receiving the version update instruction for the first algorithm, the task scheduling system can obtain the second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm.

[0065] It should be understood that the second algorithm is the algorithm itself, and the algorithm rule information includes the basic rules and usage rules of the algorithm, such as the input and output content of the algorithm, the execution order between the operations in the algorithm, the description method of the algorithm, etc. It should be understood that the content of the algorithm rule information corresponding to different algorithms is different, and this application does not impose any restrictions on this.

[0066] S204: Adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task complies with the algorithm rule information of the second algorithm.

[0067] It can be understood that the point rule information of the target task is generated based on the algorithm rule information of the first algorithm, so that the target task can be algorithmically analyzed using the first algorithm.

[0068] For example, assume that the target task is to segment a complex image into multiple regions with specific features, such as segmenting a landscape image into different parts such as sky, mountain, water, and trees. It can be seen that the target task needs to be performed using a region-based image segmentation algorithm, such as a region growing algorithm. The algorithm rule information of the region growing algorithm may include:

[0069] Seed point selection: Manually or automatically select a set of initial seed points in the image, each seed point represents the starting position of a region.

[0070] Similarity criterion: Define a similarity criterion (such as color, texture, grayscale, etc.) to determine whether adjacent pixels belong to the same region.

[0071] Region growing: Starting from a seed point, adjacent pixels are added to the corresponding region according to a similarity criterion until there are no more qualifying pixels to be added.

[0072] Based on the algorithm rule information of the above region growing algorithm, the point rules of the target task can be as follows:

[0073] Seed point selection rules: Representative pixels can be manually selected as seed points based on the image content; or automatic methods (such as clustering algorithms based on image features) can be used to determine seed points.

[0074] Similarity judgment rule: define a threshold to measure the similarity between adjacent pixels; when a certain feature of adjacent pixels (such as color difference, texture similarity, etc.) is less than the threshold, they are considered to belong to the same area.

[0075] Region growing rule: Starting from each seed point, adjacent pixels are added to the corresponding region according to the similarity judgment rule; during the growing process, the boundary of the region is continuously updated to ensure that only pixels that meet the similarity criteria are included; when there are no more qualified pixels to be added, the region growing is stopped.

[0076] In practical applications, users need to select or determine the seed point and set the threshold for similarity judgment. Other point rules can be generated by manual configuration or image processing software or custom algorithms. In the process of executing the task, the region growing algorithm will automatically perform region growing and image segmentation based on the point rule information. In the end, an image divided into multiple regions can be obtained.

[0077] However, after the algorithm version is updated, the algorithm rule information of the old version algorithm (first algorithm) may be different from the algorithm rule information of the new version algorithm (second algorithm). For example, in the above example, the similarity criterion in the algorithm rule information of the region growing algorithm may be based on color, while the new version algorithm may be based on grayscale. In this case, the target task cannot directly use the algorithm rule information of the second algorithm for algorithm analysis.

[0078] Therefore, it is necessary to adjust the point rule information of the target task according to the algorithm rule information of the second algorithm so that the target task conforms to the algorithm rule information of the second algorithm. It can also be understood that the point rule information of the target task is regenerated according to the algorithm rule information of the second algorithm so that the target task can be analyzed by the second algorithm.

[0079] S205: Execute the target task based on the second algorithm.

[0080] After adjusting the point rule information of the target task, the target task complies with the algorithm rule information of the second algorithm, so the target task can be executed based on the updated second algorithm.

[0081] It can be seen that the task scheduling method provided in the embodiment of the present application, after receiving the version update instruction for the first algorithm, resets the target task to the initialization state, and adjusts the point rule information of the target task according to the algorithm rule information of the second algorithm, and the target task can be executed based on the second algorithm. There is no need to manually reconfigure the rule information of the task corresponding to the first algorithm, and the target task can be processed based on the updated algorithm, which can greatly save the working time of the staff and thus improve the processing efficiency of the target task.

[0082] In some embodiments, in order to automatically realize the intelligent allocation, scheduling and management of various tasks and resources, the task scheduling system may pre-store default algorithm configuration information in the task scheduling system, and the configuration information may include the correspondence between the task type and the default algorithm. After receiving a new task, the corresponding algorithm may be automatically assigned to the new task for processing according to the task type of the new task. Based on this, after the version of the algorithm is updated, the corresponding relationship in the default algorithm configuration information needs to be modified synchronously, so that after receiving a new task, the corresponding algorithm can be determined based on the updated corresponding relationship.

[0083] As a feasible implementation method, the task scheduling method provided in the embodiment of the present application also includes: replacing the first algorithm in the default algorithm configuration information in the task scheduling system with the second algorithm.

[0084] The default algorithm configuration information indicates the corresponding relationship between the task type and the default algorithm.

[0085] For example, if the first algorithm in the default algorithm configuration information is used to process tasks of type A, then after receiving a new task, if the type of the new task is type A, the task scheduling system will automatically use the first algorithm to process the new task. However, after the first algorithm is updated to the second algorithm, the first algorithm in the default algorithm configuration information in the task scheduling system needs to be replaced with the second algorithm, so that after receiving a new task of type A, the task scheduling system can automatically use the second algorithm to process the new task.

[0086] As a feasible implementation method, the task scheduling method provided in the embodiment of the present application also includes: replacing the first algorithm in the pre-allocated resource information in the task scheduling system with a second algorithm.

[0087] The pre-allocated resource information includes all algorithms loaded in the task scheduling system.

[0088] It is understandable that there may be some algorithms in the task scheduling system that have been loaded but not currently used. These algorithms may be used frequently, and the task scheduling system saves them in memory to avoid frequent loading of these algorithms. They may also be the algorithms required for the next task, and the task scheduling system loads them into memory in advance for easy use.

[0089] Therefore, when the algorithm version is updated, the pre-allocated resource information in the task scheduling system also needs to be updated, and the first algorithm in the pre-allocated resource information in the task scheduling system is replaced with the second algorithm, so that when the task scheduling system generates a new task, it can directly use the algorithm rule information of the second algorithm to generate it.

[0090] It can be seen that the task scheduling method provided in the embodiment of the present application replaces the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information in the task scheduling system with the second algorithm when the algorithm version in the task scheduling system is updated. In this way, when a new task that requires the use of the first algorithm is received, the second algorithm can be assigned to the new task according to the updated pre-allocated resource information and / or the default algorithm configuration information, without the need for the user to manually configure the algorithm.

[0091] In some embodiments, the user may delete or add algorithms in the algorithm repository, and in this case the tasks in the task scheduling system also need to be updated accordingly.

[0092] As a possible implementation, see Figure 3 The task scheduling method provided in the embodiment of the present application further includes the following steps:

[0093] S301: In response to a delete instruction for a first algorithm, determine a target task corresponding to the first algorithm.

[0094] As technology develops and project requirements change, some algorithms may become obsolete or no longer needed by the project. These algorithms may occupy storage space and increase maintenance costs, so users may delete algorithms in the algorithm repository. Or, when refactoring or optimizing a project, in order to improve code quality, reduce redundancy, or improve system architecture, some algorithms that are no longer used or no longer meet the requirements of the new architecture may be deleted.

[0095] After the first algorithm is deleted, the algorithm warehouse sends a deletion instruction for the first algorithm to the task scheduling system. After receiving the deletion instruction for the first algorithm, the task scheduling system determines the target tasks being executed and to be executed that need to be analyzed using the first algorithm.

[0096] S302: Stop executing the target task.

[0097] After the first algorithm is deleted, its corresponding target task cannot continue to be executed. Continuing to execute it may cause system errors, data corruption or performance degradation, and will occupy certain system resources. Therefore, stopping the execution of the target task corresponding to the first algorithm can avoid problems such as system errors, data corruption or performance degradation, ensure the stability and reliability of the system, and release the system's computing resources, memory and storage space, etc.

[0098] S303: Delete the first algorithm, algorithm rule information corresponding to the first algorithm, and cached data.

[0099] The cached data includes intermediate data generated by the algorithm during the execution of the task.

[0100] During the execution of the target task, the task scheduling system will load the first algorithm and the algorithm rule information corresponding to the first algorithm into the system. After the first algorithm is deleted, the task scheduling system also needs to delete the first algorithm and the algorithm rule information corresponding to the first algorithm.

[0101] At the same time, when the target task uses the first algorithm to execute the task, some intermediate data will be generated and saved in the memory, such as: the intermediate calculation results of the steps, which may be the basis for further calculations and need to be temporarily stored in the memory; temporary variables for storing temporary results or status information; loop counters, conditional judgment results, etc. After the first algorithm is deleted, its corresponding cache data also becomes useless data and needs to be deleted to free up memory so that the task scheduling system can execute other tasks.

[0102] S304: Output prompt information.

[0103] The prompt information is used to prompt that the target task has stopped executing.

[0104] It is understandable that if the first algorithm is deleted when there is a target task, it may be that the user made an error operation, causing the target task to stop executing. In order to avoid the task scheduling system being unable to use the first algorithm due to the user's mistaken deletion, the solution provided in this application outputs a prompt message to prompt the user that the target task has stopped executing after deleting the first algorithm. If the user deleted the first algorithm by mistake, the first algorithm can be restored after receiving the prompt message. If the user did not delete it by mistake, the user can reconfigure the target task corresponding to the first algorithm after receiving the prompt message.

[0105] It should be understood that the embodiment of the present application does not impose any limitation on the form of the prompt information. As a feasible implementation method, the prompt information can be text information, voice information, or text + voice information. Exemplarily, as a feasible implementation method, the prompt information can be text information, such as: The target task is stopped during execution due to the deletion of the first algorithm, please handle it in time.

[0106] For example, suppose the feature extraction algorithm in the algorithm warehouse is deleted, and the algorithm warehouse sends a deletion instruction for the feature extraction algorithm to the task scheduling system. After receiving the instruction, the task scheduling system determines the tasks that need to use the feature extraction algorithm, such as image classification tasks, target detection tasks, and image retrieval tasks. The task scheduling system stops executing these target tasks, deletes the feature extraction algorithm, the corresponding algorithm rule information, and the cached data, and then outputs a prompt message: "The image classification task, target detection task, and image retrieval task stopped executing because the feature extraction algorithm was deleted during execution. Please handle it in time."

[0107] It can be seen that the task scheduling method provided in the embodiment of the present application, after receiving a deletion instruction for the first algorithm, first sets the target task corresponding to the first algorithm to a stopped state, and then deletes the first algorithm, the algorithm rule information and cache data corresponding to the first algorithm, releases storage resources to prevent them from occupying storage space, and then outputs a prompt message to prompt the user that the target task has stopped executing, so as to facilitate subsequent processing by the user.

[0108] As a feasible implementation method, the task scheduling method provided in the embodiment of the present application also includes: in response to a deletion instruction for the first algorithm, deleting the algorithm rule information of the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information.

[0109] It can be seen from the above embodiments that in order to load the required algorithms in advance in the task scheduling system, pre-allocated resource information can be set in the system to store all algorithms loaded in the task scheduling system. Therefore, after deleting the first algorithm, it is necessary to delete the first algorithm in the pre-allocated resource information.

[0110] In order to facilitate the automatic generation of new tasks in the task scheduling system, default algorithm configuration information can also be set in the system to store the correspondence between task types and default algorithms. Therefore, after deleting the first algorithm, it is also necessary to delete the first algorithm in the default algorithm configuration information.

[0111] It can be seen that the task scheduling method provided in the embodiment of the present application deletes the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information after receiving the deletion instruction for the first algorithm, which can avoid the task scheduling system from generating a task corresponding to the first algorithm when regenerating a new task based on the pre-allocated resource information and / or the default algorithm configuration information, resulting in the task failing to be successfully executed.

[0112] In some embodiments, the user may add a new algorithm to the algorithm warehouse so that the task scheduling system can use the newly added algorithm to execute tasks. In this case, the algorithm warehouse will send an instruction for the newly added algorithm to the task scheduling system.

[0113] As a possible implementation, see Figure 4 , the task scheduling method provided in the embodiment of the present application also includes:

[0114] S401. In response to a newly added algorithm instruction, obtain a target algorithm corresponding to the newly added algorithm instruction.

[0115] When a new algorithm is trained or a previously deleted algorithm is stored again in the algorithm warehouse, a new algorithm appears in the algorithm warehouse. The task scheduling system may need to use the new algorithm to perform tasks. Therefore, the algorithm warehouse needs to send instructions for the new algorithm to the task scheduling system.

[0116] After receiving the instruction of the newly added algorithm, the task scheduling system obtains the target algorithm corresponding to the instruction of the newly added algorithm from the algorithm warehouse and loads the newly added target algorithm into the task scheduling system.

[0117] S402: When it is determined that there is a task corresponding to the target algorithm, execute the task corresponding to the target algorithm.

[0118] Among them, the task corresponding to the target algorithm is the task that needs to be analyzed using the target algorithm.

[0119] It is understandable that when a user adds an algorithm to the algorithm warehouse, it may be to store a newly trained algorithm in the algorithm warehouse, or it may be to store a previously deleted algorithm in the algorithm warehouse again. If the newly added target algorithm is an algorithm that has been deleted historically, there may be tasks in the task scheduling system that need to be analyzed using the target algorithm.

[0120] Therefore, the solution provided in this application determines whether there is a task corresponding to the target algorithm after obtaining the target algorithm corresponding to the newly added algorithm instruction. If so, it indicates that the target algorithm is the algorithm that was previously deleted and then restored. At this time, the task corresponding to the target algorithm can continue to be executed.

[0121] For example, suppose there are image classification tasks, target detection tasks and image retrieval tasks in the task scheduling system, and they all need to use feature extraction algorithms to perform feature extraction during execution. However, the user deletes the feature extraction algorithm in the algorithm warehouse. The task scheduling system cannot use the feature extraction algorithm, and the image classification task, target detection task and image retrieval task will be set to a stopped execution state, and prompt information will be output in a light-proof manner.

[0122] After the feature extraction algorithm is stored again in the algorithm warehouse, the task scheduling system needs to re-acquire the feature extraction algorithm from the algorithm warehouse. Since there are image classification tasks, target detection tasks and image retrieval tasks in the task scheduling system that require the use of feature extraction algorithms, the task scheduling system can continue to execute image classification tasks, target detection tasks and image retrieval tasks based on the feature extraction algorithm after acquiring the feature extraction algorithm.

[0123] As a feasible implementation method, after obtaining the target algorithm corresponding to the newly added algorithm instruction, the task scheduling method provided in the embodiment of the present application also includes: adding a new target algorithm in the pre-allocated resource information.

[0124] The pre-allocated resource information is a storage of all algorithms already loaded in the task scheduling system in order to load the required algorithms in advance. Therefore, after adding a new target algorithm, it is necessary to add the target algorithm to the pre-allocated resource information so that the target algorithm can be used to execute tasks later.

[0125] It can be seen that the task scheduling method provided in the embodiment of the present application, after adding a new algorithm, determines whether there are tasks in the task scheduling system that need to be analyzed using the target algorithm. If so, the corresponding tasks continue to be executed according to the newly added target algorithm. The user does not need to manually configure the tasks, thereby saving user time and improving task execution efficiency.

[0126] In some embodiments, users can remove or delete algorithms from the algorithm warehouse. Removing an algorithm from the warehouse means that the algorithm can be used and the task scheduling system can use the algorithm to execute tasks, while removing the algorithm from the warehouse means that the algorithm cannot be used.

[0127] As a feasible implementation method, the task scheduling method provided in the embodiment of the present application also includes:

[0128] S11. In response to an algorithm delisting instruction, determine a delisting algorithm corresponding to the algorithm delisting instruction.

[0129] The algorithm warehouse stores a large number of algorithms, one of which may have some problems. If the user does not want the algorithm to be used any longer, the algorithm can be removed from the shelves. At this time, the algorithm warehouse sends a removal instruction to the task scheduling system. After receiving the algorithm removal instruction sent by the algorithm warehouse, the task scheduling system determines the removal algorithm corresponding to the algorithm removal instruction.

[0130] S12. Determine the task corresponding to the delisting algorithm in the task scheduling system.

[0131] The user may remove an algorithm from the shelves because there are some problems with the algorithm and the user does not want the algorithm to be used any longer. Therefore, it is necessary to determine the task corresponding to the removed algorithm in the task scheduling system, that is, the task that needs to be executed using the removed algorithm.

[0132] S13. Stop executing the task corresponding to the delisting algorithm.

[0133] Stop executing the tasks corresponding to the delisting algorithm so that the delisting algorithm will not be used.

[0134] It can be seen that the task scheduling method provided in this embodiment, after receiving the algorithm delisting instruction, determines the delisting algorithm corresponding to the algorithm delisting instruction, and stops executing the tasks corresponding to the delisting algorithm to prevent the delisting algorithm from being continued to be used.

[0135] As a feasible implementation method, the task scheduling method provided in the embodiment of the present application also includes:

[0136] S21. In response to an algorithm listing instruction, determine a listing algorithm corresponding to the algorithm listing instruction.

[0137] After a user removes an algorithm from the algorithm warehouse, if the user needs to reuse the algorithm, the algorithm warehouse sends a release instruction to the task scheduling system. After receiving the algorithm release instruction, the task scheduling system determines the release algorithm corresponding to the algorithm release instruction.

[0138] S22, determining the task corresponding to the listing algorithm from the tasks that have stopped being executed in the task scheduling system.

[0139] Since the listed algorithm is an algorithm that has been stored in the algorithm warehouse and may be an algorithm that has been removed from the shelves in the past, the task corresponding to the algorithm will be stopped in the previous removal operation. Therefore, after the algorithm is put on the shelves again, it is necessary to determine the task corresponding to the listed algorithm from the tasks that have been stopped in the task scheduling system so that the listed algorithm can be used to continue to execute the corresponding task.

[0140] S23. Continue to execute the tasks corresponding to the listing algorithm.

[0141] After determining the listing algorithm corresponding to the algorithm listing instruction, the tasks corresponding to the listing algorithm can be continued to be executed according to the listing algorithm.

[0142] It can be seen that the task scheduling method provided in the embodiment of the present application can determine the tasks corresponding to the put algorithm from the stopped tasks after the algorithm is put on the shelf, and continue to execute the corresponding tasks. The user does not need to manually reconfigure the tasks corresponding to the put algorithm, which can save the user's time and improve the work efficiency of the task scheduling system.

[0143] The present application also provides a task scheduling device, such as Figure 5 As shown, the task scheduling device 50 includes: a determination module 51 , a reset module 52 , an acquisition module 53 , an adjustment module 54 and an execution module 55 .

[0144] Among them, the determination module 51 is used to determine the target task in the task scheduling system in response to the version update instruction for the first algorithm; the target task is the task being executed and to be executed that needs to be analyzed using the first algorithm; the reset module 52 is used to reset the target task to an initialized state; the acquisition module 53 is used to obtain the second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; the adjustment module 54 is used to adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task complies with the algorithm rule information of the second algorithm; the execution module 55 is used to execute the target task based on the second algorithm.

[0145] As a feasible implementation method, the task scheduling device 50 also includes: a replacement module, used to replace the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information in the task scheduling system with a second algorithm; the pre-allocated resource information includes all algorithms loaded in the task scheduling system; the default algorithm configuration information includes the correspondence between the task type and the default algorithm.

[0146] As a feasible implementation method, the determination module 51 is also used to determine the target task corresponding to the first algorithm in response to a deletion instruction for the first algorithm; the execution module 55 is also used to stop executing the target task; the task scheduling device 50 also includes a deletion module, which is used to delete the first algorithm, the algorithm rule information corresponding to the first algorithm and the cached data; the cached data includes the intermediate data generated by the algorithm during the execution of the task; the output module is used to output prompt information, and the prompt information is used to prompt that the target task has stopped executing.

[0147] As a feasible implementation method, the deletion module is also used to delete the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information in response to a deletion instruction for the first algorithm; wherein the pre-allocated resource information includes all algorithms loaded in the task scheduling system; the default algorithm configuration information represents the correspondence between the task type and the default algorithm.

[0148] As a feasible implementation method, the acquisition module 53 is also used to obtain the target algorithm corresponding to the new algorithm instruction in response to the new algorithm instruction; the execution module 55 is also used to execute the task corresponding to the target algorithm when it is determined that there is a task corresponding to the target algorithm, and the task corresponding to the target algorithm is a task that needs to be analyzed using the target algorithm.

[0149] As a feasible implementation method, the task scheduling device 50 further includes a new adding module, which is used to add a target algorithm to the pre-allocated resource information, and the pre-allocated resource information includes all algorithms loaded in the task scheduling system.

[0150] As a feasible implementation method, the determination module 51 is further used to respond to the algorithm delisting instruction and determine the delisting algorithm corresponding to the algorithm delisting instruction; determine the task corresponding to the delisting algorithm from the tasks being executed in the task scheduling system; the execution module 55 is further used to stop executing the task corresponding to the delisting algorithm;

[0151] As a feasible implementation method, the determination module 51 is also used to respond to the algorithm listing instruction and determine the listing algorithm corresponding to the algorithm listing instruction; determine the task corresponding to the listing algorithm from the tasks stopped in the task scheduling system; and the execution module 55 is also used to continue executing the task corresponding to the listing algorithm.

[0152] The embodiment of the present application also provides a task scheduling system, including: an algorithm adaptive processing module, which is used to receive an algorithm change notification and, after determining that the algorithm change notification is a version update instruction for a first algorithm, sends an indication message to a task scheduling module; the task scheduling module is used to determine a target task in the task scheduling system; the target task is an executing and pending task that needs to be analyzed using a first algorithm; the task scheduling module is also used to reset the target task to an initialized state; a synchronization module, which is used to obtain a second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; the task scheduling module is also used to adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task complies with the algorithm rule information of the second algorithm; an engine service module, which is used to execute the target task based on the second algorithm.

[0153] As a feasible implementation method, the task scheduling module is also used to determine the target task corresponding to the first algorithm in response to a deletion instruction for the first algorithm; the engine service module is also used to stop executing the target task; the task scheduling module is also used to delete the first algorithm, the algorithm rule information corresponding to the first algorithm and the cached data; the cached data includes the intermediate data generated by the algorithm during the execution of the task; the output module is used to output prompt information, and the prompt information is used to prompt that the target task has stopped executing.

[0154] As a feasible implementation method, the task scheduling module is also used to delete the first algorithm in the pre-allocated resource information and / or the default algorithm configuration information in response to a deletion instruction for the first algorithm; wherein the pre-allocated resource information includes all algorithms loaded in the task scheduling system; and the default algorithm configuration information represents the correspondence between the task type and the default algorithm.

[0155] As a feasible implementation method, the synchronization module is also used to obtain the target algorithm corresponding to the new algorithm instruction in response to the new algorithm instruction; the engine service module is also used to execute the task corresponding to the target algorithm when it is determined that there is a task corresponding to the target algorithm, and the task corresponding to the target algorithm is a task that needs to be analyzed using the target algorithm.

[0156] As a feasible implementation method, the synchronization module is also used to add a target algorithm to the pre-allocated resource information, and the pre-allocated resource information includes all algorithms loaded in the task scheduling system.

[0157] As a feasible implementation method, the task scheduling module is further used to, in response to the algorithm delisting instruction, determine the delisting algorithm corresponding to the algorithm delisting instruction; determine the task corresponding to the delisting algorithm from the tasks being executed in the task scheduling system; the engine service module is further used to stop executing the task corresponding to the delisting algorithm;

[0158] As a feasible implementation method, the task scheduling module is also used to determine the listing algorithm corresponding to the algorithm listing instruction in response to the algorithm listing instruction; determine the task corresponding to the listing algorithm from the tasks stopped in the task scheduling system; and the engine service module is also used to continue executing the task corresponding to the listing algorithm.

[0159] The present application also provides an electronic device. Figure 6The electronic device 201 includes: one or more memories 211, one or more processors 212, a communication bus 213 and a communication interface 214. The processor 212 is connected to the memory 211 via the communication bus 213; the one or more memories 211 are used to store computer program codes, and the computer program codes include computer instructions; when the one or more processors 212 execute the computer instructions, the electronic device 201 executes the task scheduling method provided in the above embodiment.

[0160] Optionally, the memory 211 may be a non-temporary computer-readable storage medium, for example, the non-temporary computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc., and the embodiments of the present application do not impose any restrictions on this.

[0161] The processor 212 may be a central processing unit (CPU), a general-purpose processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof, and the embodiments of the present application do not impose any limitation on this.

[0162] The communication bus 213 may be an industry standard architecture (ISA) bus, a peripheral component interconnect (PCI) bus, or an extended industry standard architecture (EISA) bus. The communication bus 213 may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Figure 6 Just one thick line is used, but it does not mean that there is only one bus or one type of communication bus.

[0163] The communication interface 214 uses any transceiver or other device for communicating with other devices or communication networks, such as control systems, radio access networks (RAN), wireless local area networks (WLAN), etc.

[0164] The embodiments of the present application also provide a computer program product including one or more instructions, where the one or more instructions are stored in a memory of a computer device and executed by a processor to complete the various processes of the above embodiments.

[0165] An embodiment of the present application also provides a computer-readable storage medium, which includes computer execution instructions. When the computer execution instructions are executed on a computer, the computer executes the task scheduling method provided in the above embodiment.

[0166] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0167] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of modules or units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0168] The units described as separate components may or may not be physically separated, and the components shown as units may be one physical unit or multiple physical units, that is, they may be located in one place or distributed in multiple different places. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0169] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0170] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a device or processor to execute all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, ROM, RAM, disk or CD-ROM and other media that can store program code.

[0171] The above are only specific implementations of the present application, but the protection scope of the present application is not limited thereto, and any changes or substitutions within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A task scheduling method, characterized in that: The method comprises: In response to a version update instruction for the first algorithm, determining a target task in the task scheduling system; the target task is a task being executed or to be executed that needs to be analyzed using the first algorithm; Resetting the target task to an initialization state; Acquire a second algorithm updated from the first algorithm and algorithm rule information of the second algorithm; the algorithm rule information includes basic rules and usage rules of the algorithm; Adjusting the point rule information of the target task according to the algorithm rule information of the second algorithm so that the target task conforms to the algorithm rule information of the second algorithm; the point rule information includes the algorithm and rule information corresponding to each point in the target task, and the rule information corresponding to the point is generated based on the algorithm rule information of the algorithm corresponding to the point; The target task is performed based on the second algorithm.

2. The method according to claim 1, characterized in that: The method further comprises: The first algorithm in the pre-allocated resource information and / or default algorithm configuration information in the task scheduling system is replaced with the second algorithm; the pre-allocated resource information includes all algorithms loaded in the task scheduling system; the default algorithm configuration information includes the correspondence between task types and default algorithms.

3. The method according to claim 1, characterized in that: The method further comprises: In response to a deletion instruction for the first algorithm, determining the target task corresponding to the first algorithm; Stop executing the target task; Deleting the first algorithm, algorithm rule information corresponding to the first algorithm, and cached data; the cached data includes intermediate data generated by the algorithm during the execution of the task; Output a prompt message, where the prompt message is used to prompt that the target task has stopped executing.

4. The method according to claim 1, characterized in that: The method further comprises: In response to a deletion instruction for the first algorithm, the first algorithm is deleted in the pre-allocated resource information and / or the default algorithm configuration information; wherein the pre-allocated resource information includes all algorithms loaded in the task scheduling system; and the default algorithm configuration information represents the correspondence between the task type and the default algorithm.

5. The method according to claim 1, characterized in that The method further comprises: In response to the newly added algorithm instruction, obtaining a target algorithm corresponding to the newly added algorithm instruction; In the case where it is determined that there is a task corresponding to the target algorithm, the task corresponding to the target algorithm is executed, where the task corresponding to the target algorithm is a task that needs to be analyzed using the target algorithm.

6. The method according to claim 5, characterized in that The method further comprises: The target algorithm is newly added to the pre-allocated resource information, and the pre-allocated resource information includes all algorithms loaded in the task scheduling system.

7. The method according to claim 1, characterized in that The method further comprises: In response to an algorithm delisting instruction, determining a delisting algorithm corresponding to the algorithm delisting instruction; Determine the task corresponding to the delisting algorithm from the tasks being executed in the task scheduling system; Stop executing the task corresponding to the delisting algorithm; and / or; In response to an algorithm listing instruction, determining a listing algorithm corresponding to the algorithm listing instruction; Determine the task corresponding to the listing algorithm from the tasks stopped in the task scheduling system; Continue to execute the tasks corresponding to the listing algorithm.

8. A task scheduling device, characterized in that: include: A determination module, configured to determine a target task in a task scheduling system in response to a version update instruction for the first algorithm; The target task is a task being executed or to be executed that needs to be analyzed using the first algorithm; A reset module, used to reset the target task to an initialization state; An acquisition module, used to acquire a second algorithm after the first algorithm is updated and algorithm rule information of the second algorithm; The algorithm rule information includes the basic rules and usage rules of the algorithm; An adjustment module, used for adjusting the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task conforms to the algorithm rule information of the second algorithm; the point rule information includes the algorithm and rule information corresponding to each point in the target task, and the rule information corresponding to the point is generated based on the algorithm rule information of the algorithm corresponding to the point; An execution module is used to execute the target task based on the second algorithm.

9. A task scheduling system, characterized in that: include: The algorithm adaptation processing module is used to receive the algorithm change notification and send indication information to the task scheduling module after determining that the algorithm change notification is a version update instruction for the first algorithm; The task scheduling module is used to determine the target task in the task scheduling system; the target task is the task being executed and to be executed that needs to be analyzed using the first algorithm; The task scheduling module is also used to reset the target task to an initialization state; A synchronization module, used to obtain the second algorithm after the first algorithm is updated and the algorithm rule information of the second algorithm; the algorithm rule information includes the basic rules and usage rules of the algorithm; The task scheduling module is further used to adjust the point rule information of the target task according to the algorithm rule information of the second algorithm, so that the target task conforms to the algorithm rule information of the second algorithm; the point rule information includes the algorithm and rule information corresponding to each point in the target task, and the rule information corresponding to the point is generated based on the algorithm rule information of the algorithm corresponding to the point; An engine service module is used to execute the target task based on the second algorithm.

10. An electronic device, characterized in that: include: one or more processors; one or more memories; The one or more memories are used to store computer program codes, and the computer program codes include computer instructions. When the one or more processors execute the computer instructions, the electronic device executes the task scheduling method as described in any one of claims 1 to 7.

Images