Data processing method, device and equipment and computer storage medium

By determining the number of concurrency based on preset expectation time and test data time, and allocating the test data into the container according to the time-consuming size, the problem of inconsistent server testing time in software testing is solved, and the efficiency of concurrent testing is improved.

CN118964171APending Publication Date: 2024-11-15CHINA MOBILE COMM CORP GUANGXI CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410924156.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-10
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

In software testing, due to the randomness of the test data obtained by the concurrent test, the time required for different servers to complete the test is different, resulting in low efficiency of concurrent tests.

Method used

By obtaining preset expectation time-consuming and multiple test data, determine the concurrency quantity based on the preset expectation time-consuming and the time-consuming test data, and create a concurrent number of containers, and enter multiple test data into containers according to the time-consuming test data. , minimize the difference in the total time-consuming test data between target containers, so that the duration of the servers corresponding to different target containers complete the test task is close.

Benefits of technology

The efficiency of concurrent testing is improved, so that the servers corresponding to different target containers can complete the test tasks close to each other, and the efficiency of concurrent testing of the server is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118964171A_ABST
    Figure CN118964171A_ABST
Patent Text Reader

Abstract

The invention discloses a data processing method and device, equipment and a computer storage medium. Obtaining preset expected time consumption and a plurality of pieces of test data, determining a concurrency number according to the preset expected time consumption and test data time consumption of the plurality of pieces of test data, and creating a container of the concurrency number. According to the time consumption of the test data, the multiple pieces of test data are input into the container in sequence, target containers are obtained, the difference value of the sum of the time consumption of the test data between the target containers is minimum, and concurrent testing is conducted on the multiple pieces of test data based on the target containers. According to the method, the multiple pieces of test data are input into the container according to the time consumption of the test data, so that the difference value of the sum of the time consumption of the test data between the target containers is minimum, the duration of completing the test task by the servers corresponding to the different target containers is close, and the concurrent test efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computers, and in particular to a method, device, equipment, computer storage medium and computer program product for data processing. Background Art

[0002] Software testing is an important stage of software development, which is used to timely discover various potential faults and defects in the software and improve the stability of the software. Due to the large amount of relevant test data involved in software testing, multiple servers are usually used in related technologies to perform concurrent testing on the software.

[0003] However, in the related art, multiple servers are used to perform concurrent testing on the software. Due to the randomness of concurrent testing in obtaining relevant test data, different servers need different times to complete the test, resulting in low efficiency of concurrent testing of the servers. Summary of the invention

[0004] The embodiments of the present disclosure provide a data processing method, apparatus, device, computer storage medium, and computer program product, which can improve the efficiency of concurrent testing.

[0005] In a first aspect, an embodiment of the present disclosure provides a method for data processing, the method comprising:

[0006] Get the preset expected time and multiple test data. The test data includes the test data time. The test data is inseparable.

[0007] Determine the number of concurrent connections based on the preset expected duration and the test data duration of multiple test data, and create containers for the number of concurrent connections;

[0008] According to the time consumption of the test data, multiple test data are sequentially input into the container to obtain a target container, wherein the total difference of the time consumption of the test data between the target containers is the smallest;

[0009] Concurrent testing of multiple test data based on target container.

[0010] In an achievable implementation, before obtaining the preset expected time and multiple test data, the method further includes:

[0011] Acquire a first table including a plurality of scene data;

[0012] Based on the first table, a plurality of scene data are read and converted to obtain a plurality of test data.

[0013] In an achievable implementation, determining the number of concurrent operations according to a preset expected time consumption and a test data time consumption of a plurality of test data includes:

[0014] Sum the test data time consumption of multiple test data to obtain the target test data time consumption;

[0015] Divide the target test data time by the preset expected time to get the number of concurrent connections.

[0016] In an achievable implementation, multiple test data are sequentially input into a container according to the time consumption of the test data to obtain a target container, including:

[0017] Arrange multiple test data in descending order according to the time consumed by the test data to obtain a descending queue;

[0018] When the container is empty, filter out the concurrent test data from the descending queue and input it into the container to obtain the first container;

[0019] Obtain the first candidate test data from the descending queue according to the time consumption of the test data;

[0020] respectively summing the test data consumption of the first candidate test data and the test data consumption of the test data included in the first container to obtain a plurality of first test data time consumption sums;

[0021] Input the first candidate test data into the container with the smallest total time consumption of the first test data to obtain a second container;

[0022] When the descending queue is empty, the second container is determined as the target container.

[0023] In an achievable implementation, after inputting the first candidate test data into the container with the smallest total time consumption of the first test data to obtain the second container, the method further includes:

[0024] Create storage space;

[0025] The test data included in the second container is saved to the storage space in a time-consuming manner.

[0026] In an achievable implementation, after inputting the first candidate test data into the container with the smallest total time consumption of the first test data to obtain the second container, the method further includes:

[0027] When the descending queue is not empty, obtain the second candidate test data from the descending queue according to the time consumption of the test data;

[0028] Accessing the storage space to obtain the test data of the second container takes time;

[0029] respectively summing the test data consumption of the second candidate test data and the test data consumption of the test data included in the second container to obtain a plurality of second test data time consumption sums;

[0030] Input the second candidate test data into the container with the smallest total time consumption of the second test data to obtain a third container;

[0031] When the descending queue is empty, the third container is determined as the target container.

[0032] In an achievable implementation, after the target container is obtained by sequentially inputting multiple test data into a container having the smallest total test data time consumption according to the time consumption of the test data, the method further includes:

[0033] Free up storage space;

[0034] The test data respectively saved in the target containers are input into a second form, and the second form is used for visual editing.

[0035] In a second aspect, an embodiment of the present disclosure provides a data processing device, the device comprising:

[0036] An acquisition module is used to acquire a preset expected time and multiple test data, where the test data includes the test data time, and the test data is indivisible data;

[0037] A determination module is used to determine the number of concurrent connections according to a preset expected time consumption and the test data time consumption of multiple test data, and to create containers for the number of concurrent connections;

[0038] An input module is used to input multiple test data into containers in sequence according to the time consumption of the test data to obtain a target container, wherein the difference in the total time consumption of the test data between the target containers is the smallest;

[0039] A test module for concurrent testing of multiple test data based on the target container.

[0040] In a third aspect, an embodiment of the present disclosure provides a data processing device, the device comprising a processor and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement a data processing method as described in any one of the first aspects.

[0041] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer program instructions, and when the computer program instructions are executed by a processor, a method for data processing as described in any one of the first aspects is implemented.

[0042] In a fifth aspect, an embodiment of the present disclosure provides a computer program product, including a computer program, which implements the data processing method as described in any one of the first aspects when the computer program is executed by a processor.

[0043] The disclosed embodiments provide a method, apparatus, device, computer storage medium and computer program product for data processing, which obtains a preset expected time and multiple test data, determines the number of concurrency based on the preset expected time and the test data time of multiple test data, and creates a container for the number of concurrency. According to the size of the test data time consumption, multiple test data are sequentially input into the container to obtain a target container, wherein the total difference in the test data time consumption between the target containers is minimized, and multiple test data are concurrently tested based on the target container. The disclosed embodiments input multiple test data into the container according to the size of the test data time consumption, so that the total difference in the test data time consumption between the target containers is minimized, thereby making the time for servers corresponding to different target containers to complete the test task close, thereby improving the efficiency of concurrent testing. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solution of the embodiment of the present invention, the following is a brief introduction to the drawings required for use in the embodiment of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0045] Figure 1 is a flowchart of a data processing method provided by an embodiment of the present disclosure;

[0046] Figure 2 is a flowchart of a method for obtaining test data provided by an embodiment of the present disclosure;

[0047] Figure 3 It is a flowchart of a method for determining the number of concurrent operations provided by an embodiment of the present disclosure;

[0048] Figure 4 is a flowchart of another data processing method provided by an embodiment of the present disclosure;

[0049] Figure 5 is a structural diagram of a data processing device provided by an embodiment of the present disclosure;

[0050] Figure 6 It is a structural diagram of a data processing device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0051] The features and exemplary embodiments of various aspects of the present invention will be described in detail below. In order to make the purpose, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain the present invention, rather than to limit the present invention. For those skilled in the art, the present invention can be implemented without the need for some of these specific details. The following description of the embodiments is only to provide a better understanding of the present invention by illustrating examples of the present invention.

[0052] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "include..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0053] Before describing the technical solutions provided by the embodiments of the present disclosure, in order to facilitate understanding of the embodiments of the present disclosure, the present disclosure specifically describes the problems existing in the related technologies:

[0054] Software testing is an important stage of software development, which is used to timely discover various potential faults and defects in the software and improve the stability of the software. Due to the large amount of relevant test data involved in software testing, multiple servers are usually used in related technologies to perform concurrent testing on the software.

[0055] However, in the related art, multiple servers are used to perform concurrent testing on the software. Due to the randomness of concurrent testing in obtaining relevant test data, different servers need different times to complete the test, resulting in low efficiency of concurrent testing of the servers.

[0056] The embodiments of the present disclosure provide a data processing method, apparatus, device, computer storage medium, and computer program product, which can solve the above-mentioned technical problems existing in the related technologies.

[0057] The disclosed embodiment obtains a preset expected time and multiple test data, determines the number of concurrent operations according to the preset expected time and the test data time of the multiple test data, and creates a container of the concurrent number. According to the size of the test data time consumption, multiple test data are input into the container so that the difference in the total test data time consumption between the target containers is minimized, so that the time for the servers corresponding to different target containers to complete the test tasks is close, thereby improving the efficiency of concurrent testing.

[0058] The following is an introduction to the data processing method provided by the embodiments of the present disclosure.

[0059] Figure 1 FIG. 1 is a flow chart showing a method for data processing provided by an embodiment of the present disclosure. Figure 1 The method may include the following steps S110-S140.

[0060] S110: Obtaining a preset expected time and multiple test data.

[0061] The terminal obtains a preset expected time and multiple test data. The preset expected time is the expected time required to complete the test task. The test data is the test scenario case data required for the test. The test data is indivisible data.

[0062] In one embodiment, the test data may include test data duration, test data number, and test data name.

[0063] In one example, there are three servers A, B and C for concurrent testing, and the preset expected time required to complete the test task using servers A, B and C is set to 4 hours.

[0064] S120: Determine the number of concurrent operations according to the preset expected time consumption and the test data time consumption of multiple test data, and create containers of the concurrent number.

[0065] After obtaining the preset expected time and the test data time of multiple test data, the concurrency number can be determined according to the preset expected time and the test data time of multiple test data, and a container of the concurrency number can be created. The concurrency number is used to determine the number of servers required for concurrent testing, and the container represents a data structure used to store multiple test data.

[0066] In an example, the concurrency number is determined to be 5 according to the preset expected time consumption and the test data time consumption of multiple test data, that is, the number of servers required for the concurrent test is determined to be 5, and 5 containers are created at the same time.

[0067] S130: Input multiple test data into a container in sequence according to the time consumption of the test data to obtain a target container.

[0068] After creating a number of concurrent containers, multiple test data are input into the container from large to small according to the time consumption of the test data to obtain a target container. The difference in the total time consumption of the test data between the target containers is the smallest. The target container includes multiple containers.

[0069] In an example, there are four containers H, J, K and L. According to the time consumption of the test data, the four test data are input into the containers from large to small. Among them, the test data consumption of the test data stored in container H is 4.1 hours, the test data consumption of the test data stored in container J is 4.2 hours, the test data consumption of the test data stored in container K is 4.1 hours, and the test data consumption of the test data stored in container L is 4.0 hours. At this time, if the sum of the test data time consumption differences between containers H, J, K and L is the smallest, containers H, J, K and L are regarded as target containers.

[0070] S140: Perform concurrent testing on multiple test data based on the target container.

[0071] After the target container is obtained, multiple test data in the target container are distributed to corresponding servers for concurrent testing.

[0072] The disclosed embodiment obtains a preset expected time and multiple test data, determines the number of concurrent operations according to the preset expected time and the test data time of the multiple test data, and creates a container of the concurrent number. According to the size of the test data time consumption, multiple test data are input into the container so that the difference in the total test data time consumption between the target containers is minimized, so that the time for the servers corresponding to different target containers to complete the test tasks is close, thereby improving the efficiency of concurrent testing.

[0073] In one embodiment, before obtaining the preset expected time and multiple test data, such as Figure 2 As shown, the data processing method further includes step S150 and step S160.

[0074] S150: Acquire a first table including a plurality of scene data.

[0075] The terminal obtains an input first table including a plurality of scenario data, wherein the scenario data is an inseparable test scenario case.

[0076] In an example, the multiple scene data may be data such as a user resource storage scene, a user resource transfer scene, etc.

[0077] S160: Based on the first table, read and convert a plurality of scene data to obtain a plurality of test data.

[0078] After the first table is obtained, a plurality of scene data in the first table is read and converted to obtain a plurality of test data.

[0079] The disclosed embodiment obtains a first table including a plurality of scenario data, and based on the first table, reads and converts the plurality of scenario data to obtain a plurality of test data, thereby providing a method for manually visually organizing the identification between data and programs, thereby accelerating the efficiency of concurrent testing.

[0080] In one embodiment, the number of concurrent connections is determined based on the preset expected time consumption and the test data time consumption of multiple test data, such as Figure 3 As shown, it may include step S121 and step S122.

[0081] S121: Sum the test data time consumption of multiple test data to obtain the target test data time consumption.

[0082] After obtaining multiple test data, the test data time consumption corresponding to each test data is added together to obtain the target test data time consumption corresponding to all the test data.

[0083] In an example, after obtaining five test data a1, a2, a3, a4, and a5, the time consumption of the test data corresponding to a1, a2, a3, a4, and a5 are added together to obtain the sum, which is the target test data time consumption.

[0084] S122: Divide the target test data time by the preset expected time to obtain the concurrency number.

[0085] After calculating the target test data time consumption, divide the target test data time consumption by the preset expected time consumption to obtain the concurrency number.

[0086] In one example, an expression for calculating the number of concurrent connections is shown in Formula 1.

[0087]

[0088] Among them, N represents the number of concurrent connections, n represents the number of test data, i represents the current test data, and a i represents the test data time corresponding to the current test data, and T represents the preset expected time.

[0089] The disclosed embodiment obtains the target test data time consumption by summing the test data time consumption of multiple test data, and then divides the target test data time consumption by the preset expected time consumption, thereby effectively obtaining the concurrency number.

[0090] In one embodiment, according to the time consumption of the test data, multiple test data are sequentially input into the container to obtain the target container, which may include steps S131-S136.

[0091] S131: Arrange multiple test data in descending order according to the time consumed by the test data to obtain a descending queue.

[0092] After obtaining a plurality of test data, the obtained plurality of test data are arranged in descending order according to the time consumption of the test data corresponding to the test data to obtain a descending queue.

[0093] In an example, there are three test data m1, m2 and m3. The corresponding test data takes 1 hour, 2 hours and 3 hours respectively. According to the time taken by the test data, m1, m2 and m3 are arranged in descending order to obtain a descending queue R (m3, m2, m1).

[0094] S132: When the container is empty, filter out the concurrent test data from the descending queue and input the test data into the container to obtain a first container.

[0095] If the created container does not include the test data, the test data with the same concurrent quantity is selected from the descending queue in descending order, and input into the corresponding container one by one to obtain the first container, wherein the first container includes multiple containers.

[0096] S133: Obtain the first candidate test data from the descending queue according to the time consumed by the test data.

[0097] If the first container is not empty, the largest first candidate test data in the descending queue is obtained from the descending queue according to the time consumed by the test data, wherein the first candidate test data represents a test data.

[0098] S134: summing the test data consumption of the first candidate test data and the test data consumption of the test data included in the first container respectively to obtain a plurality of first test data time consumption sums.

[0099] After obtaining the first candidate test data, the test data consumption of the first candidate test data is summed with the test data consumption of the test data included in the first container to obtain a plurality of first test data time consumption sums.

[0100] In one example, the first container includes three containers, and the test data consumption of the test data included in each container is 5 hours, 6 hours, and 7 hours respectively. The test data consumption of the first candidate test data F is 0.5 hours. The test data consumption of the first candidate test data is summed with the test data consumption of the test data included in the first container, and the sum of the first test data consumption is obtained, that is, 5.5 hours, 6.5 hours, and 7.5 hours.

[0101] S135: Input the first candidate test data into the container with the smallest total time consumption of the first test data to obtain a second container.

[0102] After recalculating and obtaining the sum of the time consumption of the multiple first test data, the sum of the time consumption of the multiple first test data is compared, and the first candidate test data is input into the container with the smallest sum of the time consumption of the first test data to obtain the second container. The second container includes multiple containers.

[0103] In one example, according to the obtained sum of the time taken by the multiple first test data, namely 5.5 hours, 6.5 hours and 7.5 hours, the container corresponding to the test data taking 5.5 hours is selected as the input object container of the first candidate test data.

[0104] S136: When the descending queue is empty, determine the second container as the target container.

[0105] After the first candidate test data is input into the container with the smallest total time consumption of the first test data, if the descending queue does not contain the test data, the second container is determined as the target container.

[0106] The disclosed embodiment inputs the first candidate test data into a container according to the time consumption of the test data to obtain a target container, so as to minimize the difference in the total time consumption of the test data between the target containers, thereby making the time for the servers corresponding to different target containers to complete the test tasks close, thereby improving the efficiency of concurrent testing.

[0107] In one embodiment, after the first candidate test data is input into the container with the smallest total time consumption of the first test data to obtain the second container, the data processing method further includes steps S1351 - S1352 .

[0108] S1351: Create storage space.

[0109] Create an intermediate variable and allocate storage space of the corresponding size for the intermediate variable.

[0110] S1352: Save the test data included in the second container to the storage space.

[0111] After the test data time consumption of the test data included in the second container is calculated, the test data time consumption of the test data included in the second container is saved in the storage space corresponding to the intermediate variable.

[0112] The embodiment of the present disclosure creates a storage space to store the test data included in the second container, thereby avoiding the test data time of recalculating the test data included in the container each time, saving calculation time and improving data processing efficiency.

[0113] In one embodiment, after the first candidate test data is input into the container with the smallest total time consumption of the first test data to obtain the second container, the data processing method includes steps S1353-S1357.

[0114] S1353: When the descending queue is not empty, obtain the second candidate test data from the descending queue according to the time consumed by the test data.

[0115] If the descending queue is not empty, the second candidate test data with the largest value in the descending queue is obtained from the descending queue according to the time consumed by the test data, wherein the second candidate test data represents a test data.

[0116] S1354: It takes time to access the storage space to obtain the test data included in the second container.

[0117] Accessing the storage space corresponding to the intermediate variable to obtain the test data of each container in the second container consumes test data.

[0118] S1355: summing the test data consumption of the second candidate test data and the test data consumption of the test data included in the second container respectively to obtain a plurality of second test data time consumption sums.

[0119] After obtaining the second candidate test data, the test data consumption of the second candidate test data is summed with the test data consumption of the test data included in the second container to obtain a plurality of second test data time consumption sums.

[0120] S1356: Input the second candidate test data into the container with the smallest total time consumption of the second test data to obtain a third container.

[0121] After recalculating and obtaining the sum of the time consumption of multiple second test data, the sum of the time consumption of multiple second test data is compared, and the second candidate test data is input into the container with the smallest sum of the time consumption of the second test data to obtain a third container. The third container includes multiple containers.

[0122] S1357: When the descending queue is empty, determine the third container as the target container.

[0123] After the second candidate test data is input into the container with the smallest total time consumption of the second test data, if the descending queue does not contain the test data, the third container is determined as the target container.

[0124] In one example, the steps of data processing are as follows: Figure 4 As shown:

[0125] In step S401, the test data is passed to the terminal. In step S402, the minimum concurrency is calculated based on the passed test data and the preset expected time. A descending queue is obtained based on the test data, and step S403 is executed to loop through the descending queue. A container with the minimum concurrency is created, and step S404 is executed to determine whether the container is empty. If the container is empty, step S410 is executed to add the test data to the corresponding container. If the container is not empty, step S405 is executed to loop through the container. In step S406, the test data time is summed with the test data time in the container. In step S407, the minimum value of the total time of each container test data is taken. And, in step S409, a storage space is created to save the total time of each container test data. In step S408, it is determined whether the descending queue is empty. If the descending queue is not empty, step S410 is executed to add the test data to the corresponding container and loop through the descending queue. If the descending queue is empty, step S411 is executed to output the container result.

[0126] The disclosed embodiment inputs the second candidate test data into the second container according to the time consumption of the test data to obtain the target container, so that the difference in the total time consumption of the test data between the target containers is minimized, so that the time for the servers corresponding to different target containers to complete the test tasks is close, thereby improving the efficiency of concurrent testing.

[0127] In one embodiment, after the target container is obtained by sequentially inputting multiple test data into a container with the smallest total test data time consumption according to the test data time consumption, the data processing method further includes step S170 and step S180.

[0128] S170: Release storage space.

[0129] After determining that the target container is obtained, the storage space corresponding to the intermediate variable is released.

[0130] S180: Input the test data respectively saved in the target containers into a second table, where the second table is used for visual editing.

[0131] After the target container is determined, the test data stored in each container in the target container is input into a second table, wherein the second table is used for visual editing.

[0132] In the disclosed embodiment, the test data respectively stored in the target containers are input into the second table, thereby improving the readability of the data.

[0133] like Figure 5 As shown, the embodiment of the present disclosure further provides a data processing device 500, and the service data processing device 500 includes:

[0134] An acquisition module 501 is used to acquire a preset expected time and a plurality of test data, wherein the test data includes the test data time, and the test data is indivisible data;

[0135] A determination module 502, configured to determine the number of concurrent connections according to a preset expected time consumption and the test data time consumption of multiple test data, and to create containers of the number of concurrent connections;

[0136] An input module 503 is used to input multiple test data into containers in sequence according to the time consumption of the test data to obtain a target container, wherein the difference in the total time consumption of the test data between the target containers is the smallest;

[0137] The testing module 504 is used to perform concurrent testing on multiple test data based on the target container.

[0138] In some embodiments, the acquisition module 501 is specifically used to:

[0139] Acquire a first table including a plurality of scene data;

[0140] Based on the first table, a plurality of scene data are read and converted to obtain a plurality of test data.

[0141] In some embodiments, the data processing device further includes a summing module, the summing module being used to sum the test data time consumption of the plurality of test data to obtain the target test data time consumption;

[0142] Divide the target test data time by the preset expected time to get the number of concurrent connections.

[0143] In some embodiments, the data processing device further includes an arranging module, which is used to arrange the plurality of test data in descending order according to the time consumption of the test data to obtain a descending queue;

[0144] When the container is empty, filter out the concurrent test data from the descending queue and input it into the container to obtain the first container;

[0145] Obtain the first candidate test data from the descending queue according to the time consumption of the test data;

[0146] respectively summing the test data consumption of the first candidate test data and the test data consumption of the test data included in the first container to obtain a plurality of first test data time consumption sums;

[0147] Input the first candidate test data into the container with the smallest total time consumption of the first test data to obtain a second container;

[0148] When the descending queue is empty, the second container is determined as the target container.

[0149] In some embodiments, the data processing apparatus further includes a creation module, the creation module being used to create a storage space;

[0150] The test data included in the second container is saved to the storage space in a time-consuming manner.

[0151] In some embodiments, the acquisition module 501 is specifically used to:

[0152] When the descending queue is not empty, obtain the second candidate test data from the descending queue according to the time consumption of the test data;

[0153] Accessing the storage space to obtain the test data of the second container takes time;

[0154] respectively summing the test data consumption of the second candidate test data and the test data consumption of the test data included in the second container to obtain a plurality of second test data time consumption sums;

[0155] Input the second candidate test data into the container with the smallest total time consumption of the second test data to obtain a third container;

[0156] When the descending queue is empty, the third container is determined as the target container.

[0157] In some embodiments, the data processing device further includes a release module, the release module is used to release the storage space;

[0158] The test data respectively saved in the target containers are input into a second form, and the second form is used for visual editing.

[0159] Figure 5 Each module / unit in the device shown has the function of realizing Figures 1 to 3 The functions of each step executed by the application system in the present invention can achieve the corresponding technical effects. For the sake of brevity, they will not be repeated here.

[0160] Figure 6 A schematic diagram of the hardware structure of data processing provided by an embodiment of the present disclosure is shown.

[0161] The data processing device may include a processor 601 and a memory 602 storing computer program instructions.

[0162] Specifically, the processor 601 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiments of the present application.

[0163] The memory 602 may include a large capacity memory for data or instructions. By way of example and not limitation, the memory 602 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive or a combination of two or more of these. In appropriate cases, the memory 602 may include a removable or non-removable (or fixed) medium. In appropriate cases, the memory 602 may be inside or outside the integrated gateway disaster recovery device. In a specific embodiment, the memory 602 is a non-volatile solid-state memory.

[0164] The memory 602 may include a read-only memory (ROM), a random access memory (RAM), a magnetic disk storage medium device, an optical storage medium device, a flash memory device, an electrical, optical or other physical / tangible memory storage device. Therefore, generally, the memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to one aspect of the present disclosure.

[0165] The processor 601 implements any one of the data processing methods in the above embodiments by reading and executing computer program instructions stored in the memory 602 .

[0166] In one example, the data processing device may further include a communication interface 603 and a bus 604. Figure 6 As shown, the processor 601, the memory 602, and the communication interface 603 are connected via a bus 604 and communicate with each other.

[0167] The communication interface 603 is mainly used to implement communication between various modules, devices, units and / or equipment in the embodiments of the present application.

[0168] Bus 604 includes hardware, software or both, and couples the components of online data flow billing equipment to each other. For example, but not limitation, the bus may include Accelerated Graphics Port (AGP) or other graphics bus, Enhanced Industry Standard Architecture (EISA) bus, Front Side Bus (FSB), Hyper Transport (HT) interconnection, Industry Standard Architecture (ISA) bus, InfiniBand interconnection, Low Pin Count (LPC) bus, Memory bus, Micro Channel Architecture (MCA) bus, Peripheral Component Interconnect (PCI) bus, PCI-Express (PCI-X) bus, Serial Advanced Technology Attachment (SATA) bus, Video Electronics Standards Association Local (VLB) bus or other suitable bus or two or more of these combinations. In appropriate cases, bus 604 may include one or more buses. Although the embodiment of the present invention describes and shows a specific bus, the present invention considers any suitable bus or interconnection. In addition, in conjunction with the method for data processing in the above-mentioned embodiment, the embodiment of the present application also provides a computer storage medium to realize. The computer storage medium stores computer program instructions; when the computer program instructions are executed by the processor, any one of the data processing methods in the above embodiments is implemented.

[0169] An embodiment of the present application also provides a computer program product, including a computer program, which implements any one of the data processing methods in the above embodiments when the computer program is executed by a processor.

[0170] It should be clear that the present invention is not limited to the specific configuration and processing described above and shown in the figures. For the sake of simplicity, a detailed description of the known method is omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present invention is not limited to the specific steps described and shown, and those skilled in the art can make various changes, modifications and additions, or change the order between the steps after understanding the spirit of the present invention.

[0171] The functional blocks shown in the above structural block diagram can be implemented as hardware, software, firmware or a combination thereof. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), appropriate firmware, plug-in, function card, etc. When implemented in software, the elements of the present invention are programs or code segments used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or communication link by a data signal carried in a carrier. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, read-only memory (Read-Only Memory, ROM), flash memory, erasable read-only memory (Erasable ReadOnly Memory, EROM), floppy disks, compact disc read-only memory (Compact Disc Read-Only Memory, CD-ROM), optical discs, hard disks, optical fiber media, radio frequency (Radio Frequency, RF) links, etc. The code segment can be downloaded via a computer network such as the Internet, an intranet, etc.

[0172] It should also be noted that the exemplary embodiments mentioned in the present invention describe some methods or systems based on a series of steps or devices. However, the present invention is not limited to the order of the above steps, that is, the steps can be performed in the order mentioned in the embodiments, or in a different order from the embodiments, or several steps can be performed simultaneously.

[0173] Aspects of the present disclosure are described above with reference to the flowchart and / or block diagram of the method, device (system) and computer program product according to the embodiment of the present disclosure. It should be understood that each box in the flowchart and / or block diagram and the combination of each box in the flowchart and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device to produce a machine so that these instructions executed by the processor of the computer or other programmable data processing device enable the implementation of the function / action specified in one or more boxes of the flowchart and / or block diagram. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field programmable logic circuit. It can also be understood that each box in the block diagram and / or flowchart and the combination of boxes in the block diagram and / or flowchart can also be implemented by dedicated hardware that performs a specified function or action, or can be implemented by a combination of dedicated hardware and computer instructions.

[0174] The above is only a specific implementation of the present invention. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the system, module and unit described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here. It should be understood that the protection scope of the present invention is not limited to this. Any technician familiar with the technical field can easily think of various equivalent modifications or replacements within the technical scope disclosed by the present invention, and these modifications or replacements should be covered within the protection scope of the present invention.

Claims

1. A method for data processing, characterized in that: include: Obtaining a preset expected time and a plurality of test data, wherein the test data includes the test data time, and the test data is inseparable data; Determine the number of concurrent connections according to the preset expected time consumption and the test data time consumption of the multiple test data, and create containers of the number of concurrent connections; According to the time consumption of the test data, the plurality of test data are sequentially input into the containers to obtain target containers, wherein the difference in the total time consumption of the test data between the target containers is the smallest; Concurrently testing the multiple test data is performed based on the target container.

2. The method according to claim 1, characterized in that Before obtaining the preset expected time and multiple test data, the method further includes: Acquire a first table including a plurality of scene data; Based on the first table, the plurality of scene data are read and converted to obtain the plurality of test data.

3. The method according to claim 1, characterized in that The determining the number of concurrent operations according to the preset expected time consumption and the test data time consumption of the plurality of test data includes: Sum the test data time consumption of the multiple test data to obtain the target test data time consumption; The target test data time consumption is divided by the preset expected time consumption to obtain the concurrent number.

4. The method according to claim 1, characterized in that: The step of sequentially inputting the plurality of test data into the container according to the time consumption of the test data to obtain the target container comprises: Arrange the plurality of test data in descending order according to the time consumption of the test data to obtain a descending queue; When the container is empty, filter out the concurrent amount of test data from the descending queue and input the test data into the container to obtain a first container; Acquire first candidate test data from the descending queue according to the time consumption of the test data; respectively summing the test data consumption of the first candidate test data and the test data consumption of the test data included in the first container to obtain a plurality of first test data time consumption sums; Inputting the first candidate test data into the container with the smallest total time consumption of the first test data to obtain a second container; When the descending queue is empty, the second container is determined as the target container.

5. The method according to claim 4, characterized in that After inputting the first candidate test data into the container with the smallest total time consumption of the first test data to obtain the second container, the method further includes: Create storage space; The test data included in the second container is saved in the storage space in a time-consuming manner.

6. The method according to claim 5, characterized in that After inputting the first candidate test data into the container with the smallest total time consumption of the first test data to obtain a second container, the method further includes: When the descending queue is not empty, obtaining second candidate test data from the descending queue according to the time consumption of the test data; Accessing the storage space to obtain the test data included in the second container takes time; respectively summing the test data consumption of the second candidate test data and the test data consumption of the test data included in the second container to obtain a plurality of second test data time consumption sums; Input the second candidate test data into the container with the smallest total time consumption of the second test data to obtain a third container; When the descending queue is empty, the third container is determined as the target container.

7. The method according to claim 6, characterized in that After the plurality of test data are sequentially input into a container having the smallest total test data time consumption among the containers according to the time consumption of the test data to obtain a target container, the method further includes: releasing the storage space; The test data respectively saved in the target containers are input into a second form, where the second form is used for visual editing.

8. A data processing device, characterized in that: The device comprises: An acquisition module, the acquisition module is used to acquire a preset expected time and a plurality of test data, the test data includes the test data time, and the test data is inseparable data; A determination module, the determination module is used to determine the number of concurrent connections according to the preset expected time consumption and the test data time consumption of the multiple test data, and to create containers for the number of concurrent connections; An input module, the input module is used to input the plurality of test data into the containers in sequence according to the time consumption of the test data, to obtain a target container, wherein the difference in the total time consumption of the test data between the target containers is the smallest; A test module is used to perform concurrent testing on the multiple test data based on the target container.

9. A data processing device, characterized in that: The device comprises: a processor and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement the data processing method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer program instructions, and when the computer program instructions are executed by a processor, the method for data processing according to any one of claims 1 to 7 is implemented.

11. A computer program product, characterized in that The invention comprises a computer program, which, when executed by a processor, implements the data processing method according to any one of claims 1 to 7.