Task scheduling method and device, equipment and medium

Abstract

The invention provides a task scheduling method and device, equipment and a medium, and relates to the technical field of Internet. The method comprises the following steps: determining a to-be-scheduled task from at least one asynchronous task; according to the resource occupation values and the transaction weights corresponding to the plurality of transaction dimensions of the to-be-scheduled task, predicting a resource weight value of processing the to-be-scheduled task by each receipt service node; determining a target receipt service node from the receipt service nodes according to the resource weight and the environment information of the receipt service nodes; the to-be-scheduled task is scheduled to the target receipt service node to execute the to-be-scheduled task, and a target transaction receipt is generated; and pushing the target transaction receipt to the target client, thereby realizing decoupling of processing of the transaction request and generation of the receipt, scheduling the asynchronous task to the optimal receipt service node, improving task processing efficiency, reducing resource waste, ensuring that generation and pushing of the transaction receipt are more timely and accurate, and improving user experience. And the user experience and the overall service quality of the system are improved.

Description

Technical Field

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

[0002] With the continuous development of the financial market, the transaction volume is increasing, and the transaction speed is accelerating. It is crucial to ensure that every transaction can be accurately recorded and fed back to users in a timely manner. At present, managing the generation and push of transaction receipts through an effective task scheduling mechanism can not only improve the efficiency of transaction confirmation, but also enhance the reliability and transparency of the system to meet regulatory requirements.

[0003] In the related art, an evenly distributed task scheduling mechanism is used to generate and push transaction receipts, that is, tasks are evenly distributed to each service node. However, the above-mentioned evenly distributed task scheduling mechanism does not take into account the performance differences of different service nodes, resulting in some service nodes being overloaded or idle, thereby reducing the efficiency of generating and pushing transaction receipts. Summary of the invention

[0004] The present disclosure provides a task scheduling method, apparatus, device and medium to solve one of the technical problems in the related art at least to a certain extent. The technical solution of the present disclosure is as follows:

[0005] According to a first aspect of an embodiment of the present disclosure, there is provided a task scheduling method, which is applied to a receipt system, and includes: determining a task to be scheduled from at least one asynchronous task; wherein the asynchronous task is generated based on a transaction serial number in a received historical transaction request; predicting a resource weight value of each receipt service node in the receipt system for processing the task to be scheduled based on resource occupancy values ​​and transaction weights corresponding to multiple transaction dimensions of the task to be scheduled; determining a target receipt service node from each receipt service node based on the resource weight value and environmental information corresponding to each receipt service node; scheduling the task to be scheduled to the target receipt service node, so as to execute the task to be scheduled through the target receipt service node and generate a target transaction receipt; and pushing the target transaction receipt to a target client, wherein the target client is a client that sends the historical transaction request corresponding to the task to be scheduled.

[0006] According to a second aspect of an embodiment of the present disclosure, there is provided a task scheduling device, which is applied to a return order system, and includes: a first determination module, which is used to determine a task to be scheduled from at least one asynchronous task; wherein the asynchronous task is generated according to a transaction serial number in a received historical transaction request; a prediction module, which is used to predict the resource weight value of each return order service node in the return order system for processing the task to be scheduled according to resource occupancy values ​​and transaction weights corresponding to multiple transaction dimensions of the task to be scheduled; a second determination module, which is used to determine a target return order service node from each return order service node according to the resource weight value corresponding to each return order service node and the environmental information in which it is located; a generation module, which is used to schedule the task to be scheduled to the target return order service node, so as to execute the task to be scheduled through the target return order service node and generate a target transaction return order; a push module, which is used to push the target transaction return order to a target client, wherein the target client is a client that sends a historical transaction request corresponding to the task to be scheduled.

[0007] According to a third aspect of an embodiment of the present disclosure, an electronic device is provided, comprising: a processor; and a memory for storing instructions executable by the processor; wherein the processor is configured to execute the instructions to implement the task scheduling method proposed in the above-mentioned first aspect of the present disclosure.

[0008] According to a fourth aspect of an embodiment of the present disclosure, a computer-readable storage medium is provided. When instructions in the computer-readable storage medium are executed by a processor of an electronic device, the electronic device can execute the task scheduling method proposed in the first aspect of the present disclosure.

[0009] According to a fifth aspect of an embodiment of the present disclosure, a computer program product is provided, including: a computer program, wherein when the computer program is executed by a processor, the task scheduling method as described in the above embodiment of the present disclosure is implemented.

[0010] The technical solution provided by the embodiments of the present disclosure brings at least the following beneficial effects:

[0011] By determining the task to be scheduled from at least one asynchronous task generated according to the transaction serial number in the historical transaction request, and predicting the resource weight value of each return order service node in the return order system for processing the task to be scheduled according to the resource occupancy values ​​and transaction weights corresponding to multiple transaction dimensions of the task to be scheduled, and selecting the target return order service node according to the resource weights of each return order service node in the return order system and the environmental information in which it is located, and scheduling the task to be scheduled to the target return order service node, so that the task to be scheduled is executed through the target return order service node to generate a target transaction return order, the processing of transaction requests and the generation of returns are decoupled, and the asynchronous tasks are scheduled to the best return order service node, which not only improves the processing efficiency of tasks and reduces resource waste, but also ensures that the generation and push of transaction returns are more timely and accurate, thereby enhancing the stability and reliability of the system and meeting the needs in a high-concurrency transaction environment; finally, the generated target transaction return order is pushed to the corresponding target client, so that the timely push of the transaction return order is realized, and the user experience and the overall service quality of the system are improved.

[0012] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The drawings herein are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description are used to explain the principles of the present disclosure, and do not constitute improper limitations on the present disclosure.

[0014] Figure 1 It is a flowchart of the task scheduling method shown in the first embodiment of the present disclosure.

[0015] Figure 2 It is a flowchart of a task scheduling method shown in the second embodiment of the present disclosure.

