Task scheduling method and system, electronic equipment and storage medium

By distinguishing lazy and instant tasks in the task scheduling method and configuring corresponding execution entities in each family, the problem of difficult task scheduling in the existing technology is solved, and efficient processing of multimodal tasks is achieved and Support for complex business scenarios.

CN119088512APending Publication Date: 2024-12-06SHENZHEN DESHI INTELLIGENT CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411031226.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-30
Publication Date
2024-12-06

Smart Images

  • Figure CN119088512A_ABST
    Figure CN119088512A_ABST
Patent Text Reader

Abstract

The invention provides a task scheduling method and system, electronic equipment and a storage medium, and the method comprises the steps: obtaining task information of a to-be-executed task, the task information comprising a task type of the to-be-executed task and a resource demand required for executing the to-be-executed task; if the task type of the to-be-executed task is an idle task; according to the resource demand, triggering an idle execution entity in a family corresponding to the to-be-executed task to execute the to-be-executed task; if the task type of the to-be-executed task is an instant task; and according to the resource demand, triggering an instant execution entity in the family corresponding to the to-be-executed task to execute the to-be-executed task. According to the task scheduling method disclosed by the invention, optimal configuration of task resources is realized.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

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

[0002] Current task scheduling methods, such as interruptible scheduling and uninterruptible scheduling, can arrange task execution according to the priority of the task and the order of events. However, in a limited process or resource environment, these task scheduling methods often find it difficult to achieve optimal task allocation. Priority inversion may occur or low-priority tasks may block the execution of high-priority tasks. Moreover, most existing conventional distribution methods support the processing of single-mode tasks. This limits the system's ability to meet diversified and complex business needs. Therefore, a more flexible and efficient task distribution solution is urgently needed. Summary of the invention

[0003] The present disclosure provides a task scheduling method, system, electronic device and storage medium to at least solve the above technical problems existing in the prior art.

[0004] According to a first aspect of the present disclosure, a task scheduling method is provided, the method comprising:

[0005] Acquire task information of the task to be executed, wherein the task information includes the task type of the task to be executed and the resource requirements for executing the task to be executed;

[0006] If the task type of the task to be executed is an idle time task;

[0007] According to the resource demand, triggering the lazy execution entity in the cluster corresponding to the task to be executed to execute the task to be executed;

[0008] If the task type of the task to be executed is an immediate task;

[0009] According to the resource demand, an immediate execution entity in the cluster corresponding to the task to be executed is triggered to execute the task to be executed.

[0010] In one possible implementation, the method further includes configuring a plurality of families to obtain a family group;

[0011] The configuration of multiple families to obtain family groups includes:

[0012] Based on the type of the execution entity, a plurality of families are determined; wherein each family is a collection of execution entities of the same type;

[0013] For each cluster, configuring the execution entity to have a preset number of lazy execution entities and immediate execution entities to obtain a configured cluster;

[0014] Based on the configured families, a family group is obtained.

[0015] In one possible implementation, triggering the lazy execution entity in the cluster corresponding to the task to be executed to execute the task to be executed according to the resource demand includes:

[0016] According to the resource requirement, determining in the group at least one group corresponding to the task to be executed and an execution entity log required to execute the task to be executed;

[0017] According to the execution entity log, the lazy execution entity in the at least one cluster is triggered to execute the task to be executed.

[0018] In one possible implementation, triggering the lazy execution entity in the at least one cluster to execute the task to be executed includes:

[0019] determining whether there is an idle execution entity in the at least one cluster;

[0020] If so, triggering the idle execution entity in the idle state to execute the task to be executed;

[0021] If not, the task to be executed is put into a waiting queue until there is a lazy execution entity in an idle state.

[0022] In one embodiment, the method further comprises:

[0023] If the task type of the task to be executed is a scheduled task or a cyclic task;

[0024] According to the resource demand, an immediate execution entity in the cluster corresponding to the task to be executed is triggered to execute the task to be executed.

[0025] According to a second aspect of the present disclosure, there is provided a task scheduling system, the system comprising: a database, a scheduler cluster, a trigger and a group, wherein the group comprises a plurality of groups;

