Distributed scheduling method supporting multi-tenant multi-time-zone scheduled tasks

By analyzing the data of each time zone and tenant tasks and dynamically adjusting the scheduling strategy and resource allocation, the unreliability and resource waste of traditional task scheduling systems in multi-time zone and multi-instance environments are solved, and efficient and flexible task scheduling and Resource management improves the competitiveness and operational efficiency of the enterprise.

CN119045978AInactive Publication Date: 2024-11-29HANGZHOU JIEJING SCI & TECH
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411547713.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-01
Publication Date
2024-11-29
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Traditional task scheduling systems are difficult to ensure the sequential execution of tasks and efficient utilization of resources in multi-time zones and multi-instance environments. They lack flexible scheduling strategies and real-time data analysis, resulting in unreliable task scheduling, unable to quickly adapt to market changes and customer needs, and affecting corporate competitiveness. and operating costs.

Method used

By obtaining the operation data of each time zone and tenant task scheduling data, analyzing the scheduling strategy evaluation coefficients, dynamically adjusting the scheduling strategy and resource allocation, optimizing the task execution process, and real-time data-driven decision-making.

Benefits of technology

It significantly improves scheduling efficiency and system reliability, supports cross-time zone cooperation, reduces task waiting time, improves overall business process smoothness, reduces operational costs, and enhances user experience and enterprise competitiveness.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119045978A_ABST
    Figure CN119045978A_ABST
Patent Text Reader

Abstract

The invention discloses a distributed scheduling method supporting multi-tenant and multi-time-zone scheduled tasks, relates to the technical field of task scheduling, remarkably improves scheduling efficiency and system reliability through optimization of task execution processes, intelligent resource allocation and real-time data analysis, and meanwhile, the method has good adaptive capacity and is suitable for large-scale popularization and application. And market changes and customer requirements can be flexibly met, cross-time zone cooperation is supported, and the consistency of global services is promoted. The overall competitiveness and sustainable development capability of an enterprise are improved by quantitatively evaluating task performance, enhancing user experience and reducing operation cost, the reliability of task execution is improved by a closed-loop feedback mechanism, a new opportunity for exploring potential values is provided for the enterprise, and the system analyzes time zone operation data of each time zone to improve the efficiency of the enterprise. The priority is effectively determined, and high-efficiency and high-success-rate tasks are scheduled preferentially, so that the execution time is shortened, and the overall scheduling speed is increased.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of task scheduling, and in particular to a distributed scheduling method supporting multi-tenant multi-time zone planned tasks. Background Art

[0002] In modern enterprise environments, task scheduling is a key operation and maintenance activity. Traditional task scheduling systems usually only work effectively in a single time zone, which is difficult to meet the needs of global enterprises and cannot be flexibly scheduled in multiple time zones. In addition, traditional scheduling systems often cannot guarantee the sequential execution of tasks and the efficient use of computing resources in a multi-instance, multi-node environment. They lack effective task execution tracking and retry mechanisms, resulting in unreliable and difficult-to-maintain task scheduling.

[0003] Prior art, such as a data processing method, node and distributed system of a distributed system disclosed in an invention patent application with announcement number CN116302424A, relates to the field of cloud computing technology, including: if a management node receives a database operation request, then multiple scheduling strategies corresponding to the database operation request are determined, and the multiple scheduling strategies are configured according to the database type of multiple stand-alone storage services; a target scheduling strategy is determined among the multiple scheduling strategies, and a target execution node is determined among the multiple execution nodes according to the target scheduling strategy; multiple execution nodes are deployed with stand-alone storage services; and the execution result corresponding to the database operation request returned by the target execution node is received. In this embodiment, multiple scheduling strategies are configured according to the database types of multiple stand-alone storage services, so that multiple database types can be universal, thereby realizing the expansion of the stand-alone storage service into a distributed system, without the need to redesign the distributed architecture for the stand-alone storage service, and improving the efficiency of distributed system development.