[0016] Figure 3 It is a flowchart of a task scheduling method shown in the third embodiment of the present disclosure.

[0017] Figure 4 It is a flowchart of a task scheduling method shown in the fourth embodiment of the present disclosure.

[0018] Figure 5 It is a flowchart of a task scheduling method shown in the fifth embodiment of the present disclosure.

[0019] Figure 6 It is a flowchart of a task scheduling method shown in the sixth embodiment of the present disclosure.

[0020] Figure 7 It is a schematic diagram of the task scheduling principle shown in an embodiment of the present disclosure.

[0021] Figure 8 It is a schematic diagram of the task scheduling process shown in an embodiment of the present disclosure.

[0022] Fig. 9 It is a structural diagram of a task scheduling device shown in the seventh embodiment of the present disclosure.

[0023] Fig.10 It is a schematic structural diagram of an electronic device shown in an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION

[0024] In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings.

[0025] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the present disclosure as detailed in the appended claims.

[0026] It should be noted that the acquisition, storage, use, and processing of data in the technical solution disclosed in this disclosure are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0027] It should also be noted that the information (including but not limited to user device information, user personal information, etc.), data (including but not limited to data used for analysis, stored data, displayed data, etc.) and signals involved in this disclosure are all authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant laws, regulations and standards of relevant countries and regions.

[0028] It should also be noted that in the embodiments of the present disclosure, certain software, components, models and other existing solutions in the industry may be mentioned, which should be regarded as exemplary. Their purpose is only to illustrate the feasibility of implementing the technical solution of the present disclosure, but it does not mean that the applicant has or will necessarily use the solution.

[0029] In the related technology, a load-balanced task scheduling mechanism can also be used to generate and push transaction receipts, that is, the task scheduler decides when to take out the receipt push task from the push queue according to the current system load and resource conditions. However, the above-mentioned load-balanced task scheduling mechanism cannot accurately perceive the current load conditions of the service node in real time, which may cause a large number of tasks to be scheduled to the same service node at the same time, resulting in excessive processing pressure on the service node, and may cause the task processing to take too long, affecting the customer experience. In addition, since the field of electronic receipts mostly sets batch tasks based on customers or branches, but the amount of electronic receipts changes dynamically, it affects the execution efficiency. When executing push tasks on effective machines, the weight value cannot be adjusted dynamically, which will prolong the push time and affect the customer experience.

[0030] The following describes the task scheduling method, apparatus, device and medium of the embodiments of the present disclosure with reference to the accompanying drawings.

[0031] Figure 1 It is a flowchart of the task scheduling method shown in the first embodiment of the present disclosure. It should be noted that the task scheduling method is applied to the receipt system.

[0032] like Figure 1 As shown, the task scheduling method may include the following steps S11 to S15.

[0033] In step S11, a task to be scheduled is determined from at least one asynchronous task.

[0034] Among them, the asynchronous task is generated according to the transaction serial number in the received historical transaction request.

[0035] In order to achieve decoupling of transaction request and transaction receipt generation, in an embodiment of the present disclosure, a task to be scheduled is determined from at least one asynchronous task.

[0036] In order to improve the accuracy of determining the tasks to be scheduled, as a possible implementation manner, the tasks to be scheduled are determined according to the execution status of each asynchronous task in at least one asynchronous task.

[0037] As an example, the execution status of at least one asynchronous task is queried, and for any asynchronously executed task, in response to the execution status of any asynchronous task being unexecuted, any asynchronous task is treated as a task to be scheduled.

[0038] That is to say, in order to track and process the tasks to be scheduled among at least one asynchronous task, the return ticket system can periodically check the execution status of at least one asynchronous task. When it is found that the execution status of any asynchronous task is marked as "not executed", the return ticket system can identify the asynchronous task as a task to be scheduled.

[0039] As another possible implementation manner, the task to be scheduled is determined according to the priority of each asynchronous task in at least one asynchronous task.

[0040] As an example, the receipt system can determine the priority of each asynchronous task based on the deadline of each asynchronous task in at least one asynchronous task. For example, an asynchronous task close to the deadline can be assigned a higher priority to ensure that the asynchronous task is completed within the specified time; then, based on the priority of each asynchronous task, determine the task to be scheduled from the asynchronous tasks.

[0041] In step S12, based on the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled is predicted.

[0042] In order to avoid uneven resource allocation, as a possible implementation method, when predicting the ability of each service node in the return order system to handle the tasks to be scheduled, multiple key transaction dimensions of the task are comprehensively considered, such as transaction type, transaction amount, transaction frequency, transaction time, etc. These transaction dimensions are directly related to the resource occupancy. At the same time, combined with the relative importance or priority of each transaction dimension (i.e., transaction weight), the resource weight value required by each return order service node when executing the tasks to be scheduled can be more accurately estimated.

[0043] In step S13, a target receipt service node is determined from among the receipt service nodes according to the resource weight values ​​corresponding to the receipt service nodes and the environment information in which they are located.

[0044] In order to optimize resource allocation and ensure that tasks are processed efficiently, as a possible implementation method, the current load situation of each service node in the return order system is perceived in real time. Based on the current load situation perceived in real time, the resource weight value of each service node is dynamically adjusted. According to the resource weight value of each service node and the environmental information in which it is located, the target return order node for processing the task to be scheduled is determined.

[0045] In step S14, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate a target transaction receipt.

[0046] In order to improve the execution efficiency of tasks, as an example, the tasks to be scheduled are written into the task queue, and the tasks are read from the task queue in sequence, so that the tasks are executed through the corresponding target receipt service node to generate the corresponding target transaction receipt.

[0047] In step S15, the target transaction receipt is pushed to the target client.