[0026] The database is used to record task information of tasks to be performed, wherein the task information includes the task type of the tasks to be performed and the resource requirements for performing the tasks to be performed;

[0027] The scheduler cluster is used to send the task information of the to-be-executed task to the trigger if the to-be-executed task in the database is monitored;

[0028] The trigger is used to receive the task information of the task to be executed, and assign an execution entity to the task to be executed based on the task information, including: if the task type of the task to be executed is an idle task; based on the resource requirements, triggering the idle execution entity in the family corresponding to the task to be executed to execute the task to be executed; if the task type of the task to be executed is an immediate task; based on the resource requirements, triggering the immediate execution entity in the family corresponding to the task to be executed to execute the task to be executed.

[0029] In one possible implementation, the database is further used to record the real-time status of the execution entities, the execution entities included in each group in the group, and the number of lazy execution entities and immediate execution entities among the execution entities.

[0030] In one possible implementation, the group includes multiple groups, each group being a collection of execution entities of the same type.

[0031] According to a third aspect of the present disclosure, there is provided an electronic device, including:

[0032] at least one processor; and

[0033] a memory communicatively connected to the at least one processor; wherein,

[0034] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method described in the present disclosure.

[0035] According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to cause the computer to execute the method described in the present disclosure.

[0036] The task scheduling method, system, electronic device and storage medium disclosed in the present invention distinguish between lazy tasks and immediate tasks, and configure an immediate execution entity that specifically handles immediate tasks and an idle execution entity that specifically handles lazy tasks in each family. When an immediate task occurs, available resources can be quickly configured to respond, thereby achieving optimal configuration of task resources. By configuring multiple different types of families, the processing of multi-modal tasks can be supported, and complex and changing business scenarios can be coped with.

[0037] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will become readily understood by reading the detailed description below with reference to the accompanying drawings. In the accompanying drawings, several embodiments of the present disclosure are shown in an exemplary and non-limiting manner, in which:

[0039] In the drawings, the same or corresponding reference numerals represent the same or corresponding parts.

[0040] Figure 1 A schematic diagram of an implementation flow of a task scheduling method according to an embodiment of the present disclosure is shown;

[0041] Figure 2 A schematic diagram of an implementation process of a task scheduling system according to an embodiment of the present disclosure is shown;

[0042] Figure 3 A schematic diagram of the structure of an electronic device according to an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0043] In order to make the purpose, features, and advantages of the present disclosure more obvious and easy to understand, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present disclosure.

[0044] The first aspect of the disclosed embodiment provides a task scheduling method. Before implementing the method, it is necessary to first configure multiple families to obtain family groups. Specifically, it includes: determining multiple families based on the type of execution entities; wherein each family is a collection of execution entities of the same type; for each family, configuring the execution entities to a preset number of lazy execution entities and immediate execution entities to obtain a configured family; and obtaining a family group based on the configured family.

[0045] The worker is a physical or logical unit responsible for actually executing tasks, which can be hardware resources, software processes, threads, etc. According to the type of the worker, that is, the type of tasks that can be processed, the workers of the same type are divided into a family, resulting in multiple different families. Within each family, the workers are further configured into a preset number of lazy workers and immediate workers. All families after configuration are called family groups.

[0046] For example, a family group includes a text processing family, an audio processing family, and a video processing family. The text processing family includes execution entities for processing text tasks, such as text parsing, search algorithms, etc. The audio processing family includes execution entities for processing audio tasks, such as audio encoding and decoding, audio recognition, etc. The video processing family includes execution entities for processing video tasks, such as video encoding and decoding, video editing, etc. Taking the text processing family as an example, for the execution entities in the text processing family, 5 are configured as lazy execution entities to process non-urgent text tasks. 2 are configured as immediate execution entities to process high-priority text tasks.

[0047] The above classification of families is only for illustration purposes. In actual applications, families can be created based on specific business scenarios and requirements. They can be created based on macro types such as text processing, audio processing, and video processing. They can also be created based on specific processing types and task requirements, such as creating a text parsing family, a natural language processing family, a text generation family, and other families for text processing.

