Grayscale verification method, device, electronic device and storage medium
By receiving and summarizing the operation results of grayscale application nodes, the grayscale verification function is automatically solved, and the problem of high manual participation in grayscale verification is improved, and the efficiency and accuracy of verification are improved.
Patent Information
- Application Number
- CN202011542174.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-12-23
- Publication Date
- 2024-12-20
- Estimated Expiration
- 2040-12-23
AI Technical Summary
There is a high level of manual participation in the grayscale verification process, which limits automation and intelligence, resulting in the impact of the efficiency and accuracy of grayscale release.
By receiving the functional operation results from multiple grayscale application nodes, summarizing and recording them in the preset result table, determining the grayscale verification results based on the summary table, realizing an automated verification process and reducing manual intervention.
It improves the automation level of grayscale verification, accurately tracks the operation of functions, reduces the dependence of manual verification, and improves the efficiency and accuracy of the verification process.
Smart Images

Figure CN112612507B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of Internet technology, and more specifically, to a grayscale verification method, device, electronic device and storage medium. Background Art
[0002] Grayscale release is a way of gradually transitioning from non-release to formal release when the system is put into production. In order to avoid affecting the functions that have been running stably, an independent grayscale server will be deployed to install the new version of the program, and other servers will still keep the old version of the program to provide normal services to the outside world. During the grayscale verification period, the old and new versions of the program coexist at the same time. The old version provides normal services to most customers, and only the new version is controlled and released to specific grayscale users. If there is a problem with the new version of the program, the impact range will be controlled to some users (ie "grayscale users") through measures such as rapid traffic switching back, so as to avoid or reduce the risks brought to production by the new version.
[0003] In the process of implementing the concept of the present disclosure, the inventors found that there are at least the following problems in the related art:
[0004] Grayscale verification is generally performed by technical personnel who review Grayscale transaction logs and analyze and confirm whether the Grayscale content is running correctly. It has the defect of high manual participation, which limits the automation of Grayscale releases and the intelligence of software system operation and maintenance. Summary of the invention
[0005] In view of this, the present disclosure provides a grayscale verification method, a grayscale verification device, an electronic device, and a computer-readable storage medium.
[0006] One aspect of the present disclosure provides a grayscale verification method, including: receiving the operating results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2; according to the operating result of each grayscale function, adding a record of the operating result of the grayscale function to a preset result summary table; and determining the grayscale verification result based on the added result summary table.
[0007] According to an embodiment of the present disclosure, the adding of an operation result record about the grayscale function in a preset result summary table according to the operation result of each grayscale function includes at least one of the following operations: for a first type of grayscale function involving a single grayscale application node, adding an operation result record about the first type of grayscale function in a first result summary table according to the operation result of the first type of grayscale function; and for a second type of grayscale function involving n grayscale application nodes in a function execution link, obtaining the operation results of the second type of grayscale function in the n grayscale application nodes involved, and adding an operation result record about the second type of grayscale function in a second result summary table according to the operation results in the n grayscale application nodes, where n is an integer greater than or equal to 2. The determining of the grayscale verification result based on the added result summary table includes: determining the grayscale verification result based on the added first result summary table and / or the added second result summary table.
[0008] According to an embodiment of the present disclosure, the first category of grayscale functions includes a first grayscale function; the adding of operation result records about the first category of grayscale functions in the first result summary table includes: adding at least the identification information of the first grayscale function and the operation result of the first grayscale function as the operation result records of the first grayscale function to the first result summary table.
[0009] According to an embodiment of the present disclosure, the first type of grayscale function includes a second grayscale function, the second grayscale function includes p sub-grayscale functions, and the operation result of the second grayscale function includes the operation results of q sub-grayscale functions among the p sub-grayscale functions, p is an integer greater than or equal to 2, and q is an integer greater than or equal to 1 and less than or equal to p; adding the operation result record of the first type of grayscale function to the first result summary table includes: at least adding the identification information of the second grayscale function, and the identification information and the operation result of each sub-grayscale function among the q sub-grayscale functions as an operation result record of the second grayscale function to the first result summary table.
[0010] According to an embodiment of the present disclosure, the method also includes: after the grayscale verification is performed for a predetermined period of time, determining whether the first result summary table covers each grayscale function in the first category of grayscale functions to be verified; if not, determining the grayscale functions in the first category of grayscale functions to be verified that are not covered by the first result summary table as target grayscale functions, and notifying the grayscale application node to increase the requested access volume of the grayscale device, or notifying the user to perform verification on the target grayscale function.
[0011] According to an embodiment of the present disclosure, determining the grayscale verification result based on the first result summary table includes: determining the operation success rate of each grayscale function in the first result summary table; if the operation success rate of the grayscale function is greater than or equal to a preset success rate threshold, the grayscale function is considered to have been verified; if the operation success rate of the grayscale function is less than the preset success rate threshold, the grayscale function is considered to have failed verification, and the grayscale application node is notified to switch the request corresponding to the grayscale function from the grayscale device back to the non-grayscale device.
[0012] According to an embodiment of the present disclosure, the second category of grayscale functions includes a third grayscale function; the adding of records about the second category of grayscale functions in the second result summary table includes: adding at least the identification information of the third grayscale function, the grayscale application nodes that have successfully run among the n grayscale application nodes involved in the third grayscale function, and the grayscale application nodes that have failed to run as operation result records of the third grayscale function to the second result summary table.
[0013] According to an embodiment of the present disclosure, determining the grayscale verification result based on the second result summary table includes: determining the operation success rate of n grayscale application nodes involved in each grayscale function in the second result summary table; if the operation success rate of the grayscale function in the n grayscale application nodes involved is greater than or equal to a preset success rate threshold, then it is considered that the grayscale function has been verified in the n grayscale application nodes; if the operation success rate of the grayscale function in a first part of the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, and the operation success rate in the second part of the grayscale application nodes is less than the preset success rate threshold, then it is considered that the grayscale function has been verified in the first part of the grayscale application nodes, and has failed the verification in the second part of the grayscale application nodes.
[0014] Another aspect of the present disclosure provides a grayscale verification device, including: a receiving module for receiving the operating results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2; a recording module for adding an operating result record of the grayscale function to a preset result summary table according to the operating result of each grayscale function; and a verification module for determining the grayscale verification result based on the added result summary table.
[0015] Another aspect of the present disclosure provides an electronic device, including: one or more processors; and a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method as described above.
[0016] Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions, which are used to implement the above method when executed.
[0017] Another aspect of the present disclosure provides a computer program product, including a computer program / instruction, which implements the method according to an embodiment of the present disclosure when the computer program / instruction is executed by a processor.
[0018] Another aspect of the present disclosure provides a grayscale verification system, including: m grayscale application nodes, where m is an integer greater than or equal to 2; and a grayscale verification device for executing the method described above.
[0019] According to the embodiments of the present disclosure, by summarizing the operating results of each grayscale function and judging whether the verification is passed based on the summarized results, accurate tracking and automatic verification of the operation of the grayscale functions are achieved, reducing the excessive reliance on manual verification during grayscale verification in related technologies and improving the automation of the grayscale verification process. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] The above and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:
[0021] Figure 1 An exemplary system architecture to which the grayscale verification method can be applied according to an embodiment of the present disclosure is schematically shown;
[0022] Figure 2 A flowchart of a grayscale verification method according to an embodiment of the present disclosure is schematically shown;
[0023] Figure 3 A schematic diagram of a verification platform according to an embodiment of the present disclosure is schematically shown;
[0024] Figure 4 Schematically shows an execution link diagram of the third grayscale function according to an embodiment of the present disclosure;
[0025] Figure 5 Schematically shows an execution link diagram of another grayscale function according to an embodiment of the present disclosure;
[0026] Figure 6 A flowchart of a grayscale verification device according to an embodiment of the present disclosure is schematically shown; and
[0027] Figure 7 A block diagram of an electronic device suitable for implementing a grayscale verification method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION
[0028] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.
[0029] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.
[0030] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.
[0031] In the case of using expressions such as "at least one of A, B, and C, etc.", it should generally be interpreted in accordance with the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.). In the case of using expressions such as "at least one of A, B, or C, etc.", it should generally be interpreted in accordance with the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, or C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).
[0032] An embodiment of the present disclosure provides a grayscale verification method, including: receiving the operating results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2; according to the operating result of each grayscale function, adding a record of the operating result of the grayscale function to a preset result summary table; and determining the grayscale verification result based on the added result summary table.
[0033] Figure 1 The exemplary system architecture 100 to which the grayscale verification method can be applied according to an embodiment of the present disclosure is schematically shown. It should be noted that: Figure 1What is shown is merely an example of a system architecture to which the embodiments of the present disclosure can be applied, in order to help those skilled in the art understand the technical content of the present disclosure, but it does not mean that the embodiments of the present disclosure cannot be used in other devices, systems, environments or scenarios.
[0034] like Figure 1 As shown, the system architecture 100 according to this embodiment may include a verification platform 110, an application node A, an application node B, and an application node C. Among them, application nodes A, B, and C may all include routing devices, gray servers, and normal servers (also referred to as non-gray servers). The gray server installs the new version of the program, and the normal server still maintains the old version of the program. The gray function may refer to a function that is newly added or modified during the current period. The function has differences between the new and old program versions, and is also the main content that needs to be verified during the gray verification. The formal release can only be implemented after the verification is passed. The routing device is used to distribute user requests to the gray server or the normal server. The request of a specific gray user is forwarded to the gray server to run the gray function, and the request of other users is forwarded to the normal server.
[0035] The grayscale servers of application nodes A, B, and C may send the running results of each grayscale function to the verification platform 110. The verification platform 110 summarizes the running results and determines whether the grayscale function has passed the verification based on the summarized results.
[0036] It should be noted that the grayscale verification method provided in the embodiment of the present disclosure can generally be executed by the verification platform 110. Accordingly, the grayscale verification device provided in the embodiment of the present disclosure can generally be set in the verification platform 110. The grayscale verification method provided in the embodiment of the present disclosure can also be executed by a server or server cluster that is different from the verification platform 110 and can communicate with the application nodes A, B and C and / or the verification platform 110. Correspondingly, the grayscale verification device provided in the embodiment of the present disclosure can also be set in a server or server cluster that is different from the verification platform 110 and can communicate with the application nodes A, B and C and / or the verification platform 110.
[0037] It should be understood that Figure 1 The number of verification platforms, application nodes, routing devices, gray servers and normal servers in the example is only illustrative. Any number of verification platforms, application nodes, routing devices, gray servers and normal servers may be provided according to implementation requirements.
[0038] Figure 2 The flowchart of the grayscale verification method according to the embodiment of the present disclosure is schematically shown.
[0039] like Figure 2 As shown, the method includes operations S210 to S230.
[0040] In operation S210 , the operating results of k grayscale functions from m grayscale application nodes are received, where m and k are both integers greater than or equal to 2.
[0041] In operation S220, according to the operation result of each grayscale function, a record of the operation result of the grayscale function is added to a preset result summary table.
[0042] In operation S230, a grayscale verification result is determined based on the added result summary table.
[0043] In the embodiments of the present disclosure, a grayscale application node may refer to an application node that includes a grayscale function to be verified, and each grayscale application node may include a grayscale server and a non-grayscale server. The verification platform may obtain the running results of the new version of the grayscale function from the grayscale server of each grayscale application node. Each grayscale application node may run one or more grayscale functions, and corresponding identification information (also referred to as an identification code) may be set for each grayscale function. For example, the identification information of the grayscale function Y1 may be trx-01, and the identification information of the grayscale function Y2 may be trx-02, and so on. After each grayscale server executes a grayscale function, it may immediately send the running result of the grayscale function to the verification platform, or the grayscale server may send the running result to the verification platform once every predetermined time. The running result may be represented by a feedback value of 0 or 1. When the feedback value is 1, it indicates that the running failed, and when the feedback value is 0, it indicates that the running succeeded. In the process of sending the running result, the identification information of the grayscale function is sent at the same time.
[0044] In the embodiment of the present disclosure, a result summary table can be pre-set, and each time a grayscale function operation result is received, a corresponding record is added to the result summary table. Then, after the m grayscale servers have been running for a period of time, the verification result of each grayscale function can be determined based on the records in the added result summary table.
[0045] According to the embodiments of the present disclosure, by summarizing the operation results of each grayscale function and judging whether the verification is passed based on the summarized results, accurate tracking and automatic verification of the grayscale function operation is achieved, reducing the situation of excessive reliance on manual verification during grayscale verification in related technologies, and improving the automation of the grayscale verification process. In addition, the result summary table can be displayed to the technician through the terminal device so that the technician can understand the operation status of the grayscale function.
[0046] According to an embodiment of the present disclosure, operation S220 may include at least one of the following operations (1) and (2):
[0047] (1) For a first-type grayscale function involving a single grayscale application node, according to the running result of the first-type grayscale function, a running result record of the first-type grayscale function is added to the first result summary table.
[0048] (2) For the second-category grayscale function involving n grayscale application nodes in the function execution link, the running results of the second-category grayscale function in the n grayscale application nodes involved are obtained, and according to the running results in the n grayscale application nodes, the records about the second-category grayscale function are added to the second result summary table, where n is an integer greater than or equal to 2.
[0049] In an embodiment of the present disclosure, after receiving the running result from the grayscale application node, it can be first determined whether the currently received one or more grayscale functions belong to the first type of grayscale function or the second type of grayscale function.
[0050] The first type of grayscale function involves a single grayscale application node, that is, the grayscale function can be realized by using a single grayscale application node. For example, application node A is responsible for mobile banking services and can realize functions such as account query functions. If the account query function is a grayscale function that needs to be verified at the moment, and the account query function can be realized through application node A, a grayscale application node, without the need for joint execution by other application nodes, then the account query function belongs to the first type of grayscale function.
[0051] The second type of grayscale function involves two or more grayscale application nodes. For example, the execution link of the second type of grayscale function contains two or more grayscale application nodes, and requires two or more grayscale application nodes to jointly execute. For example, application node A is responsible for mobile banking services, application node B is responsible for personal basic financial services, and application node D is responsible for notification message services. The execution link of the remittance function can be, for example: application node A-application node B-application node D. If the remittance function is a grayscale function that needs to be verified at the moment, and at least two application nodes among application nodes A, B and D are grayscale application nodes, then the remittance function belongs to the second type of grayscale function.
[0052] In addition, the first type of grayscale function may also include the situation involving a single grayscale application node in the execution link. For example, the execution link of the grayscale function Y1 is: application node A-application node C-application node D, where application node A is a grayscale application node, and application nodes C and D are not grayscale application nodes. Then the grayscale function Y1 can also be considered as a first type of grayscale function.
[0053] In an embodiment of the present disclosure, all functions that need to be grayscale verified at the current time can be classified in advance to obtain a first-category grayscale function set and a second-category grayscale function set. After receiving the grayscale function running results from the grayscale server, it can be determined whether the grayscale function belongs to the first-category grayscale function set or the second-category grayscale function set based on the identification information of the grayscale function, and then the grayscale function can be judged as a first-category grayscale function or a second-category grayscale function.
[0054] In an embodiment of the present disclosure, a first result summary table and a second result summary table may be pre-set, and each time a running result of a first-class grayscale function is received, a corresponding record is added to the first result summary table. Each time a running result of a second-class grayscale function is received at a grayscale application node, the running results of the grayscale function at all grayscale application nodes involved are obtained, and a corresponding record is added to the second result summary table. For example, grayscale function Y3 is a second-class grayscale function, and the execution link of grayscale function Y3 is: application node A-application node B-application node D, wherein application nodes A, B and D are all grayscale application nodes. After receiving the running result of grayscale function Y3 at application node A, the running results of grayscale function Y3 at the remaining grayscale application nodes (application nodes B and D) can be obtained, and according to the running results of grayscale function Y3 at all grayscale application nodes involved (application nodes A, B and D), a corresponding record is added to the second result summary table. Among them, the second type of grayscale function executes partial functions in each application node in its link. Therefore, the running result of a grayscale function in a grayscale application node may refer to the running result of the partial functions executed by the grayscale function in the grayscale application node.
[0055] In an embodiment of the present disclosure, operation S230 may include: determining a grayscale verification result based on the first result summary table and / or the second result summary table.
[0056] For example, after m grayscale servers have been running for a period of time, the verification result of each grayscale function can be obtained based on the statistical information in the first result summary table and / or the second result summary table.
[0057] According to the embodiments of the present disclosure, grayscale applications are divided into a first type of grayscale function involving a single grayscale application node and a second type of grayscale function involving multiple grayscale application nodes, and the first type of grayscale function and the second type of grayscale function are separately summarized, counted and analyzed for verification, which can make the summary result clearer and more convenient for automatic statistics and analysis.
[0058] Figure 3 A schematic diagram of a verification platform according to an embodiment of the present disclosure is schematically shown.
[0059] like Figure 3As shown, the verification platform 310 may include a first verification module 311 and a second verification module 312. The first verification module 311 may receive the grayscale function operation results sent by each application node, and update the first result summary table according to the first type of grayscale function. The first verification module 311 may also send the operation results of the second type of grayscale function to the second verification module 312, and the second verification module 312 may update the second result summary table according to the second type of grayscale function.
[0060] According to an embodiment of the present disclosure, the first type of grayscale function includes a first grayscale function. Adding an operation result record about the first type of grayscale function in the first result summary table includes: adding at least identification information of the first grayscale function and the operation result of the first grayscale function as the operation result record of the first grayscale function to the first result summary table.
[0061] For example, the first result summary table may include information such as event number, function name, identification code, and operation result. The event number may correspond to a user request, and the application system may generate an event number for each user request received. The record of the first grayscale function Y1 in the first result summary table is shown in Table 1.
[0062] Table 1
[0063] Event Number Function Name Identification code Operation Results 20201001 Y1 trx-01 0
[0064] A running result of 0 indicates a successful run, and a running result of 1 indicates a failed run.
[0065] According to another embodiment of the present disclosure, the first type of grayscale function includes a second grayscale function, the second grayscale function includes p sub-grayscale functions, and the operating result of the second grayscale function includes the operating results of q sub-grayscale functions among the p sub-grayscale functions, p is an integer greater than or equal to 2, and q is an integer greater than or equal to 1 and less than or equal to p.
[0066] For example, the second grayscale function Y2 is an account query function, which may include a savings card account query sub-function, a credit card account query sub-function, etc., wherein each sub-function may be set with a corresponding sub-identification code, for example, the sub-identification code corresponding to the savings card account query sub-function may be inner-01, and the sub-identification code corresponding to the credit card account query sub-function may be inner-02. The operation result of the second grayscale function Y2 may include the operation result of at least one of the sub-functions. After receiving the operation result of any of the sub-functions, a corresponding record may be added to the first result summary table according to the operation result of the sub-function.
[0067] In an embodiment of the present disclosure, adding an operation result record about the first type of grayscale function to the first result summary table includes: adding at least the identification information of the second grayscale function, and the identification information and operation result of each sub-grayscale function of q sub-grayscale functions as an operation result record of the second grayscale function to the first result summary table.
[0068] For example, the second result summary table may include information such as event number, function name, identification code, sub-identification code, and operation result. The records of the first grayscale function Y1 and the second grayscale function Y2 in the first result summary table are shown in Table 2.
[0069] Table 2
[0070] Event Number Function Name Identification code Sub-ID Operation Results 20201001 Y1 trx-01 - 0 20201002 Y2 trx-02 inner-01 0 20201002 Y2 trx-02 inner-02 1 …… …… …… …… ……
[0071] According to an embodiment of the present disclosure, the grayscale verification method may further include: after the grayscale verification is performed for a predetermined period of time, determining whether each grayscale function in the first category of grayscale functions to be verified is covered in the first result summary table. If not, determining the grayscale functions in the first category of grayscale functions to be verified that are not covered by the first result summary table as target grayscale functions, and notifying the grayscale application node to increase the requested access amount of the grayscale device, or notifying the user to perform verification on the target grayscale function.
[0072] For example, when the grayscale release is put into production, a grayscale verification list can be established. The list can include all grayscale functions that have been newly added or modified in this period and require grayscale verification. Specifically, it can also include a first grayscale verification list and a second grayscale verification list. Among them, the first grayscale verification list can include all first-category grayscale functions that need to be grayscale verified in this period.
[0073] After the predetermined verification time, for example, half or two-thirds, has passed, the current first result summary table can be compared with the first grayscale verification list to determine whether the first result summary table covers all the first-category grayscale functions that need to be verified. If so, the operation results sent by the grayscale server can continue to be received and the records in the first result summary table can be added until the predetermined verification end time is reached; if not, the grayscale functions that are not covered can be determined based on the first result summary table and the first grayscale verification list, and corresponding measures can be taken to ensure that these grayscale functions can be covered in subsequent verification processes.
[0074] For example, the corresponding grayscale function node can be notified to increase the access volume of grayscale server requests. For example, if the uncovered grayscale function Y4 is located in application node A, application node A can be notified to increase the access volume of grayscale server requests, so that the routing device forwards more user requests to the grayscale server. For example, the initial access volume of grayscale server requests in application node A can be 200 / s, and the increased access volume can be 500 / s, which increases the probability of grayscale function Y4 being forwarded to the grayscale server. In addition, the uncovered grayscale functions can be notified to the technicians through the terminal device, and the technicians are reminded to manually verify these uncovered grayscale functions. For example, the technicians can submit user requests for grayscale function Y4 to application node A. After the grayscale server of application node A executes grayscale function Y4, the running results of grayscale function Y4 can be sent to the verification platform and added to the first result summary table.
[0075] According to the embodiments of the present disclosure, for grayscale functions that are rarely used by users, such as pension financial management and other business functions, the number of user requests for these grayscale functions is relatively small. However, the grayscale verification cycle is usually relatively short, such as one or several days. These less used functions may not be verified in a short period of time. Therefore, the embodiments of the present disclosure find out the uncovered grayscale functions during the verification process and notify the corresponding application nodes to increase the number of grayscale server request access or arrange corresponding personnel for verification, which can improve the function coverage rate during the verification process and ensure that these less used grayscale functions can also be verified.
[0076] According to an embodiment of the present disclosure, based on the first result summary table, determining the grayscale verification result includes: (1) determining the operation success rate of each grayscale function in the first result summary table; (2) if the operation success rate of the grayscale function is greater than or equal to a preset success rate threshold, the grayscale function verification is considered to have passed; (3) if the operation success rate of the grayscale function is less than the preset success rate threshold, the grayscale function verification is considered to have failed, and the grayscale application node is notified to switch the request corresponding to the grayscale function from the grayscale device back to the non-grayscale device.
[0077] In the embodiments of the present disclosure, since the fault tolerance rates of different grayscale functions are different, different grayscale functions may have different success rate thresholds. For grayscale functions with higher fault tolerance, a lower success rate threshold may be set. For example, a success rate of 60% may be considered as verification passed. For grayscale functions with lower fault tolerance, a higher threshold may be set. For example, a success rate of more than 95% or even 100% may be considered as verification passed.
[0078] For example, the success rate threshold corresponding to the first grayscale function Y1 is 90%. The first result summary table contains 100 records about the first grayscale function Y1, of which 85 records have successful operation results. The operation success rate of the first grayscale function Y1 can be 85%, which is less than the success rate threshold of 90%. Therefore, it can be considered that the verification of the first grayscale function Y1 has failed.
[0079] In an embodiment of the present disclosure, the success rate of each grayscale function in the table can be calculated once every predetermined time period. When it is found that some of the grayscale functions have failed verification, these grayscale functions can be promptly switched back to the non-grayscale server for execution. For example, the corresponding application nodes can be notified to adjust the routing strategy and forward all user requests corresponding to these grayscale functions that have failed verification to the non-grayscale server to ensure that these functions can operate normally.
[0080] In an embodiment of the present disclosure, after reaching a predetermined verification end time, the grayscale function that has passed the verification can be regularized. The regularization of grayscale functions can be performed in the application node dimension. For example, if all grayscale functions in an application node are verified, the grayscale content of the grayscale server of the application can be transferred to a non-grayscale server. For example, there are 10 grayscale functions in application node A. If these 10 grayscale functions are verified, the grayscale content of the grayscale server in the application node can be transferred to a non-grayscale server. Alternatively, in the case where application node A has multiple grayscale server groups, the regularization of grayscale functions can be performed in the dimension of server groups. For example, application node A has multiple grayscale server groups, each grayscale server group performs different grayscale functions. If the grayscale functions of one of the server groups are verified, the grayscale functions of the grayscale server of the server group can be transferred to a normal server.
[0081] According to the embodiments of the present disclosure, the application system can be guided in a timely manner to implement operations such as grayscale conversion and traffic switching back, thereby improving the automation of the grayscale release process and the intelligence of system operation and maintenance.
[0082] According to an embodiment of the present disclosure, the second type of grayscale function includes a third grayscale function.
[0083] Adding records about the second type of grayscale functions in the second result summary table includes: adding at least the identification information of the third grayscale function, the grayscale application nodes that run successfully among the n grayscale application nodes involved in the third grayscale function, and the grayscale application nodes that fail to run as operation result records of the third grayscale function to the second result summary table.
[0084] Figure 4 The execution link diagram of the third grayscale function according to an embodiment of the present disclosure is schematically shown.
[0085] like Figure 4 As shown, the execution link of the third grayscale function Y3 is, for example: application node A-application node B-application node D-application node E. The part of the third grayscale function Y3 that needs to be modified at present is the part of the function executed in application nodes B, D and E. Therefore, the execution process of the third grayscale function Y3 is as follows: the part of the function of the third grayscale function Y3 in application node A is executed by the normal server (non-grayscale server) in application node A; then, application node A sends a request to application node B, and the part of the function in application node B is executed by the grayscale server; then, application node B sends a request to application node D, and the part of the function in application node D is executed by the grayscale server; finally, application node D sends a request to application node E, and the part of the function in application node E is executed by the grayscale server. The grayscale servers of application nodes B, D and E can send their respective running results of the third grayscale function Y3 to the verification platform, and the verification platform adds a record of the third grayscale function Y3 in the second result summary table according to the running results.
[0086] In an embodiment of the present disclosure, the second result summary table may include, for example, information such as event number, function name, identification code, link-related applications, grayscale applications, successful applications, and failed applications. If the user submits two requests for the third grayscale function Y3, the two records of the third grayscale function Y3 in the two requests in the second result summary table are shown in Table 3.
[0087] Table 3
[0088]
[0089] Figure 5 The execution link diagram of another grayscale function according to an embodiment of the present disclosure is schematically shown.
[0090] like Figure 5As shown, the execution link of the fourth grayscale function Y4 is, for example, application node A-application node C-application node D-application node E. The part of the third grayscale function Y3 that needs to be modified at the moment is the partial function executed in application nodes A, C and E. Therefore, the execution process of the fourth grayscale function Y4 is as follows: the partial function of the fourth grayscale function Y4 in application node A is executed by the grayscale server in application node A; then, application node A sends a request to application node C, and the partial function in application node C is executed by the grayscale server; then, application node C sends a request to application node D, and the partial function in application node D is executed by a normal server (non-grayscale server); finally, application node D sends a request to application node E, and the partial function in application node E is executed by the grayscale server. The grayscale servers of application nodes A, C and E can send their respective running results of the fourth grayscale function Y4 to the verification platform, and the verification platform adds a record of the fourth grayscale function Y4 in the second result summary table according to the running results. The record of the fourth grayscale function Y4 in the second result summary table is shown in Table 4.
[0091] Table 4
[0092]
[0093] According to an embodiment of the present disclosure, based on the second result summary table, determining the grayscale verification result includes: (1) determining the operation success rate of n grayscale application nodes involved in each grayscale function in the second result summary table; (2) if the operation success rate of the grayscale function in the n grayscale application nodes involved is greater than or equal to a preset success rate threshold, then it is considered that the grayscale function has been verified in the n grayscale application nodes; (3) if the operation success rate of the grayscale function in the first part of the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, and the operation success rate of the grayscale function in the second part of the grayscale application nodes is less than the preset success rate threshold, then it is considered that the grayscale function has been verified in the first part of the grayscale application nodes, and has failed to be verified in the second part of the grayscale application nodes.
[0094] In actual business scenarios, some functions have tolerable failure rates. For example, payment functions often fail due to users stopping payment midway or entering payment passwords incorrectly. Since the fault tolerance rates of different grayscale functions are different, different grayscale functions can have different success rate thresholds. For grayscale functions with higher fault tolerance, a lower success rate threshold can be set. For example, a success rate of 60% can be considered to be verified. For grayscale functions with lower fault tolerance, a higher threshold can be set. For example, a success rate of more than 95% or even 100% is considered to be verified. In addition, the success rate thresholds of the same grayscale function in different application nodes can also be different.
[0095] For example, the success rate threshold corresponding to the third grayscale function Y3 is 90%, and the success rate threshold of the third grayscale function Y3 in each application node involved is, for example, 90%. The grayscale application nodes involved in the third grayscale function Y3 are, for example, B, D, and E. The second result summary table contains 100 records about the third grayscale function Y3, among which, in 92 records, the application node B runs successfully, and the running success rate of the third grayscale function Y3 in the application node B is 92%; in 95 records, the application node D runs successfully, and the running success rate of the third grayscale function Y3 in the application node D is 95%; in 96 records, the application node E runs successfully, and the running success rate of the third grayscale function Y3 in the application node E is 96%. Therefore, the running success rates of the application nodes B, D, and E are all greater than the success rate threshold of 90%, and the third grayscale function Y3 is verified in the three grayscale application nodes B, D, and E.
[0096] For another example, the success rate threshold of the fourth grayscale function Y4 in each application node involved is, for example, 90%. The grayscale application nodes involved in the fourth grayscale function Y4 are, for example, A, C, and E. The second result summary table contains 100 records about the fourth grayscale function Y4, of which, in 91 records, the application node A runs successfully, and the running success rate of the fourth grayscale function Y4 in the application node A is 91%; in 85 records, the application node C runs successfully, and the running success rate of the fourth grayscale function Y4 in the application node C is 85%; in 93 records, the application node E runs successfully, and the running success rate of the fourth grayscale function Y4 in the application node E is 93%. Therefore, the running success rates of application nodes A and E are both greater than the success rate threshold of 90%, and the running success rate of application node C is less than the success rate threshold of 90%. The fourth grayscale function Y4 is verified in application nodes A and E, but fails in application node C.
[0097] In the embodiments of the present disclosure, the success rate of each grayscale function in the application node involved in the second result summary table can be calculated every predetermined time. When it is found that the verification of a grayscale function in a certain application node fails, the corresponding grayscale function in the application node is promptly switched back to the non-grayscale server for execution to ensure that these functions can operate normally. In addition, for each application node involved in a grayscale function, if one of the application nodes has an associated impact on the next application node, when the previous application node transfers the function to the normal server for execution, the next application node also needs to transfer the function to the normal server for execution.
[0098] In an embodiment of the present disclosure, after reaching a predetermined verification end time, the grayscale functions that have passed the verification can be regularized. The regularization of grayscale functions can be performed in the application node dimension. For example, if all grayscale functions in an application node are verified, the grayscale content of the grayscale server of the application can be transferred to a non-grayscale server. For example, application node A involves 10 grayscale functions. If these 10 grayscale functions are verified, the grayscale functions of the grayscale server in the application node can be transferred to a non-grayscale server. Alternatively, in the case where application node A has multiple grayscale server groups, the regularization of grayscale functions can be performed in the dimension of server groups. For example, application node A has multiple grayscale server groups, each grayscale server group involves different grayscale functions. If the grayscale functions of one of the server groups are verified, the grayscale functions of the grayscale server of the server group can be transferred to a normal server.
[0099] According to the embodiments of the present disclosure, the application system can be guided in a timely manner to implement operations such as grayscale conversion and traffic switching back, thereby improving the automation of the grayscale release process and the intelligence of system operation and maintenance.
[0100] Another aspect of the embodiments of the present disclosure provides a grayscale verification device.
[0101] Figure 6 A flowchart of a grayscale verification device according to an embodiment of the present disclosure is schematically shown.
[0102] like Figure 6 As shown, the grayscale verification device 600 may include a receiving module 610 , a recording module 620 and a verification module 630 .
[0103] The receiving module 610 is used to receive the operating results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2.
[0104] The recording module 620 is used to add a record of the operation result of each grayscale function to a preset result summary table according to the operation result of the grayscale function.
[0105] The verification module 630 is used to determine the grayscale verification result based on the added result summary table.
[0106] According to an embodiment of the present disclosure, the receiving module 610 may, for example, execute the above reference Figure 2 In operation S210 described above, the recording module 620 may, for example, execute Figure 2 In operation S220 described above, the verification module 630 may, for example, execute the above reference Figure 2 The operation S230 described above will not be described in detail here.
[0107] According to an embodiment of the present disclosure, the recording module 620 may include a first recording module and / or a second recording module. The first recording module is used to, for a first type of grayscale function involving a single grayscale application node, add a record of the operation result of the first type of grayscale function in the first result summary table according to the operation result of the first type of grayscale function. The first recording module is used to, for a second type of grayscale function involving n grayscale application nodes in a function execution link, obtain the operation results of the second type of grayscale function in the n grayscale application nodes involved, and add a record of the operation result of the second type of grayscale function in the second result summary table according to the operation results in the n grayscale application nodes, where n is an integer greater than or equal to 2.
[0108] The verification module 630 is used to determine the grayscale verification result based on the added first result summary table and / or the added second result summary table.
[0109] According to an embodiment of the present disclosure, the first category of grayscale functions includes a first grayscale function; adding an operation result record about the first category of grayscale functions to the first result summary table includes: adding at least the identification information of the first grayscale function and the operation result of the first grayscale function as an operation result record of the first grayscale function to the first result summary table.
[0110] According to an embodiment of the present disclosure, the first type of grayscale function includes a second grayscale function, the second grayscale function includes p sub-grayscale functions, and the operating result of the second grayscale function includes the operating results of q sub-grayscale functions among the p sub-grayscale functions, p is an integer greater than or equal to 2, and q is an integer greater than or equal to 1 and less than or equal to p.
[0111] Adding the operation result record of the first type of grayscale function in the first result summary table includes: adding at least the identification information of the second grayscale function, and the identification information and operation result of each sub-grayscale function in the q sub-grayscale functions as an operation result record of the second grayscale function to the first result summary table.
[0112] According to an embodiment of the present disclosure, the grayscale verification device may further include a comparison module, which is used to determine whether each grayscale function in the first category of grayscale functions to be verified is covered in the first result summary table after the grayscale verification is performed for a predetermined period of time. If not, the grayscale functions in the first category of grayscale functions to be verified that are not covered by the first result summary table are determined as target grayscale functions, and the grayscale application node is notified to increase the requested access amount of the grayscale device, or the user is notified to perform verification on the target grayscale function.
[0113] According to an embodiment of the present disclosure, based on the first result summary table, determining the grayscale verification result includes: determining the operation success rate of each grayscale function in the first result summary table; if the operation success rate of the grayscale function is greater than or equal to a preset success rate threshold, the grayscale function verification is considered to have passed; if the operation success rate of the grayscale function is less than the preset success rate threshold, the grayscale function verification is considered to have failed, and the grayscale application node is notified to switch the request corresponding to the grayscale function from the grayscale device back to the non-grayscale device.
[0114] According to an embodiment of the present disclosure, the second category of grayscale functions includes a third grayscale function; adding records about the second category of grayscale functions in the second result summary table includes: adding at least the identification information of the third grayscale function, the grayscale application nodes that have successfully run among the n grayscale application nodes involved in the third grayscale function, and the grayscale application nodes that have failed to run as operation result records of the third grayscale function to the second result summary table.
[0115] According to an embodiment of the present disclosure, based on the second result summary table, determining the grayscale verification result includes: determining the operation success rate of n grayscale application nodes involved in each grayscale function in the second result summary table; if the operation success rate of the grayscale function in the n grayscale application nodes involved is greater than or equal to a preset success rate threshold, then it is considered that the grayscale function has been verified in the n grayscale application nodes; if the operation success rate of the grayscale function in the first part of the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, and the operation success rate of the grayscale function in the second part of the grayscale application nodes is less than the preset success rate threshold, then it is considered that the grayscale function has been verified in the first part of the grayscale application nodes, and has failed the verification in the second part of the grayscale application nodes.
[0116] According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits, or at least part of the functions of any one of them can be implemented in one module. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be split into multiple modules for implementation. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be at least partially implemented as hardware circuits, such as field programmable gate arrays (FPGAs), programmable logic arrays (PLAs), systems on chips, systems on substrates, systems on packages, application specific integrated circuits (ASICs), or can be implemented by hardware or firmware in any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, according to the embodiments of the present invention, one or more of the modules, submodules, units, and subunits can be at least partially implemented as computer program modules, and when the computer program modules are run, the corresponding functions can be performed.
[0117] For example, any multiple of the receiving module 610, the recording module 620 and the verification module 630, the first recording module, the second recording module and the comparison module can be combined in one module / unit / sub-unit for implementation, or any one of the modules / units / sub-units can be split into multiple modules / units / sub-units. Alternatively, at least part of the functions of one or more modules / units / sub-units in these modules / units / sub-units can be combined with at least part of the functions of other modules / units / sub-units and implemented in one module / unit / sub-unit. According to an embodiment of the present disclosure, at least one of the receiving module 610, the recording module 620 and the verification module 630, the first recording module, the second recording module and the comparison module can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or by any one of the three implementation methods of software, hardware and firmware or by a suitable combination of any of them. Alternatively, at least one of the receiving module 610, the recording module 620, the verification module 630, the first recording module, the second recording module and the comparison module can be at least partially implemented as a computer program module, and when the computer program module is executed, the corresponding function can be executed.
[0118] It should be noted that the grayscale verification device part in the embodiment of the present disclosure corresponds to the grayscale verification method part in the embodiment of the present disclosure. The description of the grayscale verification device part specifically refers to the grayscale verification method part, which will not be repeated here.
[0119] Another aspect of the disclosed embodiment provides a grayscale verification system, including a grayscale verification device and m grayscale application nodes, each of which may include a routing device, a grayscale server, and a non-grayscale server. Among them, there are m grayscale application nodes, and m is an integer greater than or equal to 2.
[0120] The grayscale verification device is used to perform the above operations: receiving the operating results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2; according to the operating result of each grayscale function, adding a record of the operating result of the grayscale function to a preset result summary table; and determining the grayscale verification result based on the added result summary table.
[0121] Specifically, the operations performed by the grayscale verification device can be seen in Figures 1 to 5 , and the above description of the corresponding content will not be repeated here.
[0122] Figure 7A block diagram of an electronic device suitable for implementing the method described above according to an embodiment of the present disclosure is schematically shown. Figure 7 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.
[0123] like Figure 7 As shown, the electronic device 700 according to an embodiment of the present disclosure includes a processor 701, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 702 or a program loaded from a storage part 708 to a random access memory (RAM) 703. The processor 701 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 701 may also include an onboard memory for caching purposes. The processor 701 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present disclosure.
[0124] In RAM 703, various programs and data required for the operation of electronic device 700 are stored. Processor 701, ROM 702 and RAM 703 are connected to each other via bus 704. Processor 701 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 702 and / or RAM 703. It should be noted that the program can also be stored in one or more memories other than ROM 702 and RAM 703. Processor 701 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.
[0125] According to an embodiment of the present disclosure, the electronic device 700 may further include an input / output (I / O) interface 705, which is also connected to the bus 704. The electronic device 700 may further include one or more of the following components connected to the I / O interface 705: an input portion 706 including a keyboard, a mouse, etc.; an output portion 707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 708 including a hard disk, etc.; and a communication portion 709 including a network interface card such as a LAN card, a modem, etc. The communication portion 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 705 as needed. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 710 as needed, so that a computer program read therefrom is installed into the storage portion 708 as needed.
[0126] An embodiment of the present disclosure also includes a computer program product, which includes a computer program, and the computer program contains a program code for executing the method provided by the embodiment of the present disclosure. When the computer program product runs on an electronic device, the program code is used to enable the electronic device to implement the grayscale verification method provided by the embodiment of the present disclosure.
[0127] When the computer program is executed by the processor 701, the above functions defined in the system / device of the embodiment of the present disclosure are executed. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.
[0128] In one embodiment, the computer program may rely on tangible storage media such as optical storage devices, magnetic storage devices, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of signals on a network medium, and downloaded and installed through the communication part 709, and / or installed from the removable medium 711. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.
[0129] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).
[0130] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.
[0131] According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. For example, it may include, but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, apparatus, or device.
[0132] For example, according to an embodiment of the present disclosure, the computer-readable storage medium may include the ROM 702 and / or the RAM 703 described above and / or one or more memories other than the ROM 702 and the RAM 703 .
[0133] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0134] It will be appreciated by those skilled in the art that the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations and / or combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways without departing from the spirit and teachings of the present disclosure. All of these combinations and / or combinations fall within the scope of the present disclosure.
[0135] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.
Claims
1. A grayscale verification method, comprising: Receive the running results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2; According to the operation result of each grayscale function, add a record of the operation result of the grayscale function to the preset result summary table; Wherein, adding a record of the operation result of each grayscale function to a preset result summary table according to the operation result of the grayscale function includes at least one of the following operations: For a first type of grayscale function involving a single grayscale application node, according to the operation result of the first type of grayscale function, a record of the operation result of the first type of grayscale function is added to the first result summary table; For a second type of grayscale function involving n grayscale application nodes in a function execution link, obtaining operation results of the second type of grayscale function in the n grayscale application nodes involved, and adding operation result records of the second type of grayscale function in a second result summary table according to the operation results in the n grayscale application nodes, where n is an integer greater than or equal to 2; and Based on the added result summary table, determine the grayscale verification result; Wherein, determining the grayscale verification result based on the added result summary table includes: determining the grayscale verification result based on the added first result summary table and / or the added second result summary table; Wherein, based on the first result summary table, determining the grayscale verification result includes: Determine the operation success rate of each grayscale function in the first result summary table; If the grayscale function operation success rate is greater than or equal to the preset success rate threshold, it is considered that the grayscale function verification has passed; If the grayscale function operation success rate is less than the preset success rate threshold, the grayscale function verification is considered to have failed, and the grayscale application node is notified to switch the request corresponding to the grayscale function from the grayscale device back to the non-grayscale device; Wherein, based on the second result summary table, determining the grayscale verification result includes: Determine the operation success rate of n grayscale application nodes involved in each grayscale function in the second result summary table; If the running success rate of the grayscale function in the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, it is considered that the grayscale function has been verified in the n grayscale application nodes; If the running success rate of the grayscale function in the first part of the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, and the running success rate in the second part of the grayscale application nodes is less than the preset success rate threshold, it is considered that the grayscale function has passed the verification in the first part of the grayscale application nodes, and has failed the verification in the second part of the grayscale application nodes; Wherein, the method further comprises: After the grayscale verification is performed for a predetermined period of time, determining whether each grayscale function in the first type of grayscale functions to be verified is covered in the first result summary table; If not, determine the grayscale function that is not covered by the first result summary table in the first type of grayscale functions to be verified as the target grayscale function, and notify the grayscale application node to increase the requested access amount of the grayscale device, or notify the user to verify the target grayscale function; Wherein, the method further comprises: When all grayscale functions of the grayscale application node are verified, the grayscale functions of the grayscale application node are transferred to the non-grayscale device.
2. The method according to claim 1, wherein: The first type of grayscale functions includes a first grayscale function; The adding of the operation result record of the first type of grayscale function in the first result summary table includes: adding at least the identification information of the first grayscale function and the operation result of the first grayscale function as the operation result record of the first grayscale function to the first result summary table.
3. The method according to claim 2, wherein: The first type of grayscale function includes a second grayscale function, the second grayscale function includes p sub-grayscale functions, and the operation result of the second grayscale function includes the operation results of q sub-grayscale functions among the p sub-grayscale functions, where p is an integer greater than or equal to 2, and q is an integer greater than or equal to 1 and less than or equal to p; The adding of the operation result record of the first type of grayscale function in the first result summary table includes: adding at least the identification information of the second grayscale function, and the identification information and operation result of each sub-grayscale function of the q sub-grayscale functions as an operation result record of the second grayscale function to the first result summary table.
4. The method according to claim 1, wherein: The second type of grayscale functions includes a third grayscale function; The adding of records about the second type of grayscale functions in the second result summary table includes: adding at least the identification information of the third grayscale function, the grayscale application nodes that have run successfully and the grayscale application nodes that have failed to run among the n grayscale application nodes involved in the third grayscale function as operation result records of the third grayscale function to the second result summary table.
5. A grayscale verification device, comprising: A receiving module, used for receiving the operation results of k grayscale functions from m grayscale application nodes, where m and k are both integers greater than or equal to 2; A recording module, used for adding a record of the operation result of each grayscale function to a preset result summary table according to the operation result of the grayscale function; Wherein, adding a record of the operation result of each grayscale function to a preset result summary table according to the operation result of the grayscale function includes at least one of the following operations: For a first type of grayscale function involving a single grayscale application node, according to the operation result of the first type of grayscale function, a record of the operation result of the first type of grayscale function is added to the first result summary table; For a second type of grayscale function involving n grayscale application nodes in a function execution link, obtaining operation results of the second type of grayscale function in the n grayscale application nodes involved, and adding operation result records of the second type of grayscale function in a second result summary table according to the operation results in the n grayscale application nodes, where n is an integer greater than or equal to 2; and A verification module, used to determine the grayscale verification result based on the added result summary table; Wherein, determining the grayscale verification result based on the added result summary table includes: determining the grayscale verification result based on the added first result summary table and / or the added second result summary table; Wherein, based on the first result summary table, determining the grayscale verification result includes: Determine the operation success rate of each grayscale function in the first result summary table; If the grayscale function operation success rate is greater than or equal to the preset success rate threshold, it is considered that the grayscale function verification has passed; If the grayscale function operation success rate is less than the preset success rate threshold, the grayscale function verification is considered to have failed, and the grayscale application node is notified to switch the request corresponding to the grayscale function from the grayscale device back to the non-grayscale device; Wherein, based on the second result summary table, determining the grayscale verification result includes: Determine the operation success rate of n grayscale application nodes involved in each grayscale function in the second result summary table; If the running success rate of the grayscale function in the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, it is considered that the grayscale function has been verified in the n grayscale application nodes; If the running success rate of the grayscale function in the first part of the n grayscale application nodes involved is greater than or equal to the preset success rate threshold, and the running success rate in the second part of the grayscale application nodes is less than the preset success rate threshold, it is considered that the grayscale function has passed the verification in the first part of the grayscale application nodes, and has failed the verification in the second part of the grayscale application nodes; Wherein, the device further comprises: After the grayscale verification is performed for a predetermined period of time, determining whether each grayscale function in the first type of grayscale functions to be verified is covered in the first result summary table; If not, determine the grayscale function that is not covered by the first result summary table in the first type of grayscale functions to be verified as the target grayscale function, and notify the grayscale application node to increase the requested access amount of the grayscale device, or notify the user to verify the target grayscale function; Wherein, the device further comprises: When all grayscale functions of the grayscale application node are verified, the grayscale functions of the grayscale application node are transferred to the non-grayscale device.
6. A grayscale verification system, comprising: m grayscale application nodes, where m is an integer greater than or equal to 2; as well as A grayscale verification device, used to execute the method as claimed in any one of claims 1 to 4.
7. An electronic device comprising: one or more processors; a memory for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 4.
8. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, enables the processor to implement the method according to any one of claims 1 to 4.