[0048] The target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0049] In order to improve the user experience, as an example, after the target transaction receipt is generated, the target transaction receipt is automatically pushed to the corresponding target client, where the target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0050] In summary, by determining the task to be scheduled from at least one asynchronous task generated according to the transaction serial number in the historical transaction request, and predicting the resource weight value of each return order service node in the return order system for processing the task to be scheduled according to the resource occupancy value and transaction weight corresponding to multiple transaction dimensions of the task to be scheduled, and selecting the target return order service node according to the resource weight value of each return order service node in the return order system and the environmental information in which it is located, and scheduling the task to be scheduled to the target return order service node, so as to execute the task to be scheduled through the target return order service node and generate the target transaction return order, the processing of transaction requests and the generation of return orders are decoupled, and the asynchronous tasks are scheduled to the best return order service node, which not only improves the processing efficiency of tasks and reduces resource waste, but also ensures that the generation and push of transaction return orders are more timely and accurate, thereby enhancing the stability and reliability of the system and meeting the needs in a high-concurrency transaction environment; finally, the generated target transaction return order is pushed to the corresponding target client, so as to realize the timely push of transaction return orders and improve the user experience and the overall service quality of the system.

[0051] The present disclosure provides another task scheduling method. Figure 2 It is a flowchart of a task scheduling method shown in the second embodiment of the present disclosure.

[0052] It should be noted that the task scheduling method is applied to the receipt system. The task scheduling method can be executed alone, or it can be executed in combination with any embodiment of the present disclosure or a possible implementation method in the embodiment, or it can be executed in combination with any technical solution in the related technology. The embodiment of the present disclosure does not limit this.

[0053] like Figure 2 As shown, the task scheduling method may include the following steps S21 to S27.

[0054] In step S21, a task to be scheduled is determined from at least one asynchronous task.

[0055] Among them, the asynchronous task is generated according to the transaction serial number in the received historical transaction request.

[0056] In step S22, based on the resource occupancy values ​​and transaction weights corresponding to multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled is predicted.

[0057] In step S23, the environmental index value of each receipt service node is determined according to the environmental information of each receipt service node.

[0058] Among them, the environmental indicator value is used to indicate the stability of the environment in which the corresponding receipt service node is located.

[0059] In order to more accurately determine which return order service nodes can provide more stable services in the current environment, as a possible implementation method, multiple environmental indicator values ​​are calculated based on the environmental information of each return order service node. The environmental indicator values ​​are used to indicate the stability of the environment in which the corresponding return order service node is located. The environmental indicator values ​​include, for example, the temperature, humidity, network delay rate, network security, power supply stability (voltage fluctuation, power outage frequency) of the environment in which each return order service node is located.

[0060] In step S24, at least one first candidate receipt service node is determined from among the receipt service nodes according to the environmental indicator value of each receipt service node.

[0061] In order to improve the stability of the service, as an example, from multiple receipt service nodes of the receipt system, a receipt service node with a relatively stable environment and a low failure rate is selected as the first candidate receipt service node.

[0062] In step S25, a target receipt service node is determined from at least one first candidate receipt service node according to the resource weight value of each receipt service node.

[0063] In order to achieve accurate allocation of resources and avoid resource waste and overload, as a possible implementation method, a receipt service node with a stable environment and high resource utilization efficiency is selected as the target receipt service node.

[0064] As an example, based on the current resource remaining value and resource weight value of each first candidate receipt service node, it is determined whether there is at least one second candidate receipt service node in at least one first candidate receipt service node; wherein the current resource remaining value of the second candidate receipt service node is greater than the resource weight value; in response to the existence of at least one second candidate receipt service node, based on the difference between the current resource remaining value and the resource weight value of each second candidate receipt service node, a target receipt service node is determined from at least one second candidate receipt service node.

[0065] That is to say, among the first candidate receipt service nodes with stable environment and low failure rate, further comparison is made based on the current resource remaining amount and resource weight value of the first candidate receipt service nodes to identify the second candidate nodes with sufficient resources and capable of effectively carrying new tasks; subsequently, by calculating the difference between the resource remaining amount and the resource weight value of these second candidate nodes, the target receipt service nodes with the highest resource utilization efficiency and the most suitable for processing the tasks to be scheduled are accurately selected.

[0066] As another example, in response to the absence of at least one second candidate receipt service node, the task to be scheduled is written into a delay queue; the current resource remaining values ​​of each first candidate receipt service node are looped through until the target receipt service node for processing the task in the delay queue is reached.

[0067] That is to say, in order to avoid resource overload, when no second candidate receipt service node that meets the conditions is found (i.e., a node with a resource surplus value greater than the resource weight value), the task to be scheduled will be temporarily stored in the delay queue and wait. Subsequently, the system will continuously monitor and cyclically check the resource surplus of the first candidate service node until a target receipt service node that can process the task in the delay queue is found, at which time the task will be taken out of the delay queue for scheduling and execution.

[0068] In step S26, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate a target transaction receipt.

[0069] In step S27, the target transaction receipt is pushed to the target client.

[0070] The target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0071] In summary, the environmental index value of each return order service node is determined according to the environmental information of each return order service node; at least one first candidate return order service node is determined from each return order service node according to the environmental index value of each return order service node; and the target return order service node is determined from at least one first candidate return order service node according to the resource weight value of each first candidate return order service node. Therefore, by comprehensively considering the environmental indicators and resource weight values ​​of each return order service node, the target return order service node that is most suitable for processing the return order task can be accurately screened out, ensuring that the task to be scheduled is assigned to the node with the best environment and the highest resource utilization efficiency, thereby improving the stability and efficiency of task processing, reducing the risk of processing delays or failures caused by poor environment or uneven resource allocation, and ultimately improving the overall service quality and user experience.

[0072] The present disclosure provides another task scheduling method. Figure 3It is a flowchart of a task scheduling method shown in the third embodiment of the present disclosure.

[0073] It should be noted that the task scheduling method is applied to the receipt system. The task scheduling method can be executed alone, or it can be executed in combination with any embodiment of the present disclosure or a possible implementation method in the embodiment, or it can be executed in combination with any technical solution in the related technology. The embodiment of the present disclosure does not limit this.