[0048] Compared with the prior art which can only process single-mode tasks, this embodiment can process multi-mode tasks by introducing the concept of family. By integrating and managing different types of execution entities through family, the variability of execution entities can be greatly improved, and the processing capability of multiple modes (i.e., multiple types of tasks) can be achieved.

[0049] Figure 1 A schematic diagram of the implementation process of a task scheduling method according to an embodiment of the present disclosure is shown. Figure 1 As shown, the method includes:

[0050] Step 101: Obtain task information of a task to be executed, wherein the task information includes a task type of the task to be executed and resource requirements for executing the task to be executed.

[0051] The task information of the task to be executed includes at least the task type of the task to be executed and the resource requirements for executing the task to be executed. Task types include lazy tasks and immediate tasks. Lazy tasks are non-urgent tasks that do not need to be executed immediately. Such tasks can wait until the execution entity is idle or a certain trigger condition is met before starting to execute. Immediate tasks are tasks with the highest priority and need to be executed immediately. The resource requirements are the family information corresponding to the task to be executed and the execution entity log. The execution entity log includes the information of all execution entities required to execute the task to be executed.

[0052] Step 102: If the task type of the task to be executed is an idle time task, trigger an idle time execution entity in the cluster corresponding to the task to be executed to execute the task to be executed according to the resource demand.

[0053] In one possible implementation, this step can be specifically implemented by the following steps: if the task to be executed is an idle task, first determine at least one family corresponding to the task to be executed in the family group according to the family information in the resource requirement. Then search for an idle execution entity that meets the execution entity log in at least one family corresponding to the task to be executed. Finally, execute the task to be executed through these idle execution entities.

[0054] In one possible implementation, it is first necessary to check whether there is an idle time execution entity in the family corresponding to the task to be executed. If so, the idle time execution entity is triggered to execute the task to be executed. If not, the task to be executed is put into a waiting queue to wait for processing. Until an idle time execution entity appears, the task to be executed is executed through it.

[0055] Step 103: If the task type of the task to be executed is an immediate task, trigger an immediate execution entity in the cluster corresponding to the task to be executed to execute the task to be executed according to the resource demand.

[0056] Step 103 is similar to step 102 in that at least one family corresponding to the task to be executed is first determined in the family group according to the family information in the resource requirement. Then, an immediate execution entity that meets the execution entity log is searched in the at least one family corresponding to the task to be executed. Finally, the task to be executed is executed through these immediate entities.

[0057] This method distinguishes between lazy tasks and immediate tasks, and configures an immediate execution entity that specializes in processing immediate tasks and an idle execution entity that specializes in processing lazy tasks in each family. When an immediate task occurs, available resources can be quickly configured to respond, achieving optimal configuration of task resources and being able to cope with complex and changing business scenarios.

[0058] In one possible implementation, the method further includes: if the task type of the task to be executed is a scheduled task or a cyclic task; according to the resource demand, triggering an immediate execution entity in the family corresponding to the task to be executed to execute the task to be executed.

[0059] The task types of tasks to be executed may also include scheduled tasks and recurring tasks. Scheduled tasks refer to tasks that need to be executed at a predetermined time. Recurring tasks refer to tasks that need to be executed repeatedly at fixed time intervals. Since scheduled tasks and recurring tasks usually need to be completed at a specific time point or time interval, in order to ensure the continuity and accuracy of the business process, this solution uses the immediate execution entity to process scheduled tasks and recurring tasks.

[0060] According to another aspect of the present disclosure, a task scheduling system is provided. Figure 2 A schematic diagram of the implementation process of a task scheduling system according to an embodiment of the present disclosure is shown. Figure 2 As shown:

[0061] The system includes: a database, a scheduler cluster, a trigger and a family group, wherein the family group includes multiple families; the database is used to record task information of tasks to be executed, and the task information includes the task type of the tasks to be executed and the resource requirements required to execute the tasks to be executed; the scheduling cluster is used to send the task information of the tasks to be executed to the trigger if it monitors the tasks to be executed in the database; the trigger is used to receive the task information of the tasks to be executed, and assign an execution entity to the tasks to be executed according to the task information, including: if the task type of the tasks to be executed is an idle task; according to the resource requirements, trigger the idle execution entity in the family corresponding to the tasks to be executed to execute the tasks to be executed; if the task type of the tasks to be executed is an immediate task; according to the resource requirements, trigger the immediate execution entity in the family corresponding to the tasks to be executed to execute the tasks to be executed.