[0004] In view of the above scheme, the applicant of the present invention has found that the above technology has at least the following technical problems: 1. The existing technology relies on manual intervention for task scheduling, which may lead to unreasonable task execution order, increase the waiting time and overall completion cycle of the task, and may not be able to effectively identify and adjust the task priority, resulting in some tasks waiting for execution during peak hours, while other tasks occupy resources during off-peak hours, causing resource waste. The scheduling strategies of many traditional systems are static and cannot be adjusted according to real-time data. They lack flexibility. In a rapidly changing market environment, the existing system may not be able to quickly adapt to new tenant needs or time zone changes, resulting in slower business response and affecting competitiveness.

[0005] 2. Existing technologies cannot effectively integrate time zone advantages. Enterprises may miss market opportunities or fail to respond quickly to market demands when promoting global strategies. Teams in different regions lack coordination in task scheduling, which may lead to slow information transmission and inconsistent execution, affecting the efficiency of global business. Lack of effective task execution monitoring makes it impossible to identify task failures or performance problems in a timely manner, resulting in service interruptions or inefficient execution. Due to unreasonable scheduling and uneven resource allocation, enterprises often face higher operating costs, affecting overall economic benefits. Summary of the invention

[0006] In view of the above-mentioned technical deficiencies, the purpose of the present invention is to provide a distributed scheduling method that supports multi-tenant and multi-time zone planning tasks.

[0007] To solve the above technical problems, the present invention adopts the following technical solutions: The present invention provides a distributed scheduling method that supports multi-tenant multi-time zone planning tasks, including: Step 1, acquisition of time zone data: Acquire the time zone operation data corresponding to each time zone in the target enterprise in the current period, thereby analyzing and obtaining the scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise, and analyzing the collection of scheduling strategies corresponding to each time zone in the target enterprise.

[0008] Step 2: Obtaining scheduling data: Obtain the scheduling data corresponding to each planned task of each tenant in each time zone of the target enterprise, and then analyze and obtain the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise.

[0009] Step 3: Analysis of scheduling strategies: According to the scheduling evaluation coefficients corresponding to each planned task of each tenant in each time zone of the target enterprise and the set of scheduling strategies corresponding to each time zone, the scheduling strategies corresponding to each planned task of each tenant in each time zone of the target enterprise are analyzed, and each planned task of each tenant in each time zone of the target enterprise is scheduled according to the corresponding scheduling strategies.

[0010] Step 4, judgment of task scheduling: After the scheduling of each planned task of each tenant in each time zone of the target enterprise is completed, the execution data corresponding to each planned task of each tenant in each time zone of the target enterprise is obtained, so as to analyze and obtain the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise, and judge whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable.

[0011] Preferably, the analysis of the scheduling strategy collection corresponding to each time zone in the target enterprise, the specific analysis process is as follows: the scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise is compared with the scheduling strategy evaluation coefficient corresponding to each scheduling strategy collection in the database. If the scheduling strategy evaluation coefficient corresponding to a time zone in the target enterprise is the same as the scheduling strategy evaluation coefficient corresponding to a scheduling strategy collection in the database, then the scheduling strategy collection in the database is used as the scheduling strategy collection corresponding to the time zone in the target enterprise. In this way, the scheduling strategy collection corresponding to each time zone in the target enterprise is analyzed.

[0012] Preferably, the scheduling strategies corresponding to each planned task of each tenant in each time zone of the target enterprise are analyzed, and the specific analysis process is as follows: the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is compared with the scheduling evaluation coefficients corresponding to each scheduling strategy in the scheduling strategy collection in the corresponding database. If the scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is the same as the scheduling evaluation coefficient corresponding to a scheduling strategy in the scheduling strategy collection in the corresponding database, then the scheduling strategy in the scheduling strategy collection in the corresponding database is used as the scheduling strategy corresponding to each planned task of each tenant in each time zone of the target enterprise. In this way, the scheduling strategies corresponding to each planned task of each tenant in each time zone of the target enterprise are analyzed.