[0074] like Figure 3 As shown, the task scheduling method may include the following steps S31 to S37.

[0075] In step S31, a task to be scheduled is determined from at least one asynchronous task.

[0076] Among them, the asynchronous task is generated according to the transaction serial number in the received historical transaction request.

[0077] In step S32, feature extraction is performed on the task to be scheduled to obtain target features of each transaction dimension of the task to be scheduled.

[0078] In order to improve the processing efficiency and resource utilization of the system, as a possible implementation method, for any return order service node, the historical resource data of the service node is queried according to the target characteristics of the task to be scheduled to obtain the resource occupancy value that matches the target characteristics of each transaction dimension, thereby providing accurate resource prediction for task scheduling.

[0079] As an example, by extracting features from the scheduled tasks, multiple transaction dimensions of the tasks can be converted into quantifiable features, thereby predicting the resource usage required to process the tasks. The multiple transaction dimensions include: transaction type, transaction amount, transaction frequency, transaction time, etc.

[0080] In step S33, for any receipt service node, according to the target feature of any transaction dimension, the historical resource data of any receipt service node is queried to obtain the resource occupancy value matching the target feature of any transaction dimension.

[0081] As an example, for each receipt service node, the historical resource data of the service node is queried according to the target features of the extracted transaction dimension, where the historical resource data records the actual resource usage when historically processing similar transactions, such as CPU usage, memory usage, disk I / O, etc., and records that match the target features of the transaction dimension of the current task to be scheduled are found from the historical resource data to obtain the resource usage values ​​corresponding to the target features of each transaction dimension. For example, the average CPU usage of transfer tasks is 20%, the average memory usage of small transactions is 100MB, and the average network bandwidth usage of tasks processed during the night period is 2Mbps.

[0082] In step S34, based on the resource occupancy values ​​and transaction weights corresponding to multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled is predicted.

[0083] In order to dynamically and accurately determine the resource weight value of each return service node for processing the tasks to be scheduled, as an example, the resource occupancy values ​​of multiple transaction dimensions are weighted according to the transaction weights corresponding to multiple transaction dimensions to obtain the resource weight value of each return service node for processing the tasks to be scheduled.

[0084] For example, multiple transaction dimensions include: transaction type (transfer), transaction amount (small amount), transaction frequency (high frequency), transaction time (night), number of accounts (single account), region (local), and business type (conventional type). Among them, the transaction weight of transaction type (transfer) is 0.3, the transaction weight of transaction amount (small amount) is 0.1, the transaction weight of transaction frequency (high frequency) is 0.2, the transaction weight of transaction time (night) is 0.1, the transaction weight of number of accounts (single account) is 0.1, the transaction weight of region (local) is 0.05, and the transaction weight of business type ( The transaction weight of regular type) is 0.05, the average CPU usage of transfer tasks is 20%, the average memory usage of small transactions is 100MB, the average disk I / O of high-frequency transactions is 5 times / second, the average network bandwidth usage of night-time processing tasks is 2Mbps, the average processing time of single-account transactions is 2 seconds, the average CPU usage of local transactions is 15%, and the average memory usage of regular business is 120MB. The resource weight value = (6% + 20MB + 0.5 times / second + 0.4Mbps + 0.2 seconds + 0.75% + 6MB = 27.65).

[0085] In step S35, a target receipt service node is determined from among the receipt service nodes according to the resource weight values ​​corresponding to the receipt service nodes and the environment information in which they are located.

[0086] In step S36, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate a target transaction receipt.

[0087] In step S37, the target transaction receipt is pushed to the target client.

[0088] The target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0089] It should be noted that the explanations of step S31 and step S35 to step S37 can be found in the relevant descriptions in any embodiment of the present disclosure and will not be repeated here.

[0090] In summary, by extracting the features of tasks and querying historical resource data, we can more accurately predict the resources required by each return service node to process the tasks to be scheduled, thereby improving the accuracy of resource prediction, optimizing resource allocation, improving processing efficiency and system stability, ensuring that tasks are reasonably scheduled to the most suitable service node, and improving the overall service quality.

[0091] The present disclosure provides another task scheduling method. Figure 4 It is a flowchart of a task scheduling method shown in the fourth embodiment of the present disclosure.

[0092] It should be noted that the task scheduling method is applied to the receipt system. The task scheduling method can be executed alone, or it can be executed in combination with any embodiment of the present disclosure or a possible implementation method in the embodiment, or it can be executed in combination with any technical solution in the related technology. The embodiment of the present disclosure does not limit this.

[0093] like Figure 4 As shown, the task scheduling method may include the following steps S41 to S49.

[0094] In step S41, a task to be scheduled is determined from at least one asynchronous task.

[0095] Among them, the asynchronous task is generated according to the transaction serial number in the received historical transaction request.

[0096] In step S42, the target transaction details of each transaction dimension in the target transaction file in the task to be scheduled are obtained.

[0097] It should be understood that since the asynchronous task is generated based on the transaction serial number in the received historical transaction request, for example, a transaction serial number file is generated based on the transaction serial number in the historical transaction request, and the asynchronous task is generated based on the transaction serial number, the task to be scheduled is determined in at least one asynchronous task. Therefore, the task to be scheduled includes the target transaction file corresponding to the transaction serial number, and the target transaction file corresponding to the transaction serial number can be obtained from the task to be scheduled.

[0098] In order to optimize resource allocation, improve task processing efficiency and system reliability, as an example, to extract information of each transaction dimension from the target transaction file in the task to be scheduled, it is necessary to extract specific target transaction details from each transaction dimension, such as transaction type details: the number or proportion of each type of transaction in the statistical file; transaction amount details: the number or total amount of small, medium and large transactions in the statistical file; transaction frequency details: the number or frequency of high-frequency, medium-frequency and low-frequency transactions in the statistical file, etc.

[0099] In step S43, the total amount of resources of each receipt service node and the total amount of transaction details of each transaction dimension that can be processed under the total amount of resources are obtained.