[0062] In one possible implementation, Figure 2 As shown: the database also includes an execution entity record table and a family information record table. The execution entity record table is used to record the execution status of the task and the real-time status of the execution entity. The family information record table is used to record the execution entities included in each family in the family group, as well as the number of lazy execution subjects and immediate execution subjects in the execution entities.

[0063] During the process of starting, executing, task exception, and completion of the task to be executed, the status of the task and the status of the execution entity need to be recorded in the execution entity record table so as to view the execution status of the task. The family information record table records the execution entities included in each family, as well as the number of lazy execution entities and immediate execution entities of the execution entity. This allows the trigger to know whether the upper limit of the number of execution entities has been reached. If reached, the task to be executed will be placed in the waiting queue. If not reached, the execution entity can be triggered to execute the task to be executed.

[0064] In one possible implementation, Figure 2 As shown in the figure, the scheduler cluster includes multiple schedulers, which are responsible for managing and tracking tasks in the system. It can maintain one or more task queues or task lists that include tasks to be executed. The scheduler is responsible for the allocation and management of system resources, ensuring that tasks to be executed can obtain the required execution entities, and ensuring that the system can execute tasks efficiently and stably through functions such as task management, task selection, task switching, resource management, performance optimization, exception handling, and log monitoring.

[0065] In one possible implementation, Figure 2As shown, the group includes N groups, namely the first group, the second group, ..., the Nth group. Each group includes the same type of execution entities.

[0066] In order to have a holistic understanding of this solution, the implementation process of this system is described below through a specific embodiment:

[0067] After the task is issued, its task information will be recorded in the task information record table of the database. When the scheduler in the scheduler cluster monitors the appearance of a new task to be executed in the database, it will record it and return it to the trigger. The trigger determines the task type of the task to be executed, the corresponding families, and the required execution entities according to the task information. Then the idle remaining amount of the execution entity in the family is determined. If there is an idle execution entity, one of the idle execution entities is designated to issue the task to the scheduler cluster in real time according to the trigger mechanism, and the scheduler cluster sends the designated idle execution entity to execute the task to be executed. The trigger mechanism is that if the task type of the task to be executed is an idle task, the idle execution entity in the family corresponding to the task to be executed is triggered to execute the task to be executed; if the task type of the task to be executed is an immediate task, the immediate execution entity in the family corresponding to the task to be executed is triggered to execute the task to be executed. If there is no idle execution entity, the cluster task signal is retained, and the working status of the execution entity is monitored in real time. When an idle execution entity appears, the task is issued, so as to achieve the purpose of real-time distribution.

[0068] When the task starts to execute on the execution entity, the execution entity record table in the database starts to record in real time, changing the task status to executing and the execution entity status to busy. If the task execution is abnormal, the execution entity terminates the execution, the task status is changed to abnormal, and the execution entity status is changed to idle. If the execution is completed normally, the task status is recorded as normal, and the execution entity status is changed to idle.

[0069] The task scheduling system of this embodiment distinguishes between lazy tasks and immediate tasks, and configures an immediate execution entity that specifically handles immediate tasks and an idle execution entity that specifically handles lazy tasks in each family. When an immediate task occurs, the trigger can quickly configure available resources to respond, thereby achieving optimal configuration of task resources. By configuring multiple different types of families, the processing of multimodal tasks can be supported, and complex and changing business scenarios can be coped with.

[0070] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device and a readable storage medium.

