Distributed service scheduling method, device, equipment, system and storage medium

By determining the child node server and business process based on the access request and the preset scheduling weight list, the problem of failure or too slow response caused by random allocation in the prior art is solved, and the intelligence and user experience of distributed service scheduling are improved.

CN120151350APending Publication Date: 2025-06-13CHINA UNITED NETWORK COMM GRP CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311707948.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-12-12
Publication Date
2025-06-13

AI Technical Summary

Technical Problem

In the prior art, when a randomly allocated child node server processes access requests, if the business process on the child node server fails or resource allocation is uneven, it will cause the access request processing to fail or the response is too slow, affecting the user experience.

Method used

By receiving the access request triggered by the user, the service process to be scheduled of the child node server to be scheduled is determined based on the service indicated by the access request and the preset scheduling weight list, and the access request is sent to the child node server. The preset scheduling weight list includes the weight corresponding to the child node server and the business process, and the weight corresponds to the business type.

Benefits of technology

This method can more reasonably determine the sub-node server and business process to be scheduled for access requests, improving the intelligence and user experience of the distributed service scheduling method.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120151350A_ABST
    Figure CN120151350A_ABST
Patent Text Reader

Abstract

The invention provides a distributed service scheduling method, device, equipment and system and a storage medium. The method comprises the following steps: receiving an access request triggered by a user; wherein the access request is used for representing an access service, the access request indicates a service needing to be accessed, and the service has a service type; according to the service indicated by the access request and a preset scheduling weight list, determining a to-be-scheduled service process of the to-be-scheduled sub-node server; wherein the preset scheduling weight list comprises weights corresponding to the child node servers and the service processes; the preset scheduling weight list corresponds to the service type of the service; sending the access request to a child node server to be scheduled; wherein the to-be-scheduled sub-node server is used for executing the service indicated by the access request based on the to-be-scheduled service process, so as to obtain an access result. According to the method provided by the invention, the user experience of the distributed service scheduling method is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular, to a distributed service scheduling method, apparatus, device, system, and storage medium. Background Art

[0002] A business system refers to a comprehensive system that takes users or other enterprises as the main customers and aims to meet customer needs within a certain range, and calls the management and production operation of an enterprise a business system. During the use of a business system, multiple users often access a business system simultaneously, resulting in the business system becoming stuck or even unable to operate normally.

[0003] In the prior art, access to a business system is implemented based on multiple sub-node servers. When an access request is received, a sub-node server is randomly determined to execute the access request.

[0004] However, in the above method, a single sub-node server is randomly assigned to execute the access request. If a business process on the assigned sub-node server fails, the processing of the access request will fail; and when multiple access requests are received, the problem of uneven resource allocation will occur, resulting in a slow response to the access request and affecting the access experience. Summary of the Invention

[0005] The present application provides a distributed service scheduling method, apparatus, device, system, and storage medium to solve the problem of low user experience of the distributed service scheduling method.

[0006] In a first aspect, the present application provides a distributed service scheduling method, including:

[0007] Receiving an access request triggered by a user; wherein, the access request is used to represent accessing a service, the access request indicates the service to be accessed, and the service has a service type;

[0008] Determining a service process of a to-be-scheduled sub-node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the sub-node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0009] Sending the access request to the to-be-scheduled sub-node server; wherein, the to-be-scheduled sub-node server is used to execute the service indicated by the access request based on the to-be-scheduled service process to obtain an access result.

[0010] Optionally, in the method described above, according to the service indicated by the access request and a preset scheduling weight list, determining a service process to be scheduled for the child node server to be scheduled includes: if it is determined that the number of weights with the highest value in the preset scheduling weight list is one, determining the service process of the child node server corresponding to the weight with the highest value as the service process to be scheduled for the child node server to be scheduled; if it is determined that the number of weights with the highest value in the preset scheduling weight list is multiple, randomly determining the service process of one child node server from the child node servers corresponding to the weight with the highest value as the service process to be scheduled for the child node server to be scheduled.

[0011] Optionally, the method described above further includes: obtaining scheduling parameters corresponding to the service processes loaded by each child node server; where the scheduling parameters include one or more of the following parameters: a first performance parameter, a second performance parameter, a first status parameter, and a second status parameter; the first performance parameter is a parameter characterizing the performance of the service process, the second performance parameter is a parameter characterizing the performance of the child node server to which the service process belongs, the first status parameter is a parameter characterizing the status of the service process, and the second status parameter is a parameter characterizing the status of the child node server to which the service process belongs; generating the preset scheduling weight list according to the scheduling parameters of the service processes of each child node server.

[0012] Optionally, in the method described above, the obtaining scheduling parameters corresponding to the service processes loaded by each child node server includes: receiving the first status parameter and the second status parameter sent by the child node server; where the first status parameter and the second status parameter are reported by the child node server when it determines that the running state of the child node server has changed or when it determines that the running state of the service process loaded by the child node server has changed through real-time monitoring; receiving the first performance parameter and the second performance parameter reported by each child node server at a preset reporting period.

[0013] Optionally, in the method described above, generating the preset scheduling weight list according to the scheduling parameters of the service processes of each child node server includes: generating a running state list according to the first status parameter and the second status parameter in the scheduling parameters of the service processes of each child node server; where the running state list characterizes the status of the service processes of the child node server; generating the preset scheduling weight list according to the running state list, the first performance parameter, and the second performance parameter in the scheduling parameters of the service processes of each child node server.

[0014] Optionally, the method described above further includes: receiving the access result fed back by the child node server to be scheduled; sending the access result to the user.

[0015] In a second aspect, the present application provides a distributed service scheduling method, including:

[0016] Receiving an access request sent by the scheduling server; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; the access request is triggered by a user; the access request is sent by the scheduling server after determining a service process to be scheduled of a child node server to be scheduled based on the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0017] Executing the service indicated by the access request based on the service process corresponding to the service indicated by the access request to obtain an access result.

[0018] Optionally, the method as described above further includes: determining scheduling parameters corresponding to the service processes loaded by the child node server; wherein, the scheduling parameters include one or more of the following parameters: a first performance parameter, a second performance parameter, a first status parameter, and a second status parameter; the first performance parameter is a parameter representing the performance of the service process, the second performance parameter is a parameter representing the performance of the child node server to which the service process belongs, the first status parameter is a parameter representing the status of the service process, and the second status parameter is a parameter representing the status of the child node server to which the service process belongs; feeding back the scheduling parameters corresponding to the service processes loaded by the child node server to the scheduling server; wherein, the scheduling parameters of the service processes of each child node server are used to generate the preset scheduling weight list.

[0019] Optionally, for the method as described above, determining the scheduling parameters corresponding to the service processes loaded by the child node server includes: if it is monitored in real time by a child node server parameter collector that the running state of the child node server changes, determining the second status parameter of the child node server and sending the second status parameter to the scheduled service process parameter collector; if it is monitored in real time by a service process parameter collector that the running state of the service process loaded by the child node server changes, determining the first status parameter of the service process loaded by the child node server; obtaining the second performance parameter of the child node server in real time based on the scheduled child node server parameter collector and sending the second performance parameter to the scheduled service process parameter collector; obtaining the first performance parameter of the service process loaded by the child node server in real time based on the scheduled service process parameter collector.

[0020] Optionally, in the method described above, feedback the scheduling parameters corresponding to the service processes loaded by the child node server to the scheduling server, including: if it is determined that the first status parameter and / or the second status parameter are collected, then based on the scheduled service process parameter collector, send the collected first status parameter and / or the second status parameter to the scheduling server; based on the scheduled service process parameter collector, report the collected first performance parameter and second performance parameter to the scheduling server at a preset reporting period.

[0021] Optionally, the method described above further includes: sending the access result to the scheduling server.

[0022] In a third aspect, the present application provides a distributed service scheduling device, including:

[0023] A receiving module, configured to receive an access request triggered by a user; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type;

[0024] A determining module, configured to determine the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0025] A scheduling module, configured to send the access request to the child node server to be scheduled; wherein, the child node server to be scheduled is configured to execute the service indicated by the access request based on the service process to be scheduled to obtain an access result.

[0026] To execute the distributed service scheduling method described in the first aspect above.

[0027] In a fourth aspect, the present application provides a distributed service scheduling device, including:

[0028] A receiving module, configured to receive the access request sent by the scheduling server; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; the access request is triggered by a user; the access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0029] An execution module, configured to execute the service indicated by the access request based on the service process corresponding to the service indicated by the access request, and obtain an access result.

[0030] To execute the distributed service scheduling method described in the second aspect above.

[0031] In a fifth aspect, the present application provides a distributed service scheduling system, including: a scheduling server and at least one sub-node server;

[0032] Wherein, the scheduling server is configured to execute the method described in any one of the first aspects above, and the sub-node server is configured to execute the method described in any one of the second aspects above.

[0033] In a sixth aspect, the present application provides a distributed service scheduling device, including:

[0034] A processor, a memory, and a communication interface;

[0035] The memory is configured to store executable instructions of the processor;

[0036] Wherein, the processor is configured to execute the distributed service scheduling method described in the first aspect above by executing the executable instructions, or execute the distributed service scheduling method described in the second aspect above by executing the executable instructions.

[0037] In a seventh aspect, the present application provides a readable storage medium, including: a computer program stored thereon, and when the computer program is executed by a processor, it implements the execution of the distributed service scheduling method described in the first aspect above, or the execution of the distributed service scheduling method described in the second aspect above.

[0038] The distributed service scheduling method, device, equipment, system, and storage medium provided by the present application receive an access request triggered by a user, determine the service process to be scheduled of the sub-node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list, and send the access request to the sub-node server to be scheduled. The preset scheduling weight list corresponds to the service type indicated by the access request and includes weights corresponding to both the sub-node server and the service process. In the process of determining the service process to be scheduled of the sub-node server to be scheduled according to the service indicated by the access request and the preset scheduling weight list, a more reasonable service process to be scheduled of the sub-node server to be scheduled can be determined for the access request, improving the intelligence of the distributed service scheduling method and the user experience of the distributed service scheduling method. Description of the Drawings

[0039] The accompanying drawings herein are incorporated into and constitute a part of this specification, showing embodiments consistent with the present application, and are used together with the specification to explain the principles of the present application.

[0040] Figure 1 A schematic flowchart of the distributed service scheduling method provided for the embodiments of the present application;

[0041] Figure 2 A schematic flowchart of another distributed service scheduling method provided for the embodiments of the present application;

[0042] Figure 3 A schematic flowchart of the distributed service scheduling method provided for the embodiments of the present application;

[0043] Figure 4 A schematic flowchart of another distributed service scheduling method provided for the embodiments of the present application;

[0044] Figure 5 A schematic structural diagram of a distributed service scheduling device provided for the embodiments of the present application;

[0045] Figure 6 A schematic structural diagram of a distributed service scheduling device provided for the embodiments of the present application;

[0046] Figure 7 A schematic structural diagram of a distributed service scheduling device provided for the embodiments of the present application;

[0047] Figure 8 A schematic structural diagram of a distributed service scheduling device provided for the embodiments of the present application;

[0048] Figure 9 A schematic structural diagram of a distributed service scheduling system provided for the embodiments of the present application;

[0049] Figure 10 A schematic structural diagram of an electronic device provided for the embodiments of the present application.

[0050] Through the above accompanying drawings, the clear embodiments of the present application have been shown, and there will be more detailed descriptions hereinafter. These accompanying drawings and textual descriptions are not intended to limit the scope of the concept of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. Detailed implementation manners

[0051] Exemplary embodiments will be described in detail herein, and examples thereof are shown in the accompanying drawings. When the following description refers to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0052] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present application are all information and data authorized by the user or fully authorized by all parties. Moreover, the collection, use, and processing of relevant data need to comply with relevant laws, regulations, and standards, and corresponding operation entrances are provided for users to choose to authorize or reject.

[0053] In the prior art, access to a business system is implemented based on multiple sub-node servers. When an access request is received, a sub-node server is randomly determined to execute the access request. However, in the above method, by randomly allocating a single sub-node server to execute the access request, if a business process on the allocated sub-node server fails, the processing of the access request will fail; and when multiple access requests are received, the problem of uneven resource allocation will occur, resulting in a slow response to the access request and affecting the access experience.

[0054] In the present application, by receiving an access request triggered by a user, according to the service indicated by the access request and a preset scheduling weight list, the business process to be scheduled of the sub-node server to be scheduled is determined, and the access request is sent to the sub-node server to be scheduled. Among them, the preset scheduling weight list corresponds to the service type indicated by the access request and includes weights corresponding to both the sub-node server and the business process. In the process of determining the business process to be scheduled of the sub-node server to be scheduled according to the service indicated by the access request and the preset scheduling weight list, a more reasonable business process to be scheduled of the sub-node server to be scheduled for the access request can be determined, improving the intelligence of the distributed service scheduling method and the user experience of the distributed service scheduling method.

[0055] The distributed service scheduling method provided by the present application aims to solve the above technical problems in the prior art.

[0056] The following will specifically describe the technical solution of the present application and how the technical solution of the present application solves the above technical problems with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below with reference to the accompanying drawings.

[0057] Figure 1 This is a schematic flowchart of the distributed service scheduling method provided by the first embodiment of the present application. The execution entity is a scheduling server, which generally can be implemented by software, or by hardware, or by a combination of software and hardware.

[0058] As Figure 1 shown, the distributed service scheduling method of this embodiment may include the following steps:

[0059] Step S101: Receive an access request triggered by a user.

[0060] Specifically, an access request triggered by a user can be received. Among them, the way for the user to trigger the access request is related to the settings of the service system and / or the service type. The present application does not limit the way for the user to trigger the access request, and any service access request triggered can be used as the access request received by the scheduling server of the present application. Among them, the access request is used to represent the accessed service. The access request indicates the service to be accessed, and the service has a service type, that is, the access request is used to represent the service corresponding to the indicated service type. Among them, in the distributed service system, the service to be accessed is loaded in the service processes of at least one sub-node server, and at least one service process corresponding to one service type is loaded in one sub-node server.

[0061] Step S102: Determine the service process to be scheduled of the sub-node server to be scheduled according to the service indicated by the access request and the preset scheduling weight list.

[0062] Among them, the preset scheduling weight list is used to represent the proportion of the schedulable service processes in each schedulable sub-node server when an access request is received. Among them, the preset scheduling weight list includes the weights corresponding to both the sub-node server and the service process. The preset scheduling weight list corresponds to the service type of the service. That is, the schedulable sub-node server and the schedulable service process are in one-to-one correspondence. If the sub-node server corresponding to the service type is not schedulable, then the service processes loaded in the sub-node server are also not schedulable. If the service processes loaded in the sub-node server corresponding to the service type are not schedulable, then the sub-node server is also not schedulable.

[0063] Specifically, in the process of determining the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request received in step S101 and the preset scheduling weight list, the preset scheduling weight list corresponding to the service type can be selected according to the type of the service indicated by the access request. The preset scheduling weight list includes the weights corresponding to both the child node server and the service process, that is, the weights of the schedulable processes of each schedulable child node server. Then, according to the service indicated by the access request and the preset scheduling weight list corresponding to the service type, the service process to be scheduled of the child node server to be scheduled is determined. Among them, the service process to be scheduled of the child node server to be scheduled is the service process of the child node server preferably selected according to the proportion of the schedulable service processes in each schedulable child node server in the preset scheduling weight list.

[0064] Optionally, if an access request triggered by a user is received in step S101, in the process of determining the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request and the preset scheduling weight list, the schedulable service process of the schedulable child node server with the highest weight value can be selected as the service process to be scheduled of the child node server to be scheduled, or one can be randomly selected from the schedulable service processes of multiple schedulable child node servers with the highest weight value as the service process to be scheduled of the child node server to be scheduled.

[0065] Optionally, the preset scheduling weight list can correspond to the service types of all services, that is, it includes the schedulable service processes of the schedulable child node servers corresponding to all service types. In the process of determining the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request and the preset scheduling weight list, the weights of the schedulable service processes of the schedulable child servers corresponding to the service type can be screened from the preset scheduling weight list according to the service type indicated by the access request first, and then the service process to be scheduled of the child node server to be scheduled is determined according to the weights of the schedulable service processes of each schedulable child server. The process of determining the service process to be scheduled of the child node server to be scheduled according to the weights of the schedulable service processes of each schedulable child server can refer to the description above this step and will not be elaborated here.

[0066] Step S103: Send the access request to the child node server to be scheduled.

[0067] Specifically, after determining the business process to be scheduled for the child node server to be scheduled, the access request can be sent to the child node server to be scheduled, where the child node server to be scheduled is used to execute the business indicated by the access request based on the business process to be scheduled to obtain an access result.

[0068] The distributed service scheduling method provided in this embodiment receives an access request triggered by a user, determines the business process to be scheduled for the child node server to be scheduled according to the business indicated by the access request and a preset scheduling weight list, and sends the access request to the child node server to be scheduled. The preset scheduling weight list corresponds to the service type indicated by the access request and includes weights corresponding to both the child node server and the business process. In the process of determining the business process to be scheduled for the child node server to be scheduled according to the business indicated by the access request and the preset scheduling weight list, the business process to be scheduled for the child node server to be scheduled for the access request can be determined more reasonably, improving the intelligence of the distributed service scheduling method and the user experience of the distributed service scheduling method.

[0069] Figure 2 It is a schematic flowchart of another distributed service scheduling method provided in the second embodiment of this application. On the basis of the embodiment shown in Figure 1 the embodiment, the embodiment of this application expands and describes another distributed service scheduling method.

[0070] As Figure 2 shown, another distributed service scheduling method of this embodiment may include the following steps:

[0071] Step S201, obtain scheduling parameters corresponding to the business processes loaded by each child node server.

[0072] Specifically, before receiving the access request triggered by the user, the scheduling parameters corresponding to the business processes loaded by each child node server can be obtained. The scheduling parameters refer to parameters that can characterize the schedulability of the business processes loaded in each child node server. The scheduling parameters include one or more of the following parameters: a first performance parameter, a second performance parameter, a first status parameter, and a second status parameter. The first performance parameter is a parameter characterizing the performance of the business process, for example: parameters such as the running memory of the business process. The second performance parameter is a parameter characterizing the performance of the child node server to which the business process belongs, for example: parameters such as the remaining running memory of the child node server. The first status parameter is a parameter characterizing the status of the business process, and the second status parameter is a parameter characterizing the status of the child node server to which the business process belongs. The first status parameter is related to the second status parameter. For example: if the status of the child node server to which the business process belongs is a running error, the status of the corresponding business process is also a running error.

[0073] Optionally, the process of obtaining the scheduling parameters corresponding to the service processes loaded by each child node server may include: receiving the first status parameter and the second status parameter sent by the child node server, and receiving the first performance parameter and the second performance parameter reported by each child node server at a preset reporting period. Among them, the first status parameter and the second status parameter are reported by the child node server when it determines that the running status of the child node server has changed or the running status of the service process loaded by the child node server has changed through real-time monitoring. Optionally, the first performance parameter and the second performance parameter may be obtained by the child node server through real-time monitoring and reported at the preset reporting period. Optionally, the first performance parameter and the second performance parameter may also be obtained and reported by the child node server at the preset reporting period.

[0074] Optionally, this step may also be set in the whole process of implementing the distributed service scheduling method to realize real-time monitoring of the scheduling parameters.

[0075] Optionally, after obtaining the scheduling parameters corresponding to the service processes loaded by each child node server, the obtained scheduling parameters corresponding to the service processes loaded by each child node server may be stored in a database for generating a preset scheduling weight list or for users to query.

[0076] Step S202: Generate a preset scheduling weight list according to the scheduling parameters of the service processes of each child node server.

[0077] Specifically, after obtaining the scheduling parameters corresponding to the service processes loaded by each child node server, a preset scheduling weight list may be generated according to the obtained scheduling parameters of the service processes of each child node server. Among them, the present application does not limit the process of generating a preset scheduling weight list according to the scheduling parameters of the service processes of each child node server. Optionally, a running status list may be generated according to the first status parameter and the second status parameter in the scheduling parameters of the service processes of each child node server. Among them, the running status list characterizes the status of the service processes of the child node server. Then, a preset scheduling weight list is generated according to the running status list, the first performance parameter and the second performance parameter in the scheduling parameters of the service processes of each child node server. Among them, the description of the preset scheduling weight list may refer to the description in step S102, and this step will not be elaborated here.

[0078] Optionally, after generating the preset scheduling weight list, the generated preset scheduling weight list may be stored in a database for users to query. Optionally, after generating the running status list, the generated running status list may be stored in a database for users to query.

[0079] Step S203: Receive an access request triggered by a user.

[0080] Among them, the access request is used to represent an access service. The access request indicates the service to be accessed, and the service has a service type.

[0081] Specifically, for the specific description of this step, reference can be made to the description in step S101, and details will not be repeated in this embodiment.

[0082] Step S204: According to the service indicated by the access request and the preset scheduling weight list, if it is determined that the number of weights with the highest value in the preset scheduling weight list is one, then determine the service process of the child node server corresponding to the weight with the highest value as the service process to be scheduled for the child node server to be scheduled.

[0083] Specifically, according to the service indicated by the access request received in step S203 and the preset scheduling weight list generated in step S202, determine the service process to be scheduled for the child node server to be scheduled. Among them, if it is determined that the number of weights with the highest value in the preset scheduling weight list is one, then determine the service process of the child node server corresponding to the weight with the highest value as the service process to be scheduled for the child node server to be scheduled. For example: If according to the service indicated by the access request and the preset scheduling weight list, it is determined that there are three service processes that can be scheduled for the child node server that can be scheduled, and the weight values are 40%, 30%, and 30% respectively, then the service process of the child node server that can be scheduled corresponding to the weight value of 40% can be used as the service process to be scheduled for the child node server to be scheduled.

[0084] Step S205: According to the service indicated by the access request and the preset scheduling weight list, if it is determined that the number of weights with the highest value in the preset scheduling weight list is multiple, randomly determine the service process of one child node server from the child node servers corresponding to the weights with the highest value as the service process to be scheduled for the child node server to be scheduled.

[0085] Specifically, the business process of the child node server to be scheduled can be determined based on the business indicated by the access request received in step S203 and the preset scheduling weight list generated in step S202. Among them, if there are multiple weights with the highest value in the preset scheduling weight list, a business process of a child node server randomly determined from the child node servers corresponding to the highest value of the weight is used as the business process of the child node server to be scheduled. For example: if, based on the business indicated by the access request and the preset scheduling weight list, there are three schedulable business processes of the schedulable child node servers, with weight values of 40%, 40%, and 30% respectively, then one of the schedulable business processes of the two schedulable child node servers corresponding to the weight value of 40% can be randomly used as the business process of the child node server to be scheduled.

[0086] Optionally, if multiple access requests triggered by the user are received simultaneously in step S101 or step S203, and the business types corresponding to each access request are the same, during the process of determining the business process of the child node server to be scheduled based on the business indicated by the access request and the preset scheduling weight list, the business process of the child node server to be scheduled can be allocated to each access request according to the weights of the schedulable business processes of each schedulable child node server. For example: if ten access requests corresponding to the same business type triggered by the user are received simultaneously, and there are three schedulable business processes of the schedulable child node servers determined according to the preset scheduling weight list, with weight values of 40%, 30%, and 30% respectively, then the business process of the child node server to be scheduled can be allocated to each access request according to each weight value. For example, the business process of the schedulable child node server corresponding to the weight value of 40% is allocated to four access requests, and the business processes of the schedulable child node servers corresponding to the weight value of 30% are respectively allocated to three access requests.

[0087] Step S206: Send the access request to the child node server to be scheduled.

[0088] Among them, the child node server to be scheduled is used to execute the business indicated by the access request based on the business process to be scheduled to obtain an access result.

[0089] Specifically, the specific description of this step can refer to the description in step S103, and will not be elaborated in this embodiment.

[0090] Step S207: Receive the access result fed back by the child node server to be scheduled, and send the access result to the user.

[0091] Specifically, as described in step S103, the child node server to be scheduled is used to execute the service indicated by the access request based on the service process to be scheduled, so as to obtain an access result. Therefore, after sending the access request to the child node server to be scheduled, the access result fed back by the child node server to be scheduled can be received, where the access result corresponds to the access request. If the access result corresponding to the access request is received, the received access result can be sent to the user corresponding to the access result, that is, the user corresponding to the access request.

[0092] Another distributed service scheduling method provided in this embodiment adds a process of generating a preset scheduling weight list on the basis of the embodiment shown, and describes the process of determining the service process to be scheduled of the child node server to be scheduled respectively when the number of weights with the highest value in the preset scheduling weight list is one and when the number of weights with the highest value in the preset scheduling weight list is multiple. Among them, according to the scheduling parameters such as the performance parameters and status parameters of the child node server and the service process obtained, a preset scheduling weight list associated with the performance and status of the child node server and the service process can be generated, which can schedule the service process of the child node server more reasonably and improve the user experience of the distributed service scheduling method. Among them, when the number of weights with the highest value in the preset scheduling weight list is one and when the number of weights with the highest value in the preset scheduling weight list is multiple, the process of determining the service process to be scheduled of the child node server to be scheduled is set respectively, which can also improve the rationality of determining the service process to be scheduled of the child node server to be scheduled and improve the user experience of the distributed service scheduling method. Figure 1 Same as above.

[0093] Figure 3 It is a schematic flowchart of the distributed service scheduling method provided in the third embodiment of the present application, and the execution subject is the child node server, which can generally be implemented by software, or by hardware, or by a combination of software and hardware.

[0094] As Figure 3 shown, the distributed service scheduling method of this embodiment may include the following steps:

[0095] Step S301, receive an access request sent by the scheduling server.

[0096] Specifically, an access request sent by a scheduling server can be received. For the description of the access request, reference can be made to the description in step S101, which will not be elaborated in this embodiment. The access request is used to represent an access service, indicating the service to be accessed, and the service has a service type. The access request is triggered by a user. The access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled based on the service indicated by the access request and a preset scheduling weight list. The preset scheduling weight list includes weights corresponding to both the child node server and the service process. The preset scheduling weight list corresponds to the service type of the service. For the description of the preset scheduling weight list, reference can be made to the description in step S102, which will not be elaborated in this embodiment. The access request received by the child node server is the access request based on which the child node server is determined to be the child node server to be scheduled, that is, only when the child node server is the child node server to be scheduled can it receive the access request sent by the scheduling server.

[0097] Step S302: Based on the service process corresponding to the service indicated by the access request, execute the service indicated by the access request to obtain an access result.

[0098] Specifically, after receiving the access request sent by the scheduling server described in step S301, the service indicated by the access request can be executed based on the service process corresponding to the service indicated by the access request to obtain an access result. The service process corresponding to the service indicated by the access request is the service process to be scheduled, and the type of the service corresponding to the service process to be scheduled is the same as the type of the service indicated by the access request. For the description of the service process to be scheduled, reference can be made to the description in step S102, which will not be elaborated in this embodiment.

[0099] The distributed service scheduling method provided in this embodiment receives an access request sent by a scheduling server, executes the service indicated by the access request based on the service process corresponding to the service indicated by the access request to obtain an access result. The access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled based on the service indicated by the access request and a preset scheduling weight list. The preset scheduling weight list includes weights corresponding to both the child node server and the service process, and can reasonably schedule the received access request and reasonably execute the service process corresponding to the access request indicated by the access request, improving the user experience of the distributed service scheduling method.

[0100] Figure 4 It is a schematic flowchart of another distributed service scheduling method provided in the fourth embodiment of the present application. Figure 3Based on the basic implementation example shown, the present application describes in detail the process of another distributed service scheduling method.

[0101] As Figure 4 shown, another distributed service scheduling method of this embodiment may include the following steps:

[0102] Step S401: Determine the scheduling parameters corresponding to the service processes loaded by the child node servers.

[0103] Specifically, the scheduling parameters corresponding to the service processes loaded by the child node servers can be determined. Among them, the scheduling parameters include one or more of the following parameters: the first performance parameter, the second performance parameter, the first status parameter, and the second status parameter. The first performance parameter is a parameter characterizing the performance of the service process, the second performance parameter is a parameter characterizing the performance of the child node server to which the service process belongs, the first status parameter is a parameter characterizing the status of the service process, and the second status parameter is a parameter characterizing the status of the child node server to which the service process belongs. Among them, the descriptions of the first performance parameter, the second performance parameter, the first status parameter, and the second status parameter can refer to the descriptions in step S201, and will not be elaborated in this embodiment.

[0104] Among them, this application does not limit the method for determining the scheduling parameters corresponding to the service processes loaded by the child node servers. Optionally, if it is monitored in real time based on the scheduled child node server parameter collector that the running state of the child node server changes, then determine the second state parameter of the child node server and send the second state parameter to the scheduled service process parameter collector. Among them, the child node server parameter collector Exporter is used to monitor in real time the change in the running state of the child node server. For example, the running state of the child node server changes from running error to normal operation, or from normal operation to running error. Among them, the second state parameter of the child node server includes the server flag of the child node server. If it is monitored in real time based on the scheduled service process parameter collector that the running state of the service process loaded by the child node server changes, then determine the first state parameter of the service process loaded by the child node server. Among them, the service process parameter collector Agent is used to monitor in real time the change in the running state of the service process loaded by the child node server. For example, the running state of the service process loaded by the child node server changes from running error to normal operation, or from normal operation to running error. Among them, the first state parameter of the service process loaded by the child node server includes the type of the service corresponding to the service process. Optionally, based on the scheduled child node server parameter collector, the second performance parameter of the child node server is obtained in real time and the second performance parameter is sent to the scheduled service process parameter collector. Among them, the child node server parameter collector Exporter is also used to obtain in real time the second performance parameter of the child node server. Among them, the second performance parameter of the child node server includes the server flag of the child node server. Based on the scheduled service process parameter collector, the first performance parameter of the service process loaded by the child node server is obtained in real time. Among them, the service process parameter collector Agent is also used to obtain in real time the first performance parameter of the service process loaded by the child node server. Among them, the first performance parameter of the service process loaded by the child node server includes the type of the service corresponding to the service process. Optionally, based on the scheduled service process parameter collector, the first performance parameter of the service process loaded by the child node server can be obtained with a preset collection period. Among them, the collection period can be preset according to the user's needs. The shorter the collection period is set, the more frequent the frequencies of collecting the first performance parameter and the second performance parameter are.

[0105] Optionally, this step can also be set in the whole process of implementing the distributed service scheduling method to achieve real-time monitoring of the scheduling parameters.

[0106] Step S402: Feed back the scheduling parameters corresponding to the service processes loaded by the child node servers to the scheduling server.

[0107] Among them, the scheduling parameters of the service processes of each child node server are used to generate a preset scheduling weight list.

[0108] Specifically, after determining the scheduling parameters corresponding to the service processes loaded by the child node server, the scheduling parameters corresponding to the service processes loaded by the child node server can be fed back to the scheduling server. Herein, this application does not limit the manner of feeding back the scheduling parameters corresponding to the service processes loaded by the child node server to the scheduling server. Optionally, if it is determined that the first status parameter and / or the second status parameter is collected, then based on the scheduled service process parameter collector, the collected first status parameter and / or the second status parameter are sent to the scheduling server. That is, when it is determined that the operating status of the child node server and / or the operating status of the service processes loaded by the child node server changes, then based on the scheduled service process parameter collector, the collected first status parameter and / or the second status parameter are sent to the scheduling server. Among them, the service process parameter collector Agent is also used to send the collected first status parameter and / or the second status parameter to the scheduling server. When feeding back the first status parameter and / or the second status parameter to the scheduling server, the preset scheduling weight list and the operating status list are also updated along with the update of the first status parameter and / or the second operating status. Optionally, the collected first performance parameter and second performance parameter can be reported to the scheduling server based on the scheduled service process parameter collector at a preset reporting period. Among them, the reporting period can be preset according to the user's needs. The shorter the reporting period is set, the more frequent the feedback of the first performance parameter and the second performance parameter to the scheduling server is. When the first performance parameter and / or the second performance parameter is fed back to the scheduling server, if the first performance parameter and / or the second performance parameter is updated, the preset scheduling weight list is also updated along with the update of the first performance parameter and / or the second performance parameter. Optionally, in step S401, if the first performance parameter of the service processes loaded by the child node server is obtained based on the scheduled service process parameter collector at a preset collection period, and if it is determined that the first performance parameter and / or the second performance parameter is collected, then based on the scheduled service process parameter collector, the collected first performance parameter and second performance parameter are sent to the scheduling server.

[0109] Step S403: Receive the access request sent by the scheduling server.

[0110] Specifically, an access request sent by a scheduling server can be received. For the description of this step, reference can be made to the description in step S301, which will not be elaborated in this embodiment. The access request is used to represent an access service, indicating the service to be accessed, and the service has a service type. The access request is triggered by a user. The access request is sent by the scheduling server after determining the service process to be scheduled for the sub-node server to be scheduled based on the service indicated by the access request and a preset scheduling weight list. The preset scheduling weight list includes weights corresponding to both the sub-node server and the service process. The preset scheduling weight list corresponds to the service type of the service.

[0111] Step S404: Based on the service process corresponding to the service indicated by the access request, execute the service indicated by the access request to obtain an access result.

[0112] Specifically, based on the service process corresponding to the service indicated by the access request, the service indicated by the access request can be executed to obtain an access result. For the description of this step, reference can be made to the description in step S302, which will not be elaborated in this embodiment.

[0113] Step S405: Send the access result to the scheduling server.

[0114] Specifically, the access result obtained in step S404 can be sent to the scheduling server. For the description of the access result, reference can be made to the description in step S207, which will not be elaborated in this embodiment.

[0115] Another distributed service scheduling method provided in this embodiment is based on Figure 3 the embodiment shown, and expands the description of the process of determining the scheduling parameters corresponding to the service process loaded by the sub-node server and feeding back the scheduling parameters corresponding to the service process loaded by the sub-node server to the scheduling server. Among them, based on the scheduled service process parameter collector and the scheduled sub-node server parameter collector, the performance parameters and status parameters of the sub-service server and the service process loaded by the sub-service server are monitored or collected in real time, realizing the real-time update of the scheduling parameters, further improving the accuracy of the preset scheduling weight list and the running status list generated according to the scheduling parameters, and improving the user experience of the distributed service scheduling method.

[0116] Figure 5 It is a schematic structural diagram of a distributed service scheduling device provided in the fifth embodiment of the present application.

[0117] As Figure 5 shown, the distributed service scheduling device 50 in this embodiment includes: a receiving module 51, a determining module 52, and a scheduling module 53.

[0118] A receiving module 51, configured to receive an access request triggered by a user; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type;

[0119] A determining module 52, configured to determine a service process to be scheduled of a child node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0120] A scheduling module 53, configured to send the access request to the child node server to be scheduled; wherein, the child node server to be scheduled is configured to execute the service indicated by the access request based on the service process to be scheduled to obtain an access result.

[0121] The device provided in this embodiment can be used to execute the technical solution of the above method embodiment Figures 1 to 2 The implementation principle and technical effect are similar, and will not be elaborated here in this embodiment.

[0122] Figure 6 It is a schematic structural diagram of a distributed service scheduling device provided in the sixth embodiment of the present application.

[0123] As Figure 6 shown, the distributed service scheduling device 60 in this embodiment includes: a first receiving module 61, a determining module 62, a scheduling module 63, an obtaining module 64, a generating module 65, a second receiving module 66, and a sending module 67. Among them, the determining module 62 includes: a first determining unit 621 and a second determining unit 622. Among them, the obtaining module 64 includes: a first obtaining unit 641 and a second obtaining unit 642. Among them, the generating module 65 includes: a first generating unit 651 and a second generating unit 652.

[0124] The first receiving module 61 is configured to receive an access request triggered by a user; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type;

[0125] The determining module 62 is configured to determine a service process to be scheduled of a child node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0126] The first determination unit 621 is configured to, if it is determined that the number of weights with the highest value in the preset scheduling weight list is one, determine the service process of the child node server corresponding to the weight with the highest value as the service process to be scheduled of the child node server to be scheduled;

[0127] The second determination module 622 is configured to, if it is determined that there are multiple weights with the highest value in the preset scheduling weight list, randomly determine the service process of one child node server from the child node servers corresponding to the weights with the highest value as the service process to be scheduled of the child node server to be scheduled.

[0128] The scheduling module 63 is configured to send an access request to the child node server to be scheduled; wherein, the child node server to be scheduled is configured to execute the service indicated by the access request based on the service process to be scheduled to obtain an access result.

[0129] The obtaining module 64 is configured to obtain the scheduling parameters corresponding to the service processes loaded by each child node server; wherein, the scheduling parameters include one or more of the following parameters: the first performance parameter, the second performance parameter, the first status parameter, and the second status parameter; the first performance parameter is a parameter characterizing the performance of the service process, the second performance parameter is a parameter characterizing the performance of the child node server to which the service process belongs, the first status parameter is a parameter characterizing the status of the service process, and the second status parameter is a parameter characterizing the status of the child node server to which the service process belongs;

[0130] The first obtaining unit 641 is configured to receive the first status parameter and the second status parameter sent by the child node server; wherein, the first status parameter and the second status parameter are reported by the child node server when it determines that the running status of the child node server has changed or when it determines that the running status of the service process loaded by the child node server has changed through real-time monitoring;

[0131] The second obtaining unit 642 is configured to receive the first performance parameter and the second performance parameter reported by each child node server at a preset reporting period.

[0132] The generating module 65 is configured to generate a preset scheduling weight list according to the scheduling parameters of the service processes of each child node server.

[0133] The first generating module 651 is configured to generate a running status list according to the first status parameter and the second status parameter in the scheduling parameters of the service processes of each child node server; wherein, the running status list characterizes the status of the service processes of the child node servers.

[0134] The second generation module 652 is configured to generate a preset scheduling weight list according to the running status list, the first performance parameter and the second performance parameter in the scheduling parameters of the business processes of each child node server.

[0135] The second receiving module 66 is configured to receive the access result fed back by the child node server to be scheduled;

[0136] The sending module 67 is configured to send the access result to the user.

[0137] The device provided in this embodiment can be used to execute the technical solution of the above method embodiment Figures 1 to 2 The implementation principle and technical effect are similar, and will not be elaborated here in this embodiment.

[0138] Figure 7 It is a schematic structural diagram of a distributed service scheduling device provided in the seventh embodiment of the present application.

[0139] As Figure 7 shown, the distributed service scheduling device 70 in this embodiment includes: a receiving module 71 and an execution module 72.

[0140] The receiving module 71 is configured to receive an access request sent by a scheduling server; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; the access request is triggered by a user; the access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled based on the service indicated by the access request and the preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0141] The execution module 72 is configured to execute the service indicated by the access request based on the service process corresponding to the service indicated by the access request to obtain an access result.

[0142] The device provided in this embodiment can be used to execute the technical solution of the above method embodiment Figures 3 to 4 The implementation principle and technical effect are similar, and will not be elaborated here in this embodiment.

[0143] Figure 8 It is a schematic structural diagram of a distributed service scheduling device provided in the eighth embodiment of the present application.

[0144] As Figure 8As shown in the figure, the distributed service scheduling device 80 of this embodiment includes: a receiving module 81, an execution module 82, a determination module 83, a feedback module 84, and a sending module 85. Among them, the determination module 83 includes: a first determination unit 831, a second determination unit 832, a third determination unit 833, and a fourth determination unit 834. Among them, the feedback unit 84 includes: a first feedback unit 841 and a second feedback unit 842.

[0145] The receiving module 81 is configured to receive an access request sent by a scheduling server; among them, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; the access request is triggered by a user; the access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled based on the service indicated by the access request and a preset scheduling weight list; among them, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service;

[0146] The execution module 82 is configured to execute the service indicated by the access request based on the service process corresponding to the service indicated by the access request, and obtain an access result.

[0147] The determination module 83 is configured to determine scheduling parameters corresponding to the service process loaded by the child node server; among them, the scheduling parameters include one or more of the following parameters: a first performance parameter, a second performance parameter, a first status parameter, and a second status parameter; the first performance parameter is a parameter representing the performance of the service process, the second performance parameter is a parameter representing the performance of the child node server to which the service process belongs, the first status parameter is a parameter representing the status of the service process, and the second status parameter is a parameter representing the status of the child node server to which the service process belongs;

[0148] The first determination unit 831 is configured to, if it is monitored in real time based on the child node server parameter collector that the running state of the child node server changes, determine the second status parameter of the child node server, and send the second status parameter to the scheduled service process parameter collector;

[0149] The second determination unit 832 is configured to, if it is monitored in real time based on the service process parameter collector that the running state of the service process loaded by the child node server changes, determine the first status parameter of the service process loaded by the child node server;

[0150] The third determination unit 833 is configured to, based on the child node server parameter collector, obtain the second performance parameter of the child node server in real time, and send the second performance parameter to the scheduled service process parameter collector;

[0151] The fourth determination unit 834 is configured to obtain, in real time, first performance parameters of the service processes loaded by the child node server based on the scheduled service process parameter collector.

[0152] The feedback module 84 is configured to feedback scheduling parameters corresponding to the service processes loaded by the child node server to the scheduling server; wherein, the scheduling parameters of the service processes of each child node server are used to generate a preset scheduling weight list.

[0153] The first feedback unit 841 is configured to, if it is determined that the first status parameter and / or the second status parameter are collected, send the collected first status parameter and / or the second status parameter to the scheduling server based on the scheduled service process parameter collector;

[0154] The second feedback unit 842 is configured to report the collected first performance parameter and second performance parameter to the scheduling server at a preset reporting period based on the scheduled service process parameter collector.

[0155] The sending module 85 is configured to send the access result to the scheduling server.

[0156] The device provided in this embodiment can be used to execute the technical solutions of the above method embodiments Figures 3 to 4 The implementation principle and technical effects are similar, and will not be elaborated here in this embodiment.

[0157] Figure 9 It is a schematic structural diagram of a distributed service scheduling system provided in the ninth embodiment of the present application.

[0158] As Figure 9 shown, the distributed service scheduling system 90 of this embodiment includes a scheduling server 91 and at least one child node server 92;

[0159] Among them, the scheduling server is configured to execute the method of any one of the above method embodiments Figures 1 to 2 The child node server is configured to execute the method of any one of the above method embodiments Figures 3 to 4 The method.

[0160] Figure 10 It is a schematic structural diagram of an electronic device provided in the tenth embodiment of the present application.

[0161] As Figure 10 shown, the distributed service scheduling device 100 of this embodiment includes: a processor 101, a memory 102, and a communication interface 103.

[0162] The memory 102 is used to store executable instructions of the processor;

[0163] Among them, the processor 101 is configured to execute the above method embodiments by executing the executable instructionsFigures 1 to 2 The distributed service scheduling method according to any one of the above, or the method embodiments described above Figures 1 to 2 The distributed service scheduling method according to any one of the above.

[0164] In the above-mentioned Figure 10 In the illustrated embodiment, it should be understood that the processor may be a central processing unit (abbreviation: CPU in English: Central Processing Unit), or may also be other general-purpose processors, digital signal processors (abbreviation: DSP in English: Digital Signal Processor), application specific integrated circuits (abbreviation: ASIC in English: Application SpecificIntegrated Circuit), etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in combination with the invention can be directly implemented by the execution of the hardware processor, or can be implemented by the combination of the hardware and software modules in the processor.

[0165] The memory may include a high-speed memory (Random Access Memory, RAM), and may also include a non-volatile memory (Non-volatile Memory, NVM), such as at least one disk memory.

[0166] The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, the bus in the drawings of the present application is not limited to only one bus or one type of bus.

[0167] The embodiments of the present application further provide a readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the method embodiments described above are implemented Figures 1 to 2 The method according to any one of the above, or the method embodiments described above Figures 3 to 4 The method according to any one of the above.

[0168] It should be noted that, for the foregoing method embodiments, for the sake of simple description, they are all expressed as a series of action combinations. However, those skilled in the art should know that this application is not limited by the described action sequence, because according to this application, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily essential to this application.

[0169] Furthermore, it should be noted that although the steps in the flowchart are displayed in sequence according to the arrows, these steps do not necessarily have to be executed in the order indicated by the arrows. Unless there is a clear description in this article, the execution of these steps has no strict order limit, and these steps can be executed in other orders. Moreover, at least some of the steps in the flowchart may include multiple sub-steps or multiple stages. These sub-steps or stages do not necessarily have to be executed at the same time, but can be executed at different times. The execution order of these sub-steps or stages does not necessarily have to be sequential, but can be executed alternately or in turn with at least a part of other steps or sub-steps or stages of other steps.

[0170] It should be understood that the above device embodiments are merely illustrative, and the devices of this application can also be implemented in other ways. For example, the division of units / modules in the above embodiments is only a logical function division, and there can be other division methods in actual implementation. For example, multiple units, modules or components can be combined, or can be integrated into another system, or some features can be ignored or not executed.

[0171] In addition, without special instructions, in each embodiment of this application, the functional units / modules can be integrated in one unit / module, or each unit / module can exist physically alone, or two or more units / modules can be integrated together. The above integrated unit / module can be implemented in the form of hardware or in the form of a software program module.

[0172] When the integrated unit / module is implemented in the form of hardware, the hardware can be a digital circuit, an analog circuit, etc. The physical implementation of the hardware structure includes but is not limited to transistors, memristors, etc. Unless otherwise specified, the processor can be any suitable hardware processor, such as CPU, GPU, FPGA, DSP, and ASIC, etc. Unless otherwise specified, the storage unit can be any suitable magnetic storage medium or magneto-optical storage medium, such as resistive random access memory (RRAM), dynamic random access memory (DRAM), static random access memory (SRAM), enhanced dynamic random access memory (EDRAM), high-bandwidth memory (HBM), hybrid memory cube (HMC), etc.

[0173] When the integrated unit / module is implemented in the form of a software program module and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a memory and includes several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. And the aforementioned memory includes: USB flash drives, read-only memory (ROM), random access memory (RAM), mobile hard disks, magnetic disks, or optical discs and other various media that can store program codes.

[0174] In the above embodiments, the descriptions of the various embodiments have their own emphases. For the parts not detailed in a certain embodiment, reference can be made to the relevant descriptions of other embodiments. The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as the scope recorded in this specification.

[0175] Those skilled in the art will readily conceive of other embodiments of the present application after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present application, which follow the general principles of the present application and include known common general knowledge or conventional technical means in the technical field not disclosed in the present application. The specification and examples are only regarded as exemplary, and the true scope and spirit of the present application are pointed out by the following claims.

[0176] It should be understood that the present application is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present application is only limited by the appended claims.

Claims

1. A distributed service scheduling method, characterized in that, applied to a scheduling server, including: Receiving an access request triggered by a user; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; According to the service indicated by the access request and a preset scheduling weight list, determining the service process to be scheduled of the sub-node server to be scheduled; wherein, the preset scheduling weight list includes the weights corresponding to the sub-node server and the service process; the preset scheduling weight list corresponds to the service type of the service; Sending the access request to the sub-node server to be scheduled; wherein, the sub-node server to be scheduled is used to execute the service indicated by the access request based on the service process to be scheduled to obtain an access result.

2. The method according to claim 1, characterized in that, According to the service indicated by the access request and a preset scheduling weight list, determining the service process to be scheduled of the sub-node server to be scheduled includes: If it is determined that the number of weights with the highest value in the preset scheduling weight list is one, determining the service process of the sub-node server corresponding to the weight with the highest value as the service process to be scheduled of the sub-node server to be scheduled; If it is determined that the number of weights with the highest value in the preset scheduling weight list is multiple, randomly determining the service process of one sub-node server from the sub-node servers corresponding to the weights with the highest value as the service process to be scheduled of the sub-node server to be scheduled.

3. The method according to claim 1, characterized in that, The method further includes: Obtaining the scheduling parameters corresponding to the service processes loaded by each sub-node server; wherein, the scheduling parameters include one or more of the following parameters: a first performance parameter, a second performance parameter, a first status parameter, a second status parameter; the first performance parameter is a parameter characterizing the performance of the service process, the second performance parameter is a parameter characterizing the performance of the sub-node server to which the service process belongs, the first status parameter is a parameter characterizing the status of the service process, and the second status parameter is a parameter characterizing the status of the sub-node server to which the service process belongs; Generating the preset scheduling weight list according to the scheduling parameters of the service processes of each sub-node server.

4. The method according to claim 3, characterized in that, The obtaining the scheduling parameters corresponding to the service processes loaded by each sub-node server includes: Receiving the first status parameter and the second status parameter sent by the sub-node server; wherein, the first status parameter and the second status parameter are reported by the sub-node server when it determines that the running status of the sub-node server has changed through real-time monitoring, or when it determines that the running status of the service process loaded by the sub-node server has changed; Receiving the first performance parameter and the second performance parameter reported by each sub-node server at a preset reporting period.

5. The method according to claim 3, characterized in that, Generate the preset scheduling weight list according to the scheduling parameters of the service processes of each of the child node servers, including: Generate a running status list according to the first status parameter and the second status parameter in the scheduling parameters of the service processes of each of the child node servers; wherein, the running status list characterizes the status of the service processes of the child node servers; Generate the preset scheduling weight list according to the running status list, the first performance parameter and the second performance parameter in the scheduling parameters of the service processes of each of the child node servers.

6. The method according to any one of claims 1-5, characterized in that, the method further includes: Receive the access result fed back by the child node server to be scheduled; Send the access result to the user.

7. A distributed service scheduling method, characterized in that, Applied to a child node server, including: Receive the access request sent by the scheduling server; wherein, the access request is used to characterize the access service, the access request indicates the service to be accessed, and the service has a service type; the access request is triggered by a user; the access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled based on the service indicated by the access request and the preset scheduling weight list; wherein, the preset scheduling weight list includes the weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service; Execute the service indicated by the access request based on the service process corresponding to the service indicated by the access request to obtain an access result.

8. The method according to claim 7, characterized in that, the method further includes: Determine the scheduling parameters corresponding to the service processes loaded by the child node server; wherein, the scheduling parameters include one or more of the following parameters: a first performance parameter, a second performance parameter, a first status parameter, a second status parameter; the first performance parameter is a parameter characterizing the performance of the service process, the second performance parameter is a parameter characterizing the performance of the child node server to which the service process belongs, the first status parameter is a parameter characterizing the status of the service process, and the second status parameter is a parameter characterizing the status of the child node server to which the service process belongs; Feed back the scheduling parameters corresponding to the service processes loaded by the child node server to the scheduling server; wherein, the scheduling parameters of the service processes of each of the child node servers are used to generate the preset scheduling weight list.

9. The method according to claim 8, characterized in that, Determining the scheduling parameters corresponding to the service processes loaded by the child node server includes: If it is monitored in real time by the scheduled child node server parameter collector that the running status of the child node server changes, determine the second status parameter of the child node server and send the second status parameter to the scheduled service process parameter collector; If, based on the scheduled service process parameter collector, it is monitored in real time that the running state of the service process loaded by the child node server changes, then determine the first state parameter of the service process loaded by the child node server; Based on the scheduled child node server parameter collector, obtain the second performance parameter of the child node server in real time, and send the second performance parameter to the scheduled service process parameter collector; Based on the scheduled service process parameter collector, obtain the first performance parameter of the service process loaded by the child node server in real time.

10. The method according to claim 8, wherein, feeding back to the scheduling server the scheduling parameters corresponding to the service process loaded by the child node server, including: if it is determined that the first state parameter and / or the second state parameter is collected, then based on the scheduled service process parameter collector, send the collected first state parameter and / or the second state parameter to the scheduling server; Based on the scheduled service process parameter collector, report the collected first performance parameter and second performance parameter to the scheduling server at a preset reporting period.

11. The method according to any one of claims 7-10, wherein, the method further includes: sending the access result to the scheduling server.

12. A distributed service scheduling device, wherein, comprising: a receiving module, configured to receive an access request triggered by a user; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; a determining module, configured to determine the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service; a scheduling module, configured to send the access request to the child node server to be scheduled; wherein, the child node server to be scheduled is configured to execute the service indicated by the access request based on the service process to be scheduled to obtain an access result.

13. A distributed service scheduling device, wherein, comprising: a receiving module, configured to receive the access request sent by the scheduling server; wherein, the access request is used to represent an access service, the access request indicates the service to be accessed, and the service has a service type; the access request is triggered by a user; the access request is sent by the scheduling server after determining the service process to be scheduled of the child node server to be scheduled according to the service indicated by the access request and a preset scheduling weight list; wherein, the preset scheduling weight list includes weights corresponding to both the child node server and the service process; the preset scheduling weight list corresponds to the service type of the service; an execution module, configured to execute the service indicated by the access request based on the service process corresponding to the service indicated by the access request to obtain an access result.

14. A distributed service scheduling system, It is characterized in that including: a scheduling server and at least one sub-node server; wherein, the scheduling server is configured to execute the method described in any one of claims 1-6, and the sub-node server is configured to execute the method described in any one of claims 7-11.

15. An electronic device It is characterized in that including: a processor, a memory, and a communication interface; the memory is configured to store executable instructions of the processor; wherein, the processor is configured to execute the method described in any one of claims 1-6 or execute the method described in any one of claims 7-11 by executing the executable instructions.

16. A readable storage medium having a computer program stored thereon It is characterized in that when the computer program is executed by a processor, it implements the method described in any one of claims 1-6 or implements the method described in any one of claims 7-11.