[0100] In order to ensure the reasonable allocation of resources and avoid resource waste or overload, as an example, the total amount of resources of each receipt service node is obtained, and the total amount of transaction details of each transaction dimension allowed to be processed is determined based on the total amount of resources.

[0101] For example, the total number of transaction type details: transfer: up to 50 transactions; payment: up to 30 transactions; refund: up to 20 transactions; the total number of transaction amount details: small amount: up to 80 transactions; medium amount: up to 15 transactions; large amount: up to 5 transactions, etc.

[0102] In step S44, for any receipt service node, the ratio of the target transaction detail quantity and the total transaction detail quantity corresponding to each transaction dimension of any receipt service node is determined.

[0103] For example, suppose there is a receipt service node A, and its total resources are as follows: CPU usage: 20%, memory capacity: 2GB, disk space: 100GB, network bandwidth: 10Mbps, concurrent processing capacity: 100 tasks. Based on these total resources, the total transaction details of each transaction dimension that can be processed are determined as follows: For example, the total transaction type details (transfer: up to 50 transactions, payment: up to 30 transactions, refund: up to 20 transactions); the total transaction amount details (small amount: up to 80 transactions, medium amount: up to 15 transactions, large amount: up to 5 transactions) , assuming that there are the following transaction details in the tasks to be scheduled: transaction type details (transfer: 30, payment: 20, refund: 10); transaction amount details (small: 60, medium: 10, large: 3), calculate the ratio of the target transaction details to the total transaction details: transaction type ratio: transfer: (30 / 50=0.6), payment: (20 / 30=0.67), refund: (10 / 20=0.5), transaction amount ratio: small: (60 / 80=0.75), medium: (10 / 15=0.67), large: (3 / 5=0.6).

[0104] In step S45, based on the ratio of each transaction dimension and the total amount of resources, the resource occupancy value of each transaction dimension of any receipt service node processing the task to be scheduled is predicted.

[0105] In order to effectively allocate resources and balance the load of each receipt service node, as a possible implementation method, the load status of each receipt service node is predicted in real time.

[0106] As an example, for each transaction dimension, the ratio is multiplied by the total amount of resources to obtain the resource occupancy value of the transaction dimension.

[0107] In step S46, based on the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled is predicted.

[0108] As an example, according to the transaction weights corresponding to the multiple transaction dimensions, the resource occupancy values ​​of the multiple transaction dimensions are weighted to obtain the resource weight value of each receipt service node for processing the task to be scheduled.

[0109] In step S47, a target receipt service node is determined from among the receipt service nodes according to the resource weight values ​​corresponding to the receipt service nodes and the environment information in which they are located.

[0110] In step S48, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate a target transaction receipt.

[0111] In step S49, the target transaction receipt is pushed to the target client.

[0112] The target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0113] It should be noted that the explanations of step S41 and step S47 to step S49 can be found in the relevant descriptions in any embodiment of the present disclosure and will not be repeated here.

[0114] In summary, by obtaining the target transaction details of each transaction dimension in the target transaction file in the task to be scheduled; obtaining the total resources of each return order service node and the total transaction details of each transaction dimension that can be processed under the total resources; and predicting the resource occupancy value of each transaction dimension of any return order service node processing the task to be scheduled based on the ratio of each transaction dimension and the total resources, thereby achieving refined management of resources, optimizing task scheduling, improving processing efficiency and system stability, ensuring that tasks are completed efficiently in an environment with sufficient resources, and thus improving the overall service quality.

[0115] The present disclosure provides another task scheduling method. Figure 5 It is a flowchart of a task scheduling method shown in the fifth embodiment of the present disclosure.

[0116] It should be noted that the task scheduling method is applied to the receipt system. The task scheduling method can be executed alone, or it can be executed in combination with any embodiment of the present disclosure or a possible implementation method in the embodiment, or it can be executed in combination with any technical solution in the related technology. The embodiment of the present disclosure does not limit this.

[0117] like Figure 5 As shown, the task scheduling method may include the following steps S51 to S56.

[0118] In step S51, a task to be scheduled is determined from at least one asynchronous task.

[0119] Among them, the asynchronous task is generated according to the transaction serial number in the received historical transaction request.

[0120] In step S52, based on the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled is predicted.

[0121] In step S53, based on the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled is predicted.

[0122] In step S54, the current thread pool concurrency number of the target receipt service node is obtained.

[0123] As an example, the concurrent number of the thread pool of the target receipt service node is detected in real time to obtain the current concurrent number of the thread pool of the target receipt service node.

[0124] In step S55, in response to the current thread pool concurrency being less than the concurrency threshold, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate a target transaction receipt.

[0125] In order to avoid excessive consumption and waste of system resources, as a possible implementation method, task scheduling is combined with thread pool concurrency to ensure efficient use of system resources.

[0126] As an example, when the concurrency of the current thread pool is lower than the set concurrency threshold, the task to be scheduled is directly scheduled to the target receipt service node for execution to generate a target transaction receipt.

[0127] As another example, when the concurrency of the current thread pool is greater than or equal to the set concurrency threshold, the task to be scheduled is added to the corresponding delay queue, and the task is executed after the thread is released.

[0128] In step S56, the target transaction receipt is pushed to the target client.

[0129] The target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0130] It should be noted that the explanations of steps S51 to S53 and step S56 can be found in the relevant descriptions in any embodiment of the present disclosure and will not be repeated here.

[0131] In summary, in response to the current thread pool concurrency being less than the concurrency threshold, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate the target transaction receipt. Thus, the task scheduling is combined with the thread pool concurrency. When the thread pool concurrency does not reach the concurrency threshold, the task is scheduled immediately to ensure that the task is responded to and processed quickly, thereby accelerating the process of generating the target transaction receipt and improving the overall business processing efficiency and user satisfaction.

[0132] Based on any of the above embodiments, the present disclosure provides another task scheduling method. Figure 6 It is a flowchart of a task scheduling method shown in the sixth embodiment of the present disclosure.

[0133] like Figure 6As shown, before determining the task to be scheduled from at least one asynchronous task, the task scheduling method may further include the following steps S61 to S63.

[0134] In step S61, at least one initial transaction serial number file is generated according to the transaction serial number in at least one received historical transaction request.

[0135] As an example, the transaction serial number is extracted from the received historical transaction requests; it should be noted that the transaction serial number is the key information that uniquely identifies a transaction. Then, according to business needs, the format and structure of the transaction log file are designed. For example, the transaction log file includes a file header (which may include information such as file generation time and version number), a transaction record body (each record includes detailed information such as transaction serial number, transaction time, transaction amount, transaction type, transaction status, etc.) and a file footer (including a checksum or summary information), etc. Then, based on the transaction serial number and the designed file structure, an initial transaction log file is generated, such as writing a script in a programming language such as Python or Java, traversing the transaction serial number list, and writing each transaction information into the initial transaction log file according to the designed format.

[0136] In step S62, data processing is performed on any initial transaction flow file to obtain a target transaction flow file.

[0137] In order to improve the quality of transaction flow files, as an example, for any initial transaction flow file, data processing is performed on any initial transaction flow file to obtain a target transaction flow file, for example, data extraction, conversion and verification are performed on any initial transaction flow file.

[0138] In step S63, at least one asynchronous task is generated according to each target transaction flow file.

[0139] As an example, based on preset task generation rules, at least one asynchronous task is created according to each target transaction flow file. For example, a task generation function is called, and the target transaction flow file is used as a parameter of the task generation function to create an asynchronous task.

[0140] In summary, the initial transaction flow file is generated by the transaction serial number in the received historical transaction request, which ensures the accuracy of the data and the reliability of the source; then, the initial transaction flow file is processed to improve the quality and availability of the data; finally, asynchronous tasks are generated based on each target transaction flow file to achieve parallel data processing, greatly improve the processing speed and efficiency, and reduce the burden on system resources.

[0141] Based on any of the above embodiments, taking the historical transaction request as a transfer request as an example, Figure 7 As shown, the task scheduling method of the embodiment of the present disclosure can also be implemented based on the following steps:

[0142] 1. The customer initiates a transfer through online banking or relevant employee channels, and the corresponding transaction component records the transaction flow;

[0143] 2. Each transaction component generates a transaction flow file and transmits the file to the data warehouse;

[0144] 3. The data warehouse forwards the file to the receipt component;

[0145] 4. The receipt component calls up an asynchronous task, generates a receipt format file (target transaction file) based on the transaction data, and provides an electronic receipt according to the business rules. The specific steps are as follows: Figure 8 As shown:

[0146] (1) On day T, based on the detailed quantity on day T-1, the resource weight value of the asynchronous task of processing electronic receipts is predicted, and the weight strategy table parameters are updated;

[0147] (2) Start the electronic receipt asynchronous task execution scanner to scan the tasks to be scheduled;

[0148] (3) When the task status of the task to be scheduled is not executed, the scheduler schedules the task to be executed;

[0149] (4) Determine whether the task execution queue is full. If the queue is full, jump out of the task and wait for the next scheduling;

[0150] (5) According to the task execution account, obtain the weight value of the task to be scheduled, and determine whether the server resource value exceeds 100% based on the current resource occupancy value of the server in a suitable environment + the resource weight value of the task to be scheduled. If it exceeds the limit, exit the task and wait for the next scheduling;

[0151] (6) If the resources and queues are satisfied, determine whether the current thread pool concurrency exceeds the quota. If it exceeds the quota, add it to the waiting task queue and execute the task after the waiting thread is released;

[0152] (7) Execute the task, update the task status, and execute the next task according to the task queue.

[0153] With the above Figures 1 to 8 Corresponding to the task scheduling method provided in the embodiment, the present disclosure also provides a task scheduling device. Figures 1 to 8 The task scheduling method provided in the embodiment corresponds to the task scheduling method, so the implementation method of the task scheduling method is also applicable to the task scheduling device provided in the embodiment of the present disclosure, and will not be described in detail in the embodiment of the present disclosure.

[0154] Fig. 91 is a schematic diagram of the structure of the task scheduling device shown in the seventh embodiment of the present disclosure. It should be noted that the task scheduling device is applied to the receipt system.

[0155] Reference Fig. 9 The task scheduling device 900 includes: a first determination module 910, a prediction module 920, a second determination module 930, a generation module 940 and a push module 950.

[0156] Among them, the first determination module 910 is used to determine the task to be scheduled from at least one asynchronous task; wherein the asynchronous task is generated according to the transaction serial number in the received historical transaction request; the prediction module 920 is used to predict the resource weight value of each return order service node in the return order system for processing the task to be scheduled according to the resource occupancy value and transaction weight corresponding to multiple transaction dimensions of the task to be scheduled; the second determination module 930 is used to determine the target return order service node from each return order service node according to the resource weight value corresponding to each return order service node and the environmental information in which it is located; the generation module 940 is used to schedule the task to be scheduled to the target return order service node, so as to execute the task to be scheduled through the target return order service node and generate a target transaction return order; the push module 950 is used to push the target transaction return order to the target client, wherein the target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

[0157] In a possible implementation of the embodiments of the present disclosure, the second determination module 930 is used to determine the environmental index value of each return service node based on the environmental information of each return service node; wherein the environmental index value is used to indicate the stability of the environment in which the corresponding return service node is located; according to the environmental index value of each return service node, at least one first candidate return service node is determined from each return service node; according to the resource weight value of each return service node, the target return service node is determined from at least one first candidate return service node.

[0158] In a possible implementation of the embodiment of the present disclosure, the second determination module 930 is used to determine whether there is at least one second candidate receipt service node in at least one first candidate receipt service node based on the current resource remaining value and resource weight value of each first candidate receipt service node; wherein the current resource remaining value of the second candidate receipt service node is greater than the resource weight value; in response to the existence of at least one second candidate receipt service node, determine the target receipt service node from at least one second candidate receipt service node based on the difference between the current resource remaining value and the resource weight value of each second candidate receipt service node.

[0159] In a possible implementation of the embodiment of the present disclosure, the second determination module 930 is used to write the to-be-scheduled task into the delay queue in response to the absence of at least one second candidate receipt service node; and to loop through the current resource remaining values ​​of each first candidate receipt service node until traversing to the target receipt service node for processing the task in the delay queue.

[0160] In a possible implementation of the embodiment of the present disclosure, the prediction module 920 is used to extract features of the tasks to be scheduled to obtain target features of each transaction dimension of the tasks to be scheduled; for any return order service node, according to the target features of any transaction dimension, the historical resource data of any return order service node is queried to obtain the resource occupancy value that matches the target features of any transaction dimension.

[0161] In a possible implementation of the embodiments of the present disclosure, the prediction module 920 is used to obtain the target transaction detail quantity of each transaction dimension in the target transaction file in the task to be scheduled; obtain the total resource amount of each return order service node and the total transaction detail amount of each transaction dimension allowed to be processed under the total resource amount; for any return order service node, determine the ratio of the target transaction detail quantity and the total transaction detail amount corresponding to each transaction dimension of any return order service node; based on the ratio of each transaction dimension and the total resource amount, predict the resource occupancy value of each transaction dimension of any return order service node in processing the task to be scheduled.

[0162] In a possible implementation of the embodiment of the present disclosure, the prediction module 920 is used to perform weighted processing on the resource occupancy values ​​of multiple transaction dimensions according to the transaction weights corresponding to the multiple transaction dimensions, so as to obtain the resource weight value of each receipt service node for processing the task to be scheduled.

[0163] In a possible implementation of the embodiment of the present disclosure, a generation module 940 is used to obtain the current thread pool concurrency of the target receipt service node; in response to the current thread pool concurrency being less than the concurrency threshold, the task to be scheduled is scheduled to the target receipt service node, so as to execute the task to be scheduled through the target receipt service node and generate a target transaction receipt.

[0164] In a possible implementation of the embodiment of the present disclosure, the first determination module 910 is used to query the execution status of at least one asynchronous task; for any asynchronous execution task, in response to the execution status of any asynchronous task being not executed, any asynchronous task is treated as a task to be scheduled.

[0165] In a possible implementation of the embodiment of the present disclosure, the generation module 940 is also used to generate at least one initial transaction flow file based on the transaction serial number in at least one historical transaction request received; for any initial transaction flow file, perform data processing on any initial transaction flow file to obtain a target transaction flow file; and generate at least one asynchronous task based on each target transaction flow file.

[0166] The task scheduling device of the embodiment of the present disclosure determines the task to be scheduled from at least one asynchronous task generated according to the transaction serial number in the historical transaction request, predicts the resource weight value of each return order service node in the return order system for processing the task to be scheduled according to the resource occupancy values ​​and transaction weights corresponding to multiple transaction dimensions of the task to be scheduled, selects the target return order service node according to the resource weights of each return order service node in the return order system and the environmental information in which it is located, and schedules the task to be scheduled to the target return order service node, so that the task to be scheduled is executed through the target return order service node to generate a target transaction return order, thereby decoupling the processing of transaction requests and the generation of returns, and scheduling asynchronous tasks to the best return order service node, which not only improves the processing efficiency of tasks and reduces resource waste, but also ensures that the generation and push of transaction returns are more timely and accurate, thereby enhancing the stability and reliability of the system and meeting the needs in a high-concurrency transaction environment; finally, the generated target transaction return order is pushed to the corresponding target client, thereby realizing the timely push of the transaction return order and improving the user experience and the overall service quality of the system.

[0167] In an exemplary embodiment, the present disclosure also provides an electronic device.

[0168] Among them, electronic equipment includes:

[0169] processor;

[0170] a memory for storing processor-executable instructions;

[0171] The processor is configured to execute instructions to implement the task scheduling method proposed in any of the aforementioned embodiments.

[0172] As an example, Fig.10 is a schematic diagram of the structure of an electronic device 1000 shown in an exemplary embodiment of the present disclosure, such as Fig.10 As shown, the electronic device 1000 may further include:

[0173] The memory 1010 and the processor 1020, the bus 1030 connecting different components (including the memory 1010 and the processor 1020), the memory 1010 stores a computer program, and when the processor 1020 executes the program, the task scheduling method described in the embodiment of the present disclosure is implemented.

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

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

[0176] The memory 1010 may also include computer system readable media in the form of volatile memory, such as random access memory (RAM) 1040 and / or cache memory 1050. The server 1000 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, the storage system 1060 may be used to read and write non-removable, non-volatile magnetic media ( Fig.10 not shown, usually called a "hard drive"). Although Fig.10 Not shown in the figure, a disk drive for reading and writing to a removable non-volatile disk (e.g., a "floppy disk"), and an optical disk drive for reading and writing to a removable non-volatile optical disk (e.g., a CD-ROM, a DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to the bus 1030 via one or more data medium interfaces. The memory 1010 may include at least one program product having a set (e.g., at least one) of program modules that are configured to perform the functions of the various embodiments of the present disclosure.

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

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

[0179] The processor 1020 executes various functional applications and data processing by running the programs stored in the memory 1010 .

[0180] It should be noted that the implementation process and technical principles of the electronic device of this embodiment refer to the aforementioned explanation of the task scheduling method of the embodiment of the present disclosure, which will not be repeated here.

[0181] In an exemplary embodiment, a computer-readable storage medium including instructions is also provided, such as a memory including instructions, and the above instructions can be executed by a processor of an electronic device to complete the method proposed in any of the above embodiments. Optionally, the computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.

[0182] In an exemplary embodiment, a computer program product is also provided, including a computer program / instruction, wherein the computer program / instruction implements the method proposed in any of the above embodiments when executed by a processor.

[0183] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. The present disclosure is intended to cover any variations, uses or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The description and examples are to be considered exemplary only, and the true scope and spirit of the present disclosure are indicated by the following claims.

[0184] It should be understood that the present disclosure is not limited to the exact structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims

1. A task scheduling method, characterized in that: Applied to the receipt system, including: Determine a task to be scheduled from at least one asynchronous task; wherein the asynchronous task is generated according to a transaction serial number in a received historical transaction request; According to the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled, predicting the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled; Determine a target receipt service node from among the receipt service nodes according to resource weight values ​​corresponding to the receipt service nodes and the environment information in which they are located; Scheduling the task to be scheduled to the target receipt service node, so as to execute the task to be scheduled through the target receipt service node and generate a target transaction receipt; The target transaction receipt is pushed to a target client; wherein the target client is a client that sends a historical transaction request corresponding to the task to be scheduled.

2. The method according to claim 1, characterized in that The step of determining a target receipt service node from among the receipt service nodes according to resource weight values ​​corresponding to the receipt service nodes and the environment information in which the receipt service nodes are located comprises: Determine the environmental index value of each receipt service node according to the environmental information of each receipt service node; wherein the environmental index value is used to indicate the stability of the environment in which the corresponding receipt service node is located; Determine at least one first candidate receipt service node from among the receipt service nodes according to the environmental indicator value of each receipt service node; According to the resource weight value of each of the first candidate receipt service nodes, a target receipt service node is determined from the at least one first candidate receipt service node.

3. The method according to claim 2, characterized in that The step of determining a target receipt service node from the at least one first candidate receipt service node according to the resource weight value of each of the first candidate receipt service nodes comprises: According to the current remaining resource value and the resource weight value of each of the first candidate receipt service nodes, it is judged whether there is at least one second candidate receipt service node among the at least one first candidate receipt service node; wherein the current remaining resource value of the second candidate receipt service node is greater than the resource weight value; In response to the existence of the at least one second candidate receipt service node, the target receipt service node is determined from the at least one second candidate receipt service node according to the difference between the current resource remaining value and the resource weight value of each of the second candidate receipt service nodes.

4. The method according to claim 3, characterized in that The determining of a target receipt service node from each of the receipt service nodes according to the current resource remaining value and the resource weight value of each of the first candidate receipt service nodes also includes: In response to the absence of at least one second candidate receipt service node, writing the to-be-scheduled task into a delay queue; The current resource remaining values ​​of each of the first candidate receipt service nodes are traversed in a loop until a target receipt service node for processing tasks in the delay queue is reached.

5. The method according to claim 1, characterized in that: The resource occupancy value is determined by the following steps: Extracting features of the tasks to be scheduled to obtain target features of each transaction dimension of the tasks to be scheduled; For any receipt service node, according to the target feature of any transaction dimension, the historical resource data of any receipt service node is queried to obtain the resource occupancy value matching the target feature of any transaction dimension.

6. The method according to claim 1, characterized in that The resource occupancy value is determined by the following steps: Obtain the target transaction details of each transaction dimension in the target transaction file in the task to be scheduled; Obtaining the total amount of resources of each receipt service node and the total amount of transaction details of each transaction dimension that can be processed under the total amount of resources; For any receipt service node, determine the ratio of the target transaction detail quantity and the total transaction detail quantity corresponding to each transaction dimension of any receipt service node; According to the ratio corresponding to each of the transaction dimensions and the total amount of resources, the resource occupancy value of each transaction dimension of any receipt service node processing the task to be scheduled is predicted.

7. The method according to claim 5 or 6, characterized in that: The predicting, based on the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled, the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled includes: According to the transaction weights corresponding to the multiple transaction dimensions, the resource occupancy values ​​of the multiple transaction dimensions are weighted to obtain the resource weight value of each receipt service node for processing the task to be scheduled.

8. The method according to claim 1, characterized in that The step of dispatching the task to be scheduled to the target receipt service node so as to execute the task to be scheduled through the target receipt service node and generate a target transaction receipt includes: Obtain the current thread pool concurrency number of the target receipt service node; In response to the current thread pool concurrency being less than a concurrency threshold, the task to be scheduled is scheduled to the target receipt service node, so that the task to be scheduled is executed through the target receipt service node to generate a target transaction receipt.

9. The method according to claim 1, characterized in that: The step of determining the task to be scheduled from at least one asynchronous task includes: Querying the execution status of the at least one asynchronous task; For any asynchronously executed task, in response to the execution status of any asynchronous task being unexecuted, the any asynchronous task is used as the task to be scheduled.

10. The method according to claim 1, characterized in that Before determining the task to be scheduled from at least one asynchronous task, the method further includes: Generate at least one initial transaction log file according to the transaction log number in at least one received historical transaction request; For any initial transaction flow file, data processing is performed on the initial transaction flow file to obtain a target transaction flow file; Generate the at least one asynchronous task according to each of the target transaction flow files.

11. A task scheduling device, characterized in that: Applied to the receipt system, including: A first determination module is used to determine a task to be scheduled from at least one asynchronous task; wherein the asynchronous task is generated according to a transaction serial number in a received historical transaction request; A prediction module, used to predict the resource weight value of each receipt service node in the receipt system for processing the task to be scheduled according to the resource occupancy values ​​and transaction weights corresponding to the multiple transaction dimensions of the task to be scheduled; A second determination module is used to determine a target receipt service node from each receipt service node according to a resource weight value corresponding to each receipt service node and the environment information in which the node is located; A generating module, used for scheduling the task to be scheduled to the target receipt service node, so as to execute the task to be scheduled through the target receipt service node and generate a target transaction receipt; The push module is used to push the target transaction receipt to the target client; wherein the target client is the client that sends the historical transaction request corresponding to the task to be scheduled.

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

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

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

Images