[0071] Figure 3A schematic block diagram of an example electronic device 800 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0072] like Figure 3 As shown, the device 800 includes a computing unit 801, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 802 or a computer program loaded from a storage unit 808 into a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the device 800 can also be stored. The computing unit 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0073] A number of components in the device 800 are connected to the I / O interface 805, including: an input unit 806, such as a keyboard, a mouse, etc.; an output unit 807, such as various types of displays, speakers, etc.; a storage unit 808, such as a disk, an optical disk, etc.; and a communication unit 809, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 809 allows the device 800 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0074] The computing unit 801 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 801 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 801 performs the various methods and processes described above, such as a task scheduling method. For example, in some embodiments, a task scheduling method may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 808. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 800 via ROM 802 and / or communication unit 809. When the computer program is loaded into RAM 803 and executed by the computing unit 801, one or more steps of a task scheduling method described above may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to perform a task scheduling method in any other appropriate manner (e.g., by means of firmware).

[0075] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0076] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0077] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0078] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0079] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0080] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0081] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0082] In addition, 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 technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one of the features. In the description of the present disclosure, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0083] The above is only a specific embodiment of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any person skilled in the art who is familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present disclosure, which should be included in the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be based on the protection scope of the claims.

Claims

1. A task scheduling method, It is characterized in that The method comprises: Acquire task information of the task to be executed, wherein the task information includes the task type of the task to be executed and the resource requirements for executing the task to be executed; If the task type of the task to be executed is an idle time task; According to the resource demand, triggering the lazy execution entity in the cluster corresponding to the task to be executed to execute the task to be executed; If the task type of the task to be executed is an immediate task; According to the resource demand, an immediate execution entity in the cluster corresponding to the task to be executed is triggered to execute the task to be executed.

2. The method according to claim 1, It is characterized in that The method further includes configuring a plurality of families to obtain a family group; The configuration of multiple families to obtain family groups includes: Based on the type of the execution entity, a plurality of families are determined; wherein each family is a collection of execution entities of the same type; For each cluster, configuring the execution entity to have a preset number of lazy execution entities and immediate execution entities to obtain a configured cluster; Based on the configured families, a family group is obtained.

3. The method according to claim 2, It is characterized in that The triggering, according to the resource demand, of an inert execution entity in the cluster corresponding to the task to be executed to execute the task to be executed includes: According to the resource requirement, determining in the group at least one group corresponding to the task to be executed and an execution entity log required to execute the task to be executed; According to the execution entity log, the lazy execution entity in the at least one cluster is triggered to execute the task to be executed.

4. The method according to claim 3, It is characterized in that The triggering of the lazy execution entity in the at least one cluster to execute the task to be executed includes: determining whether there is an idle execution entity in the at least one cluster; If so, triggering the idle execution entity in the idle state to execute the task to be executed; If not, the task to be executed is put into a waiting queue until there is a lazy execution entity in an idle state.

5. The method according to claim 1, It is characterized in that The method further comprises: If the task type of the task to be executed is a scheduled task or a cyclic task; According to the resource demand, an immediate execution entity in the cluster corresponding to the task to be executed is triggered to execute the task to be executed.

6. A task scheduling system, It is characterized in that The system comprises: a database, a scheduler cluster, a trigger and a group, wherein the group comprises a plurality of groups; The database is used to record task information of tasks to be performed, wherein the task information includes the task type of the tasks to be performed and the resource requirements for performing the tasks to be performed; The scheduler cluster is used to send the task information of the to-be-executed task to the trigger if the to-be-executed task in the database is monitored; The trigger is used to receive the task information of the task to be executed, and assign an execution entity to the task to be executed based on the task information, including: if the task type of the task to be executed is an idle task; based on the resource requirements, triggering the idle execution entity in the family corresponding to the task to be executed to execute the task to be executed; if the task type of the task to be executed is an immediate task; based on the resource requirements, triggering the immediate execution entity in the family corresponding to the task to be executed to execute the task to be executed.

7. The system according to claim 6, It is characterized in that The database is also used to record the real-time status of the execution entities, the execution entities included in each group in the group, and the number of lazy execution entities and immediate execution entities in the execution entities.

8. The system according to claim 6, It is characterized in that The group includes multiple groups, each group being a collection of execution entities of the same type.

9. An electronic device, It is characterized in that include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 5.

10. A non-transitory computer-readable storage medium storing computer instructions, It is characterized in that The computer instructions are used to make a computer execute the method according to any one of claims 1-5.