[0013] Preferably, the judgment of whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable is specifically carried out as follows: the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is compared with the task scheduling evaluation coefficient corresponding to the set standard planned task. If the task scheduling evaluation coefficient corresponding to a planned task of a tenant in a certain time zone of the target enterprise is greater than or equal to the task scheduling evaluation coefficient corresponding to the set standard planned task, then it is judged that the execution performance corresponding to the planned task of the tenant in the time zone of the target enterprise is reliable; if the task scheduling evaluation coefficient corresponding to a planned task of a tenant in a certain time zone of the target enterprise is less than the task scheduling evaluation coefficient corresponding to the set standard planned task, then it is judged that the execution performance corresponding to the planned task of the tenant in the time zone of the target enterprise is unreliable. In this way, it is judged whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable.

[0014] The beneficial effects of the present invention are: 1. The present invention provides a distributed scheduling method that supports multi-tenant multi-time zone planning tasks, which significantly improves scheduling efficiency and system reliability by optimizing task execution processes, intelligent resource allocation and real-time data analysis. At the same time, the method has good adaptability, can flexibly respond to market changes and customer needs, support cross-time zone cooperation, and promote consistency of global business. By quantitatively evaluating task performance, the system can implement data-driven decision-making, enhance user experience and reduce operating costs, thereby improving the overall competitiveness and sustainable development capabilities of the enterprise. This closed-loop feedback mechanism not only improves the reliability of task execution, but also promotes continuous optimization and improvement, providing enterprises with new opportunities to explore potential value.

[0015] 2. In the embodiment of the present invention, the system analyzes the time zone operation data of each time zone, effectively determines the priority, and preferentially schedules those tasks with high efficiency and high success rate, thereby reducing the execution time and improving the overall scheduling speed. By dynamically monitoring and adjusting the scheduling strategy, the waiting time of tasks in the execution queue can be effectively reduced, tasks can be completed early, and the overall business process can be smoothed. Different tenants are provided with personalized scheduling strategies and execution plans to ensure that the business needs of each tenant are met and avoid resource conflicts and competition.

[0016] 3. In the embodiment of the present invention, the system can automatically adjust the resource allocation strategy based on the needs and priorities of the tasks. By comparing historical operation data, resources such as CPU and memory are reasonably allocated to maximize the efficiency of resource use. Through detailed monitoring and real-time data feedback, the system identifies inefficient tasks, thereby optimizing or reducing their resource consumption, ensuring that key tasks receive priority support, and supporting task scheduling in multiple time zones. It not only facilitates team collaboration in different regions, but also promotes information exchange and sharing between teams, improves the efficiency of cross-border cooperation, and achieves consistency and effectiveness of global business, enabling enterprises to respond quickly to market changes on a global scale and optimize cross-time zone business processes. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0018] Figure 1 The present invention is a flowchart of the steps for implementing the method. DETAILED DESCRIPTION

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

[0020] Embodiments of the present invention Figure 1 As shown, a distributed scheduling method that supports multi-tenant multi-time zone planning tasks includes: Step 1, acquisition of time zone data: obtaining the time zone operation data corresponding to each time zone in the target enterprise in the current period, thereby analyzing and obtaining the scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise, and analyzing the collection of scheduling strategies corresponding to each time zone in the target enterprise.

[0021] In a specific embodiment, the time zone data includes a time zone offset, a time zone conversion frequency, and an execution frequency corresponding to each type of planned task.

[0022] It should be noted that the time and date information stored in the database is accessed, and the current time zone and time zone offset of a specific region are automatically obtained using the geographic information system API (such as the Google Time Zone API). A monitoring mechanism is set up in the system to record changes in task scheduling in each time zone in real time, including the start time, conversion time, and end time, so as to cumulatively calculate the conversion frequency. The log collection tool (such as ELK Stack) is used to collect and analyze the log information of task execution, and the execution time and frequency of each task are extracted.

[0023] In another specific embodiment, the analysis obtains the scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise. The specific analysis process is as follows: the time zone offset corresponding to each time zone in the target enterprise, the time zone conversion frequency and the execution frequency corresponding to each type of planned task are respectively recorded as , and ,in, Indicates the number corresponding to each time zone. , u is any integer greater than 2, Indicates the number corresponding to each type of planned task. , n is any integer greater than 2, substitute it into the calculation formula The scheduling strategy evaluation coefficients corresponding to each time zone in the target enterprise are obtained ,in, , , They are the standard time zone offset corresponding to the set time zone, the standard time zone conversion frequency, and the standard execution frequency corresponding to the type of scheduled task. , , They are the weight factor corresponding to the set time zone offset, the weight factor corresponding to the time zone conversion frequency, and the weight factor corresponding to the type of planned task execution frequency.

[0024] It should be noted that , , Both are greater than 0 and less than 1.

[0025] It should also be noted that through the summary of a large amount of research data and experimental data, the standard time zone offset corresponding to the time zone, the standard time zone conversion frequency, and the standard execution frequency corresponding to the type of planned tasks are set according to professional institutions and research institutions. At the same time, based on the professional knowledge and research basis of experts in the field, and discussed and confirmed with industry organizations or professional institutions, the experts set the weight factors corresponding to the time zone offset, the weight factors corresponding to the time zone conversion frequency, and the weight factors corresponding to the execution frequency of the type of planned tasks according to their own experience and knowledge.

[0026] In another specific embodiment, the analysis of the scheduling policy collection corresponding to each time zone in the target enterprise, the specific analysis process is as follows: the scheduling policy evaluation coefficient corresponding to each time zone in the target enterprise is compared with the scheduling policy evaluation coefficient corresponding to each scheduling policy collection in the database. If the scheduling policy evaluation coefficient corresponding to a time zone in the target enterprise is the same as the scheduling policy evaluation coefficient corresponding to a scheduling policy collection in the database, then the scheduling policy collection in the database is used as the scheduling policy collection corresponding to the time zone in the target enterprise. In this way, the scheduling policy collection corresponding to each time zone in the target enterprise is analyzed.

[0027] Step 2: Obtaining scheduling data: Obtain the scheduling data corresponding to each planned task of each tenant in each time zone of the target enterprise, and then analyze and obtain the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise.

[0028] In a specific embodiment, the scheduling data includes the number of task dependencies, the number of required computing resources, and the number of conditional judgments.

[0029] It should be noted that the task execution flow chart is constructed, and each planned task and its dependencies are depicted using visualization tools. The number of dependencies is directly calculated through the number of nodes and edges. The use of computing resources is monitored in real time using monitoring software (such as Prometheus or Grafana). Through data collection and statistics, resource usage reports are generated to analyze the resource requirements of various tasks. Static code analysis tools are used to scan the scheduling logic source code to identify the number of conditional judgment statements. This can be achieved by directly analyzing the source code file and extracting keywords such as IF and SWITCH.

[0030] In another specific embodiment, the analysis obtains the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise. The specific analysis process is as follows: the number of task dependencies, the number of required computing resources, and the number of conditional judgments corresponding to each planned task of each tenant in each time zone of the target enterprise are respectively recorded as , and ,in, Indicates the number corresponding to each time zone. , u is any integer greater than 2, Indicates the number corresponding to each tenant. , m is any integer greater than 2, Indicates the number corresponding to each planned task. , v is any integer greater than 2, substitute it into the calculation formula The scheduling evaluation coefficients corresponding to each planned task of each tenant in each time zone of the target enterprise are obtained. ,in, , , They are the number of standard task dependencies, the number of standard required computing resources, and the number of standard condition judgments corresponding to the set planned tasks. , , They are the weight factors corresponding to the number of task dependencies set for the planned tasks, the weight factors corresponding to the number of required computing resources, and the weight factors corresponding to the number of conditional judgments.

[0031] It should be noted that , , Both are greater than 0 and less than 1.

[0032] It should also be noted that through the summary of a large amount of research data and experimental data, the standard task dependency number, the standard required computing resources number, and the standard condition judgment number corresponding to the planned tasks are set according to professional institutions and research institutions. At the same time, based on the professional knowledge and research basis of field experts, they are discussed and confirmed with industry organizations or professional institutions. Experts set the weight factors corresponding to the number of task dependencies of planned tasks, the weight factors corresponding to the number of required computing resources, and the weight factors corresponding to the number of condition judgments based on their own experience and knowledge.

[0033] Step 3: Analysis of scheduling strategies: According to the scheduling evaluation coefficients corresponding to each planned task of each tenant in each time zone of the target enterprise and the set of scheduling strategies corresponding to each time zone, the scheduling strategies corresponding to each planned task of each tenant in each time zone of the target enterprise are analyzed, and each planned task of each tenant in each time zone of the target enterprise is scheduled according to the corresponding scheduling strategies.

[0034] In a specific embodiment, the scheduling strategies corresponding to each planned task of each tenant in each time zone of the target enterprise are analyzed, and the specific analysis process is as follows: the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is compared with the scheduling evaluation coefficients corresponding to each scheduling strategy in the scheduling strategy collection in the corresponding database. If the scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is the same as the scheduling evaluation coefficient corresponding to a scheduling strategy in the scheduling strategy collection in the corresponding database, then the scheduling strategy in the scheduling strategy collection in the corresponding database is used as the scheduling strategy corresponding to each planned task of each tenant in each time zone of the target enterprise. In this way, the scheduling strategies corresponding to each planned task of each tenant in each time zone of the target enterprise are analyzed.

[0035] In the embodiment of the present invention, the system analyzes the time zone operation data of each time zone, effectively determines the priority, and preferentially schedules those tasks with high efficiency and high success rate, thereby reducing the execution time and improving the overall scheduling speed. By dynamically monitoring and adjusting the scheduling strategy, the waiting time of tasks in the execution queue can be effectively reduced, tasks can be completed early, and the overall business process can be smoothed. Different tenants are provided with personalized scheduling strategies and execution plans to ensure that the business needs of each tenant are met and avoid resource conflicts and competition.

[0036] Step 4, judgment of task scheduling: After the scheduling of each planned task of each tenant in each time zone of the target enterprise is completed, the execution data corresponding to each planned task of each tenant in each time zone of the target enterprise is obtained, so as to analyze and obtain the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise, and judge whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable.

[0037] In a specific embodiment, the execution data includes the number of retries, the length of the retry interval, and the failure rate.

[0038] It should be noted that log analysis tools (such as ELK Stack) are used to aggregate task execution logs, find error codes and messages related to retries, analyze the occurrence of retries, extract the number of retries in the records, and clearly record the interval between each retry in the task scheduling strategy. When the task fails, the timestamp of the actual retry is recorded, the time difference between the two retries is calculated, and an execution report is automatically generated after the task is executed. The report contains detailed statistics on success, failure, and retries, from which the failure rate information is extracted.

[0039] In another specific embodiment, the analysis obtains the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise. The specific analysis process is as follows: the number of retries, the retry interval and the failure rate corresponding to each planned task of each tenant in each time zone of the target enterprise are recorded as , and ,in, Indicates the number corresponding to each time zone. , u is any integer greater than 2, Indicates the number corresponding to each tenant. , m is any integer greater than 2, Indicates the number corresponding to each planned task. , v is any integer greater than 2, substitute it into the calculation formula The task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is obtained ,in, , , They are the standard number of retries, standard retry interval, and standard failure rate corresponding to the set scheduled tasks. , , They are the weight factor corresponding to the number of scheduled task retries, the weight factor corresponding to the retry interval, and the weight factor corresponding to the failure rate.

[0040] It should be noted that , , Both are greater than 0 and less than 1.

[0041] It should also be noted that through the summary of a large amount of research data and experimental data, the standard number of retries, standard retry interval duration, and standard failure rate corresponding to the planned tasks are set by professional institutions and research institutions. At the same time, based on the professional knowledge and research basis of experts in the field, they are discussed and confirmed with industry organizations or professional institutions. Experts set the weight factors corresponding to the number of retries of the planned tasks, the weight factors corresponding to the retry interval duration, and the weight factors corresponding to the failure rate based on their own experience and knowledge.

[0042] In another specific embodiment, the determination of whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable is performed as follows: the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is compared with the task scheduling evaluation coefficient corresponding to the set standard planned task. If the task scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is greater than or equal to the task scheduling evaluation coefficient corresponding to the set standard planned task, then the execution performance corresponding to the planned task of the tenant in the time zone of the target enterprise is determined to be reliable. If the task scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is less than the task scheduling evaluation coefficient corresponding to the set standard planned task, then the execution performance corresponding to the planned task of the tenant in the time zone of the target enterprise is determined to be unreliable. In this way, it is determined whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable.

[0043] In the embodiment of the present invention, the system can automatically adjust the resource allocation strategy based on the needs and priorities of the tasks. By comparing historical operation data, resources such as CPU and memory are reasonably allocated, thereby maximizing the efficiency of resource use. Through detailed monitoring and real-time data feedback, the system identifies those inefficient tasks, thereby optimizing or reducing their resource consumption, ensuring that key tasks receive priority support, and supporting task scheduling in multiple time zones. It not only facilitates team collaboration in different regions, but also promotes information exchange and sharing between teams, improves the efficiency of cross-border cooperation, and achieves consistency and effectiveness of global business, enabling enterprises to respond quickly to market changes on a global scale and optimize cross-time zone business processes.

[0044] The present invention provides a distributed scheduling method that supports multi-tenant multi-time zone planning tasks, which significantly improves scheduling efficiency and system reliability by optimizing task execution processes, intelligent resource allocation and real-time data analysis. At the same time, the method has good adaptability, can flexibly respond to market changes and customer needs, support cross-time zone cooperation, and promote consistency of global business. By quantitatively evaluating task performance, the system can implement data-driven decision-making, enhance user experience and reduce operating costs, thereby improving the overall competitiveness and sustainable development capabilities of the enterprise. This closed-loop feedback mechanism not only improves the reliability of task execution, but also promotes continuous optimization and improvement, providing enterprises with new opportunities to explore potential value.

[0045] The above contents are merely examples and explanations of the concept of the present invention. Those skilled in the art may make various modifications or additions to the specific embodiments described or replace them in a similar manner. As long as they do not deviate from the concept of the invention or exceed the scope defined in this specification, they shall all fall within the protection scope of the present invention.

Claims

1. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks, characterized in that: include: Step 1: Acquisition of time zone data: Acquisition of the time zone operation data corresponding to each time zone in the target enterprise in the current period, thereby analyzing and obtaining the scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise, and analyzing the scheduling strategy collection corresponding to each time zone in the target enterprise; Step 2: Obtaining scheduling data: Obtain the scheduling data corresponding to each planned task of each tenant in each time zone of the target enterprise, and then analyze and obtain the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise; Step 3: Analysis of scheduling strategies: According to the scheduling evaluation coefficients corresponding to the planned tasks of each tenant in each time zone of the target enterprise and the set of scheduling strategies corresponding to each time zone, the scheduling strategies corresponding to the planned tasks of each tenant in each time zone of the target enterprise are analyzed, and the planned tasks of each tenant in each time zone of the target enterprise are scheduled according to the corresponding scheduling strategies; Step 4, judgment of task scheduling: After the scheduling of each planned task of each tenant in each time zone of the target enterprise is completed, the execution data corresponding to each planned task of each tenant in each time zone of the target enterprise is obtained, so as to analyze and obtain the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise, and judge whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable.

2. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 1, characterized in that: The time zone data includes a time zone offset, a time zone conversion frequency, and an execution frequency corresponding to each type of planned task.

3. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 2, characterized in that: The analysis obtains the scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise. The specific analysis process is as follows: The time zone offset corresponding to each time zone in the target enterprise, the time zone conversion frequency and the execution frequency corresponding to each type of planned task are recorded as , and ,in, Indicates the number corresponding to each time zone. , u is any integer greater than 2, Indicates the number corresponding to each type of planned task. , n is any integer greater than 2, substitute it into the calculation formula The scheduling strategy evaluation coefficients corresponding to each time zone in the target enterprise are obtained ,in, , , They are the standard time zone offset corresponding to the set time zone, the standard time zone conversion frequency, and the standard execution frequency corresponding to the type of scheduled task. , , They are the weight factor corresponding to the set time zone offset, the weight factor corresponding to the time zone conversion frequency, and the weight factor corresponding to the type of planned task execution frequency.

4. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 3, characterized in that: The analysis target enterprise's corresponding scheduling strategy collection for each time zone is specifically analyzed as follows: The scheduling strategy evaluation coefficient corresponding to each time zone in the target enterprise is compared with the scheduling strategy evaluation coefficient corresponding to each scheduling strategy collection in the database. If the scheduling strategy evaluation coefficient corresponding to a time zone in the target enterprise is the same as the scheduling strategy evaluation coefficient corresponding to a scheduling strategy collection in the database, then the scheduling strategy collection in the database is used as the scheduling strategy collection corresponding to the time zone in the target enterprise. In this way, the scheduling strategy collection corresponding to each time zone in the target enterprise is analyzed.

5. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 1, characterized in that: The scheduling data includes the number of task dependencies, the number of required computing resources and the number of conditional judgments.

6. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 5, characterized in that: The analysis obtains the scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise. The specific analysis process is as follows: The number of task dependencies, the number of required computing resources, and the number of conditional judgments corresponding to each planned task of each tenant in each time zone of the target enterprise are recorded as , and ,in, Indicates the number corresponding to each time zone. , u is any integer greater than 2, Indicates the number corresponding to each tenant. , m is any integer greater than 2, Indicates the number corresponding to each planned task. , v is any integer greater than 2, substitute it into the calculation formula The scheduling evaluation coefficients corresponding to each planned task of each tenant in each time zone of the target enterprise are obtained. ,in, , , They are the number of standard task dependencies, the number of standard required computing resources, and the number of standard condition judgments corresponding to the set planned tasks. , , They are the weight factors corresponding to the number of task dependencies set for the planned tasks, the weight factors corresponding to the number of required computing resources, and the weight factors corresponding to the number of conditional judgments.

7. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 6, characterized in that: The scheduling strategy corresponding to each planned task of each tenant in each time zone of the target enterprise is analyzed, and the specific analysis process is as follows: The scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is compared with the scheduling evaluation coefficient corresponding to each scheduling strategy in the scheduling strategy collection in the corresponding database. If the scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is the same as the scheduling evaluation coefficient corresponding to a scheduling strategy in the scheduling strategy collection in the corresponding database, then the scheduling strategy in the scheduling strategy collection in the corresponding database will be used as the scheduling strategy corresponding to each planned task of each tenant in each time zone of the target enterprise. In this way, the scheduling strategy corresponding to each planned task of each tenant in each time zone of the target enterprise is analyzed.

8. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 1, characterized in that: The execution data includes the number of retries, the length of the retry interval, and the failure rate.

9. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 8, characterized in that: The analysis obtains the task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise. The specific analysis process is as follows: The number of retries, retry interval duration, and failure rate corresponding to each planned task of each tenant in each time zone of the target enterprise are recorded as , and ,in, Indicates the number corresponding to each time zone. , u is any integer greater than 2, Indicates the number corresponding to each tenant. , m is any integer greater than 2, Indicates the number corresponding to each planned task. , v is any integer greater than 2, substitute it into the calculation formula The task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is obtained ,in, , , They are the standard number of retries, standard retry interval, and standard failure rate corresponding to the set scheduled tasks. , , They are the weight factor corresponding to the number of scheduled task retries, the weight factor corresponding to the retry interval, and the weight factor corresponding to the failure rate.

10. A distributed scheduling method supporting multi-tenant multi-time zone planning tasks as claimed in claim 9, characterized in that: The specific judgment process of judging whether the execution performance of each planned task of each tenant in each time zone of the target enterprise is reliable is as follows: The task scheduling evaluation coefficient corresponding to each planned task of each tenant in each time zone of the target enterprise is compared with the task scheduling evaluation coefficient corresponding to the set standard planned task. If the task scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is greater than or equal to the task scheduling evaluation coefficient corresponding to the set standard planned task, then the execution performance corresponding to the planned task of the tenant in the time zone of the target enterprise is determined to be reliable. If the task scheduling evaluation coefficient corresponding to a planned task of a tenant in a time zone of the target enterprise is less than the task scheduling evaluation coefficient corresponding to the set standard planned task, then the execution performance corresponding to the planned task of the tenant in the time zone of the target enterprise is determined to be unreliable. In this way, whether the execution performance corresponding to each planned task of each tenant in each time zone of the target enterprise is reliable is determined.

Citation Information

Cited By

  • Data scheduling method, device and system and storage medium

    CN120011029A