WO2022257389A1

WO2022257389A1 - Task delay risk detection method, electronic device and storage medium

Info

Publication number: WO2022257389A1
Application number: PCT/CN2021/136007
Authority: WO
Inventors: 笪尚; 谢健; 卢明杰; 邸帅; 卢道和
Original assignee: 深圳前海微众银行股份有限公司
Priority date: 2021-06-09
Filing date: 2021-12-07
Publication date: 2022-12-15
Also published as: CN113326170B; CN113326170A

Abstract

A task delay risk detection method, an electronic device (4), and a storage medium. The task delay risk detection method comprises: acquiring the total number of tasks to be processed that are cached in a cache queue corresponding to each server in a server cluster (101); and when the total number of tasks to be processed that correspond to a first server in the server cluster is not in a first interval corresponding to the first server, outputting first prompt information (102), wherein the first prompt information represents the fact that the first server has a task delay risk; the first interval represents an interval, where the maximum total number of tasks to be processed that are allowed to exist are located, in the cache queue of the server; the first interval is determined on the basis of first information corresponding to each server in the server cluster; and the first information represents the data processing capability of a server corresponding to each tenant during the processing of a historical task.

Description

Task delay risk detection method, electronic device and storage medium

Cross References to Related Applications

This application is based on a Chinese patent application with application number 202110644030.6 and a filing date of June 9, 2021, and claims the priority of the above-mentioned Chinese patent application. The entire content of the above-mentioned Chinese patent application is hereby incorporated by reference into this application.

technical field

The present application relates to the field of computer technology, and in particular to a task delay risk detection method, electronic equipment and a storage medium.

Background technique

With the development of computer technology, more and more technologies (for example, big data, etc.) are applied in the financial field, and the traditional financial industry is gradually transforming into financial technology. It also puts forward higher requirements for technology. In the field of financial technology, for server clusters, it is determined whether the server cluster can meet the computing needs by judging whether the difference between the speed of tasks submitted by users at the peak time and the maximum number of tasks processed per second is less than the set threshold. However, for server clusters that perform large data batch tasks, due to the limited number of tasks submitted by users per unit time and the long response time of a single task, this method cannot accurately determine whether the server cluster can meet the computing requirements. demand, making it impossible to accurately determine whether there is a risk of task delay.

Contents of the invention

In order to solve related technical problems, embodiments of the present application provide a task delay risk detection method, electronic equipment, and a storage medium.

The embodiment of this application provides a task delay risk detection method, including:

Obtain the total number of pending tasks cached in the cache queue corresponding to each server in the server cluster;

When the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server, output first prompt information; wherein,

The first prompt information indicates that the first server has a task delay risk; the first interval indicates the interval of the maximum total number of pending tasks allowed to exist in the cache queue of the server; the first interval is based on the server cluster The first information corresponding to each server is determined; the first information represents the data processing capability of the server corresponding to each tenant when processing historical tasks.

In the above solution, the first information includes historical task information of each tenant; the method further includes:

Based on the historical task information of each tenant corresponding to each server in the server cluster, determine the maximum total amount of tasks for each tenant corresponding to each server, the peak average processing speed corresponding to each server, and the server corresponding to each tenant. The total number and the maximum set delay time of historical tasks corresponding to each tenant; among them, the maximum total amount of tasks represents the maximum total amount of historical tasks waiting to be processed; the peak average processing speed represents the average value of all peaks of task processing speed;

Based on the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, the total number of servers corresponding to each tenant, and the determined maximum set delay time, Determine the first interval corresponding to each server.

In the above solution, the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, the total number of servers corresponding to each tenant, and the determined The maximum setting delay time determines the first interval corresponding to each server, including:

Based on the total number of servers corresponding to each tenant and the maximum total amount of tasks corresponding to each tenant corresponding to each server, determine the first boundary value of the first interval corresponding to the server;

Based on the peak average processing speed corresponding to each server and the determined maximum set delay time, determine a second boundary value of the first section corresponding to the server; the first boundary value is smaller than the second boundary value.

In the above solution, the first information also includes performance parameters of the server; the method further includes:

Based on the total number of servers corresponding to each tenant, the performance parameters of each server corresponding to each tenant, and the maximum total amount of tasks corresponding to each tenant corresponding to each server, determine the number of the first interval corresponding to the server first boundary value.

In the above scheme, the method also includes:

By executing the timed task, the first section corresponding to each server is updated.

In the above scheme, the method also includes:

In the case where the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server, output the number of servers to be added corresponding to the first tenant; wherein, the The first tenant is a tenant corresponding to the first server.

In the above scheme, the method also includes:

Determine the number of servers to be added corresponding to the first tenant based on the first parameter; wherein the first parameter includes:

The total number of tasks to be processed corresponding to each server corresponding to the first tenant;

At least one boundary value of the first interval corresponding to each server corresponding to the first tenant;

The total number of servers corresponding to the first tenant.

In the above scheme, the first parameter also includes:

The set redundancy value corresponding to the first interval.

In the above solution, reading the total number of pending tasks corresponding to each server from the cache queue corresponding to each server in the server cluster includes:

When it is detected that at least one second server in the server cluster has a set load risk, and the set concurrent task threshold corresponding to the at least one second server has been reduced, obtain the corresponding task threshold of each server in the server cluster The total number of pending tasks cached in the cache queue.

The embodiment of the present application also provides an electronic device, including:

The obtaining unit is configured to obtain the total number of pending tasks cached in the cache queue corresponding to each server in the server cluster;

The prompt unit is configured to output first prompt information when the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server; wherein,

An embodiment of the present application also provides an electronic device, including: a processor and a memory configured to store a computer program that can run on the processor, wherein the processor is configured to perform the above tasks when running the computer program Steps in the delay risk detection method.

The embodiment of the present application also provides a storage medium on which a computer program is stored, and when the computer program is executed by a processor, the steps of the above method for detecting task delay risks are implemented.

In the embodiment of the present application, the first interval corresponding to each server is determined based on the first information corresponding to each server in the server cluster; the total number of cached tasks to be processed in the cache queue corresponding to each server in the server cluster is obtained; When the total number of tasks to be processed corresponding to the first server in the cluster is not in the first interval corresponding to the first server, output first prompt information to prompt the first server that there is a risk of task delay; wherein, the first information represents each The data processing capability of the server corresponding to the tenant when processing historical tasks; the first interval represents the interval of the maximum total number of pending tasks allowed to exist in the cache queue of the server. In the above solution, the corresponding first interval is determined based on the processing of historical tasks by the server, and by comparing the total number of tasks to be processed corresponding to the server with the first interval corresponding to the server, the comparison result can be accurately determined. Whether the server can meet the computing demand can accurately determine whether the server has a task delay risk.

Description of drawings

FIG. 1 is a schematic diagram of the implementation process of the task delay risk detection method provided by the embodiment of the present application;

FIG. 2 is a schematic diagram of the implementation process of determining the first interval in the task delay risk detection method provided by the embodiment of the present application;

FIG. 3 is a schematic structural diagram of an electronic device provided in an embodiment of the present application;

FIG. 4 is a schematic diagram of a hardware composition structure of an electronic device provided by an embodiment of the present application.

Detailed ways

For a server cluster, since the maximum number of tasks TPS _total processed by the server cluster per second is relatively a fixed value, it can be obtained by summing the maximum number of tasks processed by each server per second in the server cluster. Therefore, after determining In the case of TPS _job , the speed at which users submit tasks at the peak time, calculate the difference between TPS _total and TPS _job , and judge whether the difference is less than the set threshold. If the difference is less than the set threshold, indicate that the server The speed of the cluster processing task is greater than the speed of the user submitting the task, the server cluster can meet the computing needs of the tenants, and there is no risk of task delay; when the difference is greater than or equal to the set threshold, it indicates the speed of the server cluster processing task If it cannot keep up with the speed at which users submit tasks, the server cluster cannot meet the computing needs of users, and there is a risk of task delay. in,

TPS _job represents the number of tasks submitted by the user per second during the peak time; JOB _g represents the total amount of tasks submitted by the user to the server cluster in one day; φ% represents the percentage of tasks processed during the peak time and the total task volume; θ% Characterize the percentage of peak time to total time.

For scenarios where the response time of a single task is short and the number of tasks submitted by users per unit time is large, the above method can be used to accurately determine whether the server cluster can meet the computing requirements. However, when the server cluster is used to process large data batch tasks, The number of tasks submitted by users per unit time is limited, and the response time of a single task is long. Using the above method, it is impossible to accurately determine whether the server cluster can meet the computing needs, and thus cannot accurately determine whether there is a risk of task delay.

In order to solve the above technical problems, the embodiment of the present application provides a task delay risk detection method, which determines the first interval corresponding to each server based on the first information corresponding to each server in the server cluster; obtains the first interval corresponding to each server in the server cluster The total number of tasks to be processed cached in the corresponding cache queue; when the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server, output the first prompt message to prompt the first interval A server has a task delay risk; wherein, the first information represents the data processing capability of the server corresponding to each tenant when processing historical tasks; the first interval represents the interval of the maximum total number of pending tasks allowed to exist in the cache queue of the server. In the above solution, the corresponding first interval is determined based on the processing of historical tasks by the server, and by comparing the total number of tasks to be processed corresponding to the server with the first interval corresponding to the server, the comparison result can be accurately determined. Whether the server can meet the computing demand can accurately determine whether the server has a task delay risk.

FIG. 1 is a schematic diagram of the implementation process of the task delay risk detection method provided by the embodiment of the present application, wherein the execution subject of the process is an electronic device such as a terminal or a server. As shown in Figure 1, the task delay risk detection method includes:

Step 101: Obtain the total number of pending tasks cached in the cache queue corresponding to each server in the server cluster.

Here, each server in the server cluster is configured with a cache queue. The cache queue is used to cache the received tasks into the cache queue when the server has no idle resources, such as idle threads, to wait for the resources to be released. When idle resources are used, the released idle resources are used to process tasks taken out of the cache queue.

The electronic device can send an acquisition request to each server in the server cluster to request the total number of cached tasks to be processed in the cache queue corresponding to the corresponding server; the electronic device receives the cached pending tasks in the cache queue sent by the server based on the acquisition request total.

The electronic device may also receive the total number of pending tasks cached in the cache queue actively reported by the server. in,

The server can read the total number of pending tasks from their corresponding cache queues, and send the read total number of pending tasks to the electronic device; when the server records the total number of read pending tasks in the cache queue , the total number of recorded tasks to be processed may be sent to the electronic device.

In practical applications, when a server in a server cluster is detected to have a load risk, the set concurrent task threshold corresponding to the corresponding server is usually lowered. Considering that the server in the server cluster has a load risk, the corresponding server has been reduced. In the case of correspondingly setting the concurrent task threshold, the risk of task delay may be caused. In some embodiments, the total number of pending tasks corresponding to each server is read from the cache queue corresponding to each server in the server cluster. ,include:

Here, the electronic device can detect whether each server in the server cluster has a set load risk by running the set script; when it is detected that at least one second server in the server cluster has a set load risk, Reduce the set concurrent task threshold corresponding to the corresponding second server; in the case that the set concurrent task threshold corresponding to at least one second server has been reduced, obtain the cached pending tasks in the cache queue corresponding to each server in the server cluster The total number of tasks, so that the electronic device can determine whether the corresponding server has a task delay risk based on the determined total number of tasks to be processed. Wherein, setting the concurrent task threshold refers to the maximum number of concurrent tasks that can be processed; the set load risk includes at least one of the following:

The task type corresponding to the tenant changes;

Increased number of time-consuming tasks;

The server load is too high;

Failed to execute task.

Task delay risks include one of the following:

The total number of pending tasks cached in the cache queue is too large or too small;

The task execution time exceeds the allowable setting range;

The task delay time is greater than the set delay time.

Step 102: When the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first range corresponding to the first server, output first prompt information; wherein, the first prompt information represents The first server has a task delay risk; the first interval represents the interval of the maximum total number of pending tasks allowed to exist in the cache queue of the server; the first interval is based on the first interval corresponding to each server in the server cluster The first information is determined; the first information represents the data processing capability of the server corresponding to each tenant when processing historical tasks.

Here, the electronic device compares the acquired total number of tasks to be processed corresponding to each server with the first interval corresponding to the corresponding server, and obtains a comparison result. If the comparison result indicates that the total number of tasks to be processed corresponding to the first server is not in the first interval corresponding to the first server, it indicates that the first server has a task delay risk, and outputs first prompt information. Wherein, the first server refers to any server in the server cluster; the total number of tasks to be processed corresponding to the first server is not in the first interval corresponding to the first server means that the total number of tasks to be processed corresponding to the first server is less than the first interval corresponding to the first server The first boundary value of the first section corresponding to a server, or the total number of tasks to be processed corresponding to the first server is greater than the first boundary value of the first section corresponding to the first server.

It should be noted that the first interval is determined before acquiring the total number of tasks to be processed cached in the cache queue corresponding to the server.

In actual application, the first information includes at least the historical task information of each tenant corresponding to the server to determine the first interval corresponding to the server; the first information may also include performance parameters of the server.

In the embodiment of the present application, the corresponding first interval is determined based on the server's processing of historical tasks, and by comparing the total number of tasks to be processed corresponding to the server with the first interval corresponding to the server, it can be accurately determined according to the comparison result Whether the server can meet the computing requirements can accurately determine whether the server has a task delay risk, and if the server has a task delay risk, output the first prompt information to give an early warning of the task delay risk, so that the operation and maintenance personnel to process.

Fig. 2 shows a schematic diagram of the implementation process of determining the first interval in the task delay risk detection method provided by the embodiment of the present application. In some embodiments, the first information includes historical task information of each tenant, and the method also includes include:

Step 201: Based on the historical task information of each tenant corresponding to each server in the server cluster, determine the maximum total amount of tasks of each tenant corresponding to each server, the peak average processing speed corresponding to each server, and the corresponding The total number of servers and the maximum set delay time of historical tasks corresponding to each tenant; where the maximum total amount of tasks represents the maximum total amount of historical tasks waiting to be processed; the peak average processing speed represents the average of all peaks of task processing speed.

Here, the electronic device may collect historical task information corresponding to each tenant corresponding to each server in the server cluster in real time or according to a set time interval. Among them, the historical task information includes the total amount of historical tasks waiting to be processed corresponding to each tenant corresponding to the server at different times, the task processing speed corresponding to the server at different times, and the maximum setting value corresponding to each historical task corresponding to each tenant. Delay time; task processing speed represents the number of historical tasks processed per second.

Here, the electronic device determines the corresponding relationship between the server and the tenant based on the historical task information of each tenant corresponding to each server in the server cluster, and determines the corresponding relationship between the server and the tenant based on the corresponding relationship between the server and the tenant. Total number of servers.

From the historical task information corresponding to each tenant corresponding to the server, the electronic device determines the total amount of historical tasks corresponding to each tenant corresponding to the server at different moments; Among the total amount of historical tasks waiting to be processed, the maximum total amount of historical tasks corresponding to each tenant corresponding to the server is determined to obtain the maximum total amount of historical tasks corresponding to each tenant of the server.

The electronic device determines the task processing speed corresponding to the server at different times from the historical task information corresponding to each tenant corresponding to the server. The task processing speed represents the number of tasks processed per second; based on the task processing speed corresponding to the server at different times , determine the task processing speed curve corresponding to the server; from the task processing speed curve corresponding to the server, determine all the peak values of the task processing speed corresponding to the server; calculate the mean value of all peak values of the task processing speed corresponding to the server, and obtain the Corresponding peak average processing speed.

The historical task information includes the maximum set delay time corresponding to the historical task, and the electronic device determines the maximum set delay time of each historical task corresponding to each tenant corresponding to the server from the historical task information of each tenant corresponding to the server.

Step 202: Based on the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, the total number of servers corresponding to each tenant, and the determined maximum setting The delay time determines the first interval corresponding to each server.

It should be noted that when there are different maximum set delay times in the maximum set delay time of each historical task corresponding to each tenant corresponding to a server, the maximum set delay time of all historical tasks The minimum value is determined as the maximum setting delay time of the historical tasks corresponding to this server.

Considering that there are application scenarios in which one tenant corresponds to multiple servers and multiple tenants correspond to multiple servers in actual applications, when the electronic device determines the maximum total amount of tasks corresponding to each tenant corresponding to each server , based on the server corresponding to each tenant, and based on the maximum total amount of tasks of each tenant corresponding to each server, the maximum total amount of historical tasks waiting to be processed corresponding to the same tenant is summed to obtain the corresponding Maximum task accumulation.

Based on the maximum set delay time of historical tasks corresponding to each server, the maximum task accumulation amount corresponding to each tenant, the total number of servers corresponding to each tenant, and the peak average processing speed corresponding to each server, the electronic device determines the The first interval corresponding to the server.

In actual application, the electronic device counts the maximum cumulative amount of tasks corresponding to each tenant on a daily basis. Based on the maximum cumulative amount of tasks corresponding to each tenant per day, the maximum cumulative amount of tasks corresponding to each tenant within the set period is determined. The first interval corresponding to the server corresponding to the tenant is calculated according to the maximum accumulated amount of tasks corresponding to the tenant within the set period. Wherein, the duration of the setting period is longer than one day, for example, the setting period may be set with a minimum unit of week or month.

In this embodiment, the electronic device can determine the corresponding first interval based on the historical task information corresponding to the server, and detect whether the server has a task delay risk through the first interval determined based on the historical task information, which can improve the task delay risk. accuracy of the test results.

In some embodiments, in step 202, based on the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, and the server corresponding to each tenant The total number and the determined maximum set delay time determine the first interval corresponding to each server, including:

Here, based on the server corresponding to each tenant and the maximum total amount of tasks of each tenant corresponding to each server, the electronic device sums the maximum amount of historical tasks waiting to be processed corresponding to the same tenant to obtain each The maximum task accumulation corresponding to the tenant; based on the maximum task accumulation corresponding to each tenant and the total number of servers corresponding to each tenant, the average number of tasks processed by each server corresponding to each tenant is calculated, and the per-tenant corresponding to the tenant The first boundary value of the first interval corresponding to the server, that is, the minimum value.

In actual application, the first boundary value of the first interval corresponding to each server corresponding to each tenant is calculated based on the following formula:

Among them, LB _gi represents the first boundary value of the first interval of the i-th server corresponding to the g-th tenant; MAX _g represents the maximum task accumulation amount corresponding to the g-th tenant; I _g represents the value of the server corresponding to the g-th tenant total.

The electronic device determines the minimum value of the maximum set delay time of all historical tasks corresponding to each server as the maximum set delay time of the historical task corresponding to the corresponding server; based on the maximum set delay time of the historical task corresponding to each server Time and the peak average processing speed corresponding to each server, and calculate the second boundary value of the first interval corresponding to each server, that is, the maximum value. Wherein, the product of the maximum set delay time and the peak average processing speed of the historical tasks corresponding to the same server is determined as the second boundary value of the first section corresponding to the server.

In actual application, the second boundary value of the first interval corresponding to each server is calculated based on the following formula: UB _gi =TPS _gi ×T _bgi ; where, TPS _g represents the peak value corresponding to the i-th server corresponding to the g-th tenant Average processing speed; T _bgi represents the maximum set delay time of historical tasks corresponding to the i-th server corresponding to the g-th tenant.

In this embodiment, in the process of determining the first interval corresponding to each server, the performance difference of each server is not considered, so the calculation process of calculating the first interval can be simplified, and the efficiency of calculating the first interval can be improved.

Considering that the performance of each server in the server cluster may be different, and the data processing capabilities of different servers corresponding to each tenant may be different, in order to more accurately determine the first boundary value in the first interval, in some embodiments, the The first information also includes performance parameters of the server; the method also includes:

Here, the electronic device determines the performance weight of each server corresponding to each tenant based on the performance parameters of each server corresponding to each tenant; the electronic device determines the performance weight of each server corresponding to each tenant; The maximum total amount of tasks of a tenant, sum the maximum total amount of historical tasks waiting to be processed corresponding to the same tenant, and obtain the maximum accumulated amount of tasks corresponding to each tenant; based on the total number of servers corresponding to each tenant, each tenant The corresponding maximum task accumulation amount and the performance weight of each server corresponding to each tenant determine the first boundary value of the first interval corresponding to each server corresponding to each tenant. Wherein, the performance parameter includes a parameter of a processor of the server and/or a parameter of a memory of the server.

In some embodiments, the electronic device may determine a reference server from all servers corresponding to each tenant; based on the first performance parameter of the reference server corresponding to the tenant and the second performance parameter of the non-reference server, determine the The performance weight of the benchmark server. Wherein, the ratio between the performance weight of the reference server and the performance weight of the non-reference server may be determined based on the ratio between the second performance parameter and the first performance parameter.

In actual application, use the following formula to calculate the first boundary value of the first interval corresponding to each server corresponding to each tenant:

Among them, C _gk represents the performance weight of the k-th server corresponding to the g-th tenant; C _gi represents the performance weight of the i-th server corresponding to the g-th tenant.

For example, when a tenant corresponds to 3 servers, and the performance weight of server 1 is C1, the performance weight of server 2 is 1.5C1, and the performance weight of server 3 is C1, the server 1 corresponding to the tenant corresponds to

It should be noted that, regardless of whether the performance of each server in the server cluster is the same, the method for calculating the second boundary value of the first interval corresponding to the server remains unchanged. That is to say, regardless of whether the first information includes the performance parameter of the server, the method for calculating the second boundary value of the first section corresponding to the server is the same.

Considering that the first interval corresponding to the server will vary with the type of task being processed, the number of tasks and other factors, in order to improve the accuracy of the detection result of the task delay risk, in some embodiments, the method further includes:

Here, the timed task is used to trigger the electronic device to regularly update the first interval corresponding to the server.

In practical applications, the electronic device recalculates the first boundary value and the second boundary value of the first interval corresponding to each server by executing the timing task; based on the recalculated first boundary value and the second boundary value of the first interval value, and update the first section currently corresponding to the corresponding server.

In this embodiment, the first interval is regularly updated, and whether the server has a task delay risk can be regularly evaluated based on the latest task processing capability of the server, which can improve the accuracy of the detection result of the task delay risk.

In some embodiments, the method also includes:

Here, when the electronic device detects that the total number of tasks to be processed corresponding to the first server among the servers corresponding to the first tenant is not in the first interval corresponding to the first server, it determines that in the case of eliminating the risk of task delay, The number of servers to be added corresponding to the first tenant, and the number of servers to be added corresponding to the first tenant is output.

In this embodiment, when the electronic device detects that the total number of tasks to be processed corresponding to the first server is not in the first interval corresponding to the first server, it may output information about the new server corresponding to the tenant when eliminating the risk of task delay. Quantity, so that the operation and maintenance personnel can expand the server cluster; compared with the method that the operation and maintenance personnel determine the data of the new server based on personal experience, it can reduce the need for re-expansion due to the failure to meet the computing needs after the expansion of the server cluster situation occurs.

In order to output the accurate number of servers to be added corresponding to the first tenant, so as to reduce the frequent expansion of the server cluster that cannot meet the computing requirements after expansion, in some embodiments, the method further includes:

The total number of servers corresponding to the first tenant.

In order to improve the stability of the server cluster, a redundancy value Cr is set for the first section of the server; in some embodiments, the first parameter also includes:

The set redundancy value corresponding to the first interval.

Here, when the total number of tasks to be processed by the server is less than the first boundary value of the first interval corresponding to the server, it will lead to peak time resource shortage, resulting in task delays, and even tasks submitted by tenants are rejected by the server; when the server's When the total number of pending tasks is greater than the second boundary value of the first interval corresponding to the server, there will be too many pending tasks in the peak time cache queue, and each newly submitted task must wait for too long, resulting in batch delay; therefore, if the total number of tasks to be processed by the server is not in the first interval corresponding to the server, there is a risk of task delay, and it is necessary to increase the number of servers corresponding to the tenant corresponding to the server in the server cluster to Eliminate the risk of task delays.

In actual application, when the set redundancy value corresponding to the first interval is not obtained, the electronic device determines that the first server has a task delay risk based on the correspondence between the server and the tenant, and determines the The first tenant corresponding to the first server, and all servers corresponding to the first tenant are determined; based on the total number of pending tasks corresponding to each server corresponding to the first tenant, and the first interval corresponding to each server corresponding to the first tenant At least one boundary value of , and the total number of servers corresponding to the first tenant determine the number of servers to be added corresponding to the first tenant.

When the set redundancy value corresponding to the first interval is obtained, the electronic device based on at least one boundary value of the first interval corresponding to the server, the set redundancy value corresponding to the first interval, and the total number of tasks to be processed by the server , to determine whether the server has a task delay risk. Wherein, when the total number of tasks to be processed by the server is less than or equal to the sum of the first boundary value of the corresponding first interval and the set redundancy value, or when the total number of tasks to be processed by the server is greater than or equal to the corresponding first boundary value If there is a difference between the second boundary value of an interval and the set redundancy value, it indicates that the server currently has a task delay risk. which is,

In the case of C _jb ≤ LB+C _r , or in the case of C _jb ≥ UB-C _r , the server has a task delay risk. Among them, C _jb represents the total number of tasks to be processed by the server; LB represents the first boundary value of the first interval corresponding to the server; C _r represents the set redundancy value of the first interval; UB represents the first boundary value of the first interval corresponding to the server. Two boundary values.

In practical applications, for different scenarios, there are different methods for determining the number of servers to be added corresponding to the first tenant. The implementation process of the number of servers to be added corresponding to the tenant:

In the case that the first information corresponding to the server does not include the performance parameters of the server, there is no need to consider the performance difference between the servers, and the number of servers to be added corresponding to the first tenant is determined by the following method:

When the redundancy value of the first interval is not set, when the total number of tasks to be processed corresponding to the first server is less than the first boundary value of the first interval corresponding to the first server, based on the first interval corresponding to the first server The first boundary value of , the total number of servers corresponding to the first tenant, and the total number of tasks to be processed corresponding to the first server determine the number of servers to be added corresponding to the first tenant. In actual application, the electronic device calculates a first difference between the first boundary value of the first interval corresponding to the first server and the total number of tasks to be processed corresponding to the first server, and the calculated first difference corresponds to the first tenant. The number of servers to be added corresponding to the first tenant is determined based on the product of the total number of servers of the first tenant and the quotient of the product and the total number of tasks to be processed corresponding to the first server. That is, by the formula

Calculate the number of servers to be added corresponding to the first tenant; I is the total number of servers corresponding to the first tenant; n represents the number of servers to be added corresponding to the first tenant; C _jb represents the number of servers to be processed corresponding to the first server The total number of tasks.

When the redundancy value of the first interval is not set, when the total number of tasks to be processed corresponding to the first server is greater than the second boundary value of the first interval corresponding to the first server, based on the first interval corresponding to the first server Recalculate the total number of tasks to be processed corresponding to the first server; based on the first boundary value of the first interval corresponding to the first server, the total number of servers corresponding to the first tenant, and recalculate The calculated total number of tasks to be processed corresponding to the first server determines the number of servers to be added corresponding to the first tenant. In practical application, the formula

Calculate the number of servers to be added corresponding to the first tenant, where,

When the redundancy value of the first interval is set, when the total number of tasks to be processed by the first server is less than or equal to the sum of the first boundary value of the corresponding first interval and the set redundancy value, based on the first The first boundary value of the first interval corresponding to the server, the set redundancy value corresponding to the first interval, the total number of servers corresponding to the first tenant, and the total number of tasks to be processed corresponding to the first server determine the corresponding The number of servers to be added. In practice, electronics are based on the formula

Calculate the number of servers to be added corresponding to the first tenant.

When the redundancy value of the first interval is set, when the total number of tasks to be processed corresponding to the first server is greater than or equal to the difference between the second boundary value of the corresponding first interval and the set redundancy value, based on the second Recalculate the total number of tasks to be processed corresponding to the first server based on the first boundary value and the second boundary value of the first interval corresponding to the first server; based on the first boundary value and the first interval of the first interval corresponding to the first server The corresponding set redundancy value, the total number of servers corresponding to the first tenant, and the recalculated total number of pending tasks corresponding to the first server determine the number of servers to be added corresponding to the first tenant. In practical application, the formula

Calculate the number of servers to be added corresponding to the first tenant; where,

When the first information corresponding to the server includes the performance parameters of the server, it is necessary to consider the performance difference between the servers, and determine the number of servers to be added corresponding to the first tenant by the following method:

When the redundancy value of the first interval is not set, when the total number of tasks to be processed corresponding to the first server is less than the first boundary value of the first interval corresponding to the first server, based on the first interval corresponding to the first server The first boundary value and the second boundary value, the total number of servers corresponding to the first tenant, and the total number of tasks to be processed corresponding to each server corresponding to the first tenant determine the number of servers to be added corresponding to the first tenant . In actual application, the electronic device determines the number of servers to be added corresponding to the first tenant through formula (1) and formula (2):

LB _k ≤ C _jbk ≤ UB _k (2)

in,

Indicates the sum of the total number of pending tasks corresponding to each server corresponding to the first tenant after capacity expansion;

Represents the sum of the difference between the first boundary value of the first interval corresponding to each server corresponding to the first tenant before capacity expansion and the total number of corresponding tasks to be processed; C _jbi represents the i-th server corresponding to the first tenant before capacity expansion The total number of tasks to be processed corresponding to the server; C _jbk represents the total number of tasks to be processed corresponding to the kth server; LB _k represents the first boundary value of the first interval corresponding to the kth server; UB _k represents the kth server corresponding to The second boundary value of the first interval of .

When the redundancy value of the first interval is not set, when the total number of tasks to be processed corresponding to the first server is greater than or equal to the difference between the second boundary value of the corresponding first interval and the set redundancy value, based on the second Recalculate the total number of tasks to be processed corresponding to each server corresponding to the first tenant based on the first boundary value and the second boundary value of the first interval corresponding to each server corresponding to the first tenant; The first boundary value and the second boundary value of the first interval corresponding to the server, the total number of servers corresponding to the first tenant, and the recalculated total number of tasks to be processed corresponding to each server corresponding to the first tenant determine the first The number of servers to be added corresponding to the tenant. In actual application, the electronic device determines the number of servers to be added corresponding to the first tenant based on the following formulas (3) to (5):

LB _k ≤ C _jbk ≤ UB _k (4)

When the redundancy value of the first interval is set, when the total number of tasks to be processed by the first server is less than or equal to the sum of the first boundary value of the corresponding first interval and the set redundancy value, based on the first The first boundary value and the second boundary value of the first interval corresponding to the server, the total number of servers corresponding to the first tenant, each server corresponding to the first tenant corresponds to the set redundancy value corresponding to the first interval, and the first tenant The total number of tasks to be processed corresponding to each server determines the number of servers to be added corresponding to the first tenant. In actual application, the electronic device determines the number of servers to be added corresponding to the first tenant through formula (1)' and formula (2), wherein the formula (1)' is as follows:

Wherein, C _ri represents the set redundancy value of the first section corresponding to the i-th server.

When the redundancy value of the first interval is set, when the total number of tasks to be processed corresponding to the first server is greater than or equal to the difference between the second boundary value of the corresponding first interval and the set redundancy value, based on the second Recalculate the total number of tasks to be processed corresponding to each server corresponding to the first tenant based on the first boundary value and the second boundary value of the first interval corresponding to each server corresponding to the first tenant; The first boundary value and the second boundary value of the first interval corresponding to the server, the set redundancy value corresponding to the first interval corresponding to each server corresponding to the first tenant, the total number of servers corresponding to the first tenant, and the recalculated The total number of tasks to be processed corresponding to each server corresponding to the first tenant of the first tenant determines the number of servers to be added corresponding to the first tenant. In actual application, the electronic device determines the number of servers to be added corresponding to the first tenant based on the following formula (3)', formula (4) and formula (5), where the formula (3)' is as follows:

In order to implement the method of the embodiment of the present application, the embodiment of the present application also provides a server, as shown in Figure 3, the electronic device includes:

The obtaining unit 31 is configured to obtain the total number of pending tasks cached in the cache queue corresponding to each server in the server cluster;

The prompt unit 32 is configured to output first prompt information when the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server; wherein,

In some embodiments, the obtaining unit 31 is specifically configured as:

In some embodiments, the first information includes historical task information of each tenant; the electronic device further includes:

The first determining unit is configured to determine, based on the historical task information of each tenant corresponding to each server in the server cluster, the maximum total amount of tasks of each tenant corresponding to each server, the peak average processing speed corresponding to each server, The total number of servers corresponding to each tenant and the maximum set delay time of historical tasks corresponding to each tenant; where the maximum total amount of tasks represents the maximum total amount of historical tasks waiting to be processed; the peak average processing speed represents all of the task processing speed the mean value of the peak value;

The second determination unit is configured to determine based on the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, the total number of servers corresponding to each tenant, and The maximum set delay time for each server is determined to determine the first interval corresponding to each server.

In some embodiments, the second determination unit is specifically configured to:

In some embodiments, the first information further includes server performance parameters; the second determination unit is further configured to: based on the total number of servers corresponding to each tenant, the performance of each server corresponding to each tenant The parameters and the maximum total amount of tasks corresponding to each tenant corresponding to each server determine the first boundary value of the first interval corresponding to the server.

In some embodiments, the electronic device also includes:

The update unit is configured to update the first interval corresponding to each server by executing a scheduled task.

In some embodiments, the electronic device also includes:

An output unit configured to output the number of servers to be added corresponding to the first tenant when the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server ; Wherein, the first tenant is the tenant corresponding to the first server.

In some embodiments, the electronic device also includes:

The third determining unit is configured to determine the number of servers to be added corresponding to the first tenant based on the first parameter; wherein,

The first parameters include:

The total number of servers corresponding to the first tenant.

In some embodiments, the first parameter also includes:

The set redundancy value corresponding to the first interval.

In actual application, each of the above units can be composed of a processor in an electronic device, such as a central processing unit (CPU, Central Processing Unit), a digital signal processor (DSP, Digital Signal Processor), a micro control unit (MCU, Microcontroller Unit) or a Programmable Gate Array (FPGA, Field-Programmable Gate Array) and other implementations. Of course, the processor needs to run the programs stored in the memory to realize the functions of the above-mentioned program modules.

It should be noted that when the electronic device provided in the above embodiment performs task delay risk detection, it only uses the division of the above-mentioned program modules as an example for illustration. In practical applications, the above-mentioned processing can be assigned by different program modules according to needs. , that is, divide the internal structure of the device into different program modules, so as to complete all or part of the processing described above. In addition, the electronic device provided in the above embodiment and the embodiment of the task delay risk detection method belong to the same concept, and the specific implementation process thereof is detailed in the method embodiment, and will not be repeated here.

Based on the hardware implementation of the above program modules, and in order to implement the method of the embodiment of the present application, the embodiment of the present application further provides an electronic device. FIG. 4 is a schematic diagram of the hardware composition structure of the electronic device of the embodiment of the present application. As shown in FIG. 4, the electronic device 4 includes:

Communication interface 41, capable of exchanging information with other devices such as network devices;

The processor 42 is connected to the communication interface 41 to realize information interaction with other devices, and is configured to execute the task delay risk detection method provided by one or more technical solutions above when running a computer program. Instead, the computer program is stored on the memory 43 .

Of course, in actual application, various components in the electronic device 4 are coupled together through the bus system 44 . It will be appreciated that the bus system 44 is configured to enable connection communication between these components. In addition to the data bus, the bus system 44 also includes a power bus, a control bus and a status signal bus. However, for clarity of illustration, the various buses are labeled as bus system 44 in FIG. 4 .

The memory 43 in the embodiment of the present application is configured to store various types of data to support the operation of the electronic device 4 . Examples of such data include: any computer program for operating on the electronic device 4 .

It can be understood that the memory 43 may be a volatile memory or a non-volatile memory, and may also include both volatile and non-volatile memories. Among them, the non-volatile memory can be read-only memory (ROM, Read Only Memory), programmable read-only memory (PROM, Programmable Read-Only Memory), erasable programmable read-only memory (EPROM, Erasable Programmable Read-Only Memory) Only Memory), Electrically Erasable Programmable Read-Only Memory (EEPROM, Electrically Erasable Programmable Read-Only Memory), Magnetic Random Access Memory (FRAM, ferromagnetic random access memory), Flash Memory (Flash Memory), Magnetic Surface Memory , CD, or CD-ROM (Compact Disc Read-Only Memory); magnetic surface storage can be disk storage or tape storage. The volatile memory may be random access memory (RAM, Random Access Memory), which is used as an external cache. By way of illustration and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM, Static Random Access Memory), Synchronous Static Random Access Memory (SSRAM, Synchronous Static Random Access Memory), Dynamic Random Access Memory Memory (DRAM, Dynamic Random Access Memory), synchronous dynamic random access memory (SDRAM, Synchronous Dynamic Random Access Memory), double data rate synchronous dynamic random access memory (DDRSDRAM, Double Data Rate Synchronous Dynamic Random Access Memory), enhanced Synchronous Dynamic Random Access Memory (ESDRAM, Enhanced Synchronous Dynamic Random Access Memory), Synchronous Link Dynamic Random Access Memory (SLDRAM, Sync Link Dynamic Random Access Memory), Direct Memory Bus Random Access Memory (DRRAM, Direct Rambus Random Access Memory) Memory). The memory 43 described in the embodiment of the present application is intended to include but not limited to these and any other suitable types of memory.

The methods disclosed in the foregoing embodiments of the present application may be applied to the processor 42 or implemented by the processor 42 . The processor 42 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the above method can be completed by an integrated logic circuit of hardware in the processor 42 or instructions in the form of software. The aforementioned processor 42 may be a general-purpose processor, DSP, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. The processor 42 may implement or execute various methods, steps, and logic block diagrams disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, and the storage medium is located in the memory 43, and the processor 42 reads the program in the memory 43, and completes the steps of the foregoing method in combination with its hardware.

Optionally, when the processor 42 executes the program, it implements a corresponding process implemented by the terminal in each method of the embodiment of the present application. For the sake of brevity, details are not repeated here.

In an exemplary embodiment, the embodiment of the present application also provides a storage medium, that is, a computer storage medium, specifically a computer-readable storage medium, for example, including a first memory 43 storing a computer program, and the above-mentioned computer program can be processed by the terminal The device 42 is executed to complete the steps described in the foregoing method. The computer-readable storage medium can be memories such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disk, or CD-ROM.

In the several embodiments provided in this application, it should be understood that the disclosed devices and methods may be implemented in other ways. The device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods, such as: multiple units or components can be combined, or May be integrated into another system, or some features may be ignored, or not implemented. In addition, the coupling, or direct coupling, or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be electrical, mechanical or other forms of.

The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units; Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application can be integrated into one processing module, or each unit can be used as a single unit, or two or more units can be integrated into one unit; the above-mentioned integration The unit can be realized in the form of hardware or in the form of hardware plus software functional unit.

Those of ordinary skill in the art can understand that all or part of the steps for realizing the above-mentioned method embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the Including the steps of the foregoing method embodiments; and the foregoing storage medium includes: a removable storage device, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a magnetic disk or an optical disk, etc. A medium on which program code can be stored.

It should be noted that: "first", "second", etc. are used to distinguish similar objects, and not necessarily used to describe a specific order or sequence.

It should be noted that the technical solutions described in the embodiments of the present application may be combined arbitrarily if there is no conflict.

It should be noted that the term "and/or" in the embodiment of the present application is only a kind of association relationship describing associated objects, which means that there may be three kinds of relationships, for example, A and/or B, which can mean: A alone exists , both A and B exist, and B exists alone. In addition, the term "at least one" herein means any combination of any one or more of at least two of a plurality, for example, including at least one of A, B, and C, which may mean including from A, Any one or more elements selected from the set formed by B and C.

The above is only a specific implementation of the application, but the scope of protection of the application is not limited thereto. Anyone familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the application. Should be covered within the protection scope of this application. Therefore, the protection scope of the present application should be determined by the protection scope of the claims.

Claims

A task delay risk detection method, comprising:

Obtain the total number of pending tasks cached in the cache queue corresponding to each server in the server cluster;

When the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server, output first prompt information; wherein,

The first prompt information indicates that the first server has a task delay risk; the first interval indicates the interval of the maximum total number of pending tasks allowed to exist in the cache queue of the server; the first interval is based on the server cluster The first information corresponding to each server is determined; the first information represents the data processing capability of the server corresponding to each tenant when processing historical tasks.
The method according to claim 1, wherein the first information includes historical task information of each tenant; the method further comprises:

Based on the historical task information of each tenant corresponding to each server in the server cluster, determine the maximum total amount of tasks for each tenant corresponding to each server, the peak average processing speed corresponding to each server, and the server corresponding to each tenant. The total number and the maximum set delay time of historical tasks corresponding to each tenant; among them, the maximum total amount of tasks represents the maximum total amount of historical tasks waiting to be processed; the peak average processing speed represents the average value of all peaks of task processing speed;

Based on the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, the total number of servers corresponding to each tenant, and the determined maximum set delay time, Determine the first interval corresponding to each server.
The method according to claim 2, wherein the maximum amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, and the corresponding The total number of servers and the determined maximum set delay time determine the first interval corresponding to each server, including:

Based on the total number of servers corresponding to each tenant and the maximum total amount of tasks corresponding to each tenant corresponding to each server, determine the first boundary value of the first interval corresponding to the server;

Based on the peak average processing speed corresponding to each server and the determined maximum set delay time, determine a second boundary value of the first section corresponding to the server; the first boundary value is smaller than the second boundary value.
The method according to claim 3, wherein the first information also includes performance parameters of the server; the method further includes:

Based on the total number of servers corresponding to each tenant, the performance parameters of each server corresponding to each tenant, and the maximum total amount of tasks corresponding to each tenant corresponding to each server, determine the number of the first interval corresponding to the server first boundary value.
The method according to any one of claims 1 to 4, wherein the method further comprises:

By executing the timed task, the first section corresponding to each server is updated.
The method according to claim 1, wherein the method further comprises:

In the case where the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server, output the number of servers to be added corresponding to the first tenant; wherein, the The first tenant is a tenant corresponding to the first server.
The method according to claim 6, wherein the method further comprises:

Determine the number of servers to be added corresponding to the first tenant based on the first parameter; wherein,

The first parameters include:

The total number of tasks to be processed corresponding to each server corresponding to the first tenant;

At least one boundary value of the first interval corresponding to each server corresponding to the first tenant;

The total number of servers corresponding to the first tenant.
The method according to claim 7, wherein the first parameter further comprises:

The set redundancy value corresponding to the first interval.
The method according to any one of claims 1 to 4, wherein reading the total number of pending tasks corresponding to each server from the cache queue corresponding to each server in the server cluster includes:

When it is detected that at least one second server in the server cluster has a set load risk, and the set concurrent task threshold corresponding to the at least one second server has been reduced, obtain the corresponding task threshold of each server in the server cluster The total number of pending tasks cached in the cache queue.
An electronic device comprising:

The obtaining unit is configured to obtain the total number of pending tasks cached in the cache queue corresponding to each server in the server cluster;

The prompt unit is configured to output first prompt information when the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server; wherein,

The first prompt information indicates that the first server has a task delay risk; the first interval indicates the interval of the maximum total number of pending tasks allowed to exist in the cache queue of the server; the first interval is based on the server cluster The first information corresponding to each server is determined; the first information represents the data processing capability of the server corresponding to each tenant when processing historical tasks.
The electronic device according to claim 10, wherein the first information includes historical task information of each tenant; the electronic device further includes:

The first determining unit is configured to determine, based on the historical task information of each tenant corresponding to each server in the server cluster, the maximum total amount of tasks of each tenant corresponding to each server, the peak average processing speed corresponding to each server, The total number of servers corresponding to each tenant and the maximum set delay time of historical tasks corresponding to each tenant; where the maximum total amount of tasks represents the maximum total amount of historical tasks waiting to be processed; the peak average processing speed represents all of the task processing speed the mean value of the peak value;

The second determination unit is configured to determine based on the maximum total amount of tasks corresponding to each tenant corresponding to each server, the peak average processing speed corresponding to each server, the total number of servers corresponding to each tenant, and The maximum set delay time for each server is determined to determine the first interval corresponding to each server.
The electronic device according to claim 11, wherein the second determining unit is specifically configured as:

Based on the total number of servers corresponding to each tenant and the maximum total amount of tasks corresponding to each tenant corresponding to each server, determine the first boundary value of the first interval corresponding to the server;

Based on the peak average processing speed corresponding to each server and the determined maximum set delay time, determine a second boundary value of the first section corresponding to the server; the first boundary value is smaller than the second boundary value.
The electronic device according to claim 12, wherein the first information further includes performance parameters of the server; the second determining unit is further configured to:

Based on the total number of servers corresponding to each tenant, the performance parameters of each server corresponding to each tenant, and the maximum total amount of tasks corresponding to each tenant corresponding to each server, determine the number of the first interval corresponding to the server first boundary value.
The electronic device according to any one of claims 10 to 13, wherein the electronic device further comprises:

The update unit is configured to update the first interval corresponding to each server by executing a scheduled task.
The electronic device according to claim 10, wherein the electronic device further comprises:

An output unit configured to output the number of servers to be added corresponding to the first tenant when the total number of tasks to be processed corresponding to the first server in the server cluster is not in the first interval corresponding to the first server ; Wherein, the first tenant is the tenant corresponding to the first server.
The electronic device according to claim 15, wherein the electronic device further comprises:

The third determining unit is configured to determine the number of servers to be added corresponding to the first tenant based on the first parameter; wherein,

The first parameters include:

The total number of tasks to be processed corresponding to each server corresponding to the first tenant;

At least one boundary value of the first interval corresponding to each server corresponding to the first tenant;

The total number of servers corresponding to the first tenant.
The electronic device according to claim 16, wherein the first parameter further comprises:

The set redundancy value corresponding to the first interval.
The electronic device according to any one of claims 10 to 13, wherein the acquiring unit is specifically configured as:

When it is detected that at least one second server in the server cluster has a set load risk, and the set concurrent task threshold corresponding to the at least one second server has been reduced, obtain the corresponding task threshold of each server in the server cluster The total number of pending tasks cached in the cache queue.
An electronic device comprising: a processor and a memory for storing a computer program capable of running on the processor,

Wherein, when the processor is used to run the computer program, it executes the steps of the method described in claims 1 to 9 below.
A storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 9 are realized.