CN111143179B - Method and device for positioning performance bottleneck, storage medium and electronic equipment - Google Patents
Method and device for positioning performance bottleneck, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111143179B CN111143179B CN201911341426.2A CN201911341426A CN111143179B CN 111143179 B CN111143179 B CN 111143179B CN 201911341426 A CN201911341426 A CN 201911341426A CN 111143179 B CN111143179 B CN 111143179B
- Authority
- CN
- China
- Prior art keywords
- performance bottleneck
- request
- time
- node
- layer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
- G06F11/3452—Performance evaluation by statistical analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3688—Test management for test execution, e.g. scheduling of test suites
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0817—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking functioning
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Environmental & Geological Engineering (AREA)
- Signal Processing (AREA)
- Life Sciences & Earth Sciences (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Evolutionary Biology (AREA)
- Probability & Statistics with Applications (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a method and a device for positioning performance bottlenecks, a storage medium and electronic equipment, wherein the method comprises the following steps: the method comprises the steps that a package grabbing tool is used for grabbing packages of a tested server and a peripheral system, and a preset language is used for analyzing package grabbing files; the bottleneck nodes of the parsed bale plucking file are positioned based on a three-layer analysis method, and the method comprises the following steps: a first layer of screening, wherein performance bottleneck nodes are positioned based on comparison of the information of each inspection item; and a second layer of screening, namely selecting two time periods to carry out packet grabbing comparison and calculating to locate the performance bottleneck node based on the preset time. And the third layer of screening, namely, initiating a plurality of requests at a plurality of moments based on at least one tested server, respectively carrying out node packet capturing at each moment through a packet capturing tool and carrying out statistical analysis to locate the performance bottleneck node. Therefore, the method, the device, the storage medium and the electronic equipment for locating the performance bottleneck can remarkably improve the working efficiency, and can provide effective auxiliary evidence for locating the performance bottleneck.
Description
Technical Field
The present invention relates to the field of software testing technologies, and in particular, to a method and apparatus for locating performance bottlenecks, a storage medium, and an electronic device.
Background
The influence factors of the non-ideal system all-link pressure test results of banks, dealer and the like are complex and are synthesized by a plurality of factors. Such as network factors, resource factors, configuration factors, application factors, etc. Full link crush testing typically involves multiple systems, and when performance bottlenecks are encountered, it is common practice to analyze and troubleshoot each influencing factor one by one based on the personal experience accumulation of the test engineer. Such as viewing logs, using ping, etc. commands.
Performance testing involves software applications, deployments, and operation and maintenance. Due to the restrictions of organization architecture and safe production, partial operation and maintenance related information needs to be assisted by operation and maintenance colleagues; analysis of applications, such as viewing logs, configuration files, etc., often requires the coordination of groups of items, as testers are not familiar with the project structure. For items with a short construction period, locating the system bottleneck is time consuming. Traditional analysis methods often either miss useful information or introduce useless information in test diagnostics, so that the tester cannot go out of the primary or secondary of the phenomenon or draw incorrect or even erroneous conclusions.
The information disclosed in this background section is only for enhancement of understanding of the general background of the invention and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person of ordinary skill in the art.
Disclosure of Invention
The invention aims to provide a method and a device for locating performance bottlenecks, a storage medium and electronic equipment, which can remarkably improve the working efficiency and can give effective auxiliary evidence for locating the performance bottlenecks.
To achieve the above object, in a first aspect, an embodiment of the present invention provides a method for locating a performance bottleneck, including: the method comprises the steps that a packet grabbing tool is used for grabbing packets of at least one tested server and a peripheral system based on a request, and a preset language is used for analyzing packet grabbing files; the bottleneck nodes of the parsed bale plucking file are positioned based on a three-layer analysis method, and the method comprises the following steps: a first layer of screening, which is used for comparing the information of each checking item before and after the tested server sends the request to locate the performance bottleneck node; a second layer of screening, which selects two time periods to carry out packet grabbing comparison and calculation to locate a performance bottleneck node based on the preset time after the tested server sends a request; and a third layer of screening, which initiates a plurality of requests at a plurality of moments based on at least one tested server, and respectively performs node packet grabbing on each moment through a packet grabbing tool and performs statistical analysis to locate the performance bottleneck node.
In one embodiment of the present invention, the first layer of screening specifically comprises: before a tested server sends a request, acquiring reference information; after the tested server sends a request, acquiring information of each inspection item, and comparing the information with the reference information; if the comparison deviation exceeds the preset value, terminating the test, and verifying the reason of the large deviation; and if the comparison deviation does not exceed the preset value, analyzing the packet capture file of each node to obtain the calling relationship, the times and the time consumption among the nodes, and deducing the bottleneck node by combining the system resources.
In one embodiment of the present invention, the second layer of screening specifically comprises: the tested server initiates a request and lasts for a preset time; selecting two time periods in preset time, and respectively carrying out packet grabbing through a packet grabbing tool; and comparing and calculating the time-consuming change trend of the packets of the two time periods, and combining an analysis tool to locate the performance bottleneck.
In one embodiment of the present invention, the number of at least one server under test is three.
In one embodiment of the present invention, the third layer screening specifically includes: at a first moment, a first tested server initiates a first request;
at a second moment, a second tested server initiates a second request;
at a third moment, a third tested server initiates a third request; and
and respectively carrying out node packet grabbing on the first time to the second time, the second time to the third time and the third time to the end time by a packet grabbing tool, carrying out statistics and analysis on the time-consuming change trend of the packets of each node, and combining an analysis tool to locate the performance bottleneck.
In a second aspect, an embodiment of the present invention further provides an apparatus for locating a performance bottleneck, including:
the single server single request analysis module is used for comparing the information of each inspection item before and after the tested server sends the request so as to locate the performance bottleneck;
the single-server multi-concurrency request analysis module is used for selecting two time periods to carry out packet grabbing comparison and calculation based on the preset time after the tested server sends a request, so that the performance bottleneck is positioned; and
the multi-server round-robin multi-concurrency request analysis module is used for initiating a plurality of requests at a plurality of moments based on at least one tested server, and node packet grabbing and statistic analysis are respectively carried out on each moment through the packet grabbing tool, so that the performance bottleneck is located.
In a third aspect, an embodiment of the present invention further provides a storage medium, where computer executable instructions are stored, where the computer executable instructions are configured to perform the above-mentioned method for locating a performance bottleneck.
In a fourth aspect, an embodiment of the present invention further provides an electronic device, including:
at least one processor; and
a memory communicatively coupled to the at least one processor;
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of locating performance bottlenecks.
Compared with the prior art, the method, the device, the storage medium and the electronic equipment for locating the performance bottleneck can remarkably improve the working efficiency, and can provide effective auxiliary evidence for locating the performance bottleneck.
Drawings
FIG. 1 is a flow diagram of a method of locating performance bottlenecks according to one embodiment of the invention;
FIG. 2 is a schematic architecture diagram of a full link testing environment of a method of locating performance bottlenecks according to one embodiment of the invention;
FIG. 3 is a flow chart of a first layer screening of a method of locating performance bottlenecks according to one embodiment of the invention;
FIG. 4 is a schematic diagram of a second layer screening of a method of locating performance bottlenecks according to one embodiment of the invention;
FIG. 5 is a schematic diagram of a third tier of screening of a method for locating performance bottlenecks according to one embodiment of the invention;
FIG. 6 is a schematic diagram of an apparatus for locating performance bottlenecks according to one embodiment of the invention;
fig. 7 is a schematic structural diagram of an electronic device for performing a method of locating a performance bottleneck according to an embodiment of the invention.
Detailed Description
The following detailed description of embodiments of the invention is, therefore, to be taken in conjunction with the accompanying drawings, and it is to be understood that the scope of the invention is not limited to the specific embodiments.
In the description of the present invention, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "upper", "lower", "front", "rear", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", "clockwise", "counterclockwise", etc. indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings are merely for convenience in describing the present invention and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a specific orientation, be configured and operated in a specific orientation, and thus should not be construed as limiting the present invention.
Throughout the specification and claims, unless explicitly stated otherwise, the term "comprise" or variations thereof such as "comprises" or "comprising", etc. will be understood to include the stated element or component without excluding other elements or components.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present invention, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.
Fig. 1 is a flowchart of a method for locating a performance bottleneck according to an embodiment of the present invention, fig. 2 is a schematic diagram of an architecture of a full-link test environment of the method for locating a performance bottleneck according to an embodiment of the present invention, fig. 3 is a flowchart of a first layer screening of the method for locating a performance bottleneck according to an embodiment of the present invention, fig. 4 is a schematic diagram of a second layer screening of the method for locating a performance bottleneck according to an embodiment of the present invention, and fig. 5 is a schematic diagram of a third layer screening of the method for locating a performance bottleneck according to an embodiment of the present invention.
As shown in fig. 1 to 5, a method of locating a performance bottleneck according to a preferred embodiment of the present invention includes:
positioning bottleneck nodes on the basis of a three-layer analysis method on the parsed packet capturing file, and positioning bottleneck nodes on the basis of the three-layer analysis method on the parsed packet capturing file comprises the following steps:
step 2, a first layer of screening is carried out, and performance bottleneck nodes are positioned based on comparison of the information of each inspection item before and after the tested server sends a request;
and 4, third-layer screening, namely initiating a plurality of requests at a plurality of moments based on at least one tested server, and respectively carrying out node packet grabbing on each moment through a packet grabbing tool and carrying out statistical analysis to locate the performance bottleneck node.
In one embodiment of the present invention, the first layer of screening specifically comprises: before a tested server sends a request, acquiring reference information; after the tested server sends a request, acquiring information of each inspection item, and comparing the information with the reference information; if the comparison deviation exceeds the preset value, terminating the test, and verifying the reason of the large deviation; and if the comparison deviation does not exceed the preset value, analyzing the packet capture file of each node to obtain the calling relationship, the times and the time consumption among the nodes, and deducing the bottleneck node by combining the system resources. In the practical application, the method has the advantages that,
in one embodiment of the present invention, the second layer of screening specifically comprises: the tested server initiates a request and lasts for a preset time; selecting two time periods in preset time, and respectively carrying out packet grabbing through a packet grabbing tool; and comparing and calculating the time-consuming change trend of the packets of the two time periods, and combining an analysis tool to locate the performance bottleneck.
In one embodiment of the present invention, the number of at least one server under test is three.
In one embodiment of the present invention, the third layer screening specifically includes: at a first moment, a first tested server initiates a first request;
at a second moment, a second tested server initiates a second request;
at a third moment, a third tested server initiates a third request; and
and respectively carrying out node packet grabbing on the first time to the second time, the second time to the third time and the third time to the end time by a packet grabbing tool, carrying out statistics and analysis on the time-consuming change trend of the packets of each node, and combining an analysis tool to locate the performance bottleneck.
Fig. 6 is a schematic structural diagram of an apparatus for locating performance bottlenecks according to one embodiment of the invention. An apparatus for locating a performance bottleneck, comprising: the single server single request analysis module 1 is used for comparing the information of each inspection item before and after the tested server sends the request so as to locate the performance bottleneck; the single-server multi-concurrent request analysis module 2 is used for selecting two time periods to carry out packet grabbing comparison and calculation based on the preset time after the tested server sends a request, so that the performance bottleneck is positioned; and the multi-server round-robin multi-concurrency request analysis module 3 is used for initiating a plurality of requests at a plurality of moments based on at least one tested server, and respectively carrying out node packet grabbing and statistical analysis on each moment through a packet grabbing tool so as to locate the performance bottleneck.
Fig. 7 is a schematic structural diagram of an electronic device for performing a method of locating a performance bottleneck according to an embodiment of the invention. The electronic device 1100 may be a host server with computing capabilities, a personal computer PC, or a portable computer or terminal that can be carried, etc. The specific embodiments of the present invention are not limited to specific implementations of electronic devices.
The electronic device 1100 includes at least one processor 1110, a communication interface (Communications Interface) 1120, a memory 1130, and a bus 1140. Wherein processor 1110, communication interface 1120, and memory 1130 communicate with each other through bus 1140.
The communication interface 1120 is used to communicate with network elements including, for example, virtual machine management centers, shared storage, and the like.
The processor 1110 is used to execute programs. The processor 1110 may be a central processing unit CPU, or an application specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention.
The memory 1130 is used for executable instructions. Memory 1130 may include high-speed RAM memory or non-volatile memory (nonvolatile memory), such as at least one magnetic disk memory. Memory 1130 may also be a memory array. Memory 1130 may also be partitioned and the blocks may be combined into virtual volumes according to certain rules. The instructions stored in memory 1130 may be executable by processor 1110 to enable processor 1110 to perform the method of evaluating software risk in any of the method embodiments described above.
In practical application, a common full-link testing environment can be abstracted, as shown in fig. 2 and 3, performance test is performed on a link including (ABC) DE node, A, B, C is a tested server node, and response information is obtained after a request is sent to a through a- > D- > E- > D-a.
And according to the network communication model, the request is sent to the opposite terminal through the transmission layer, the network layer, the link layer and the physical layer after being initiated by the application layer. When the performance index does not meet the expected demand, the following test scheme may be followed: after the N requests are respectively wrapped in the ABCDE server, the wrapped file is analyzed by languages such as Python and the like, and the three-layer analysis method is combined for positioning.
First tier screening (single server single request analysis): initiate N requests from a, n=1: and acquiring a tested link layer switch, a network layer router, transmission layer interaction times, application layer interaction paths, code calls and the like.
(1) Before initiating the request: the using device acquires reference information, wherein the reference information is the current state of the peripheral system after the tested server is restarted:
a. host resources (CPU, MEM, IO);
b. network bandwidth;
c. time-consuming and network delay for inter-route hops;
d. the uplink and downlink rate of the exchanger;
e. the resources (CPU, MEM, IO) at both ends are transmitted.
(2) After the request is sent, the user device acquires and aggregates the page to display various information, and compares the information with the reference information:
a. whether the host resource (CPU, MEM, IO) reaches the baseline value or exceeds x times the baseline value, such as x=0.1;
b. on the network transmission layer, combining the icmp packet with the TTL to judge whether the node information in the router reaches the reference value or exceeds x times of the reference value, for example, x=0.1;
c. the time spent in the inter-route jump, whether the network delay reaches a reference value or exceeds x times the reference value, such as x=0.1;
d. whether the uplink and downlink rates of the switch reach the reference value or exceed x times of the reference value, for example, x=0.1;
e. whether the resources (CPU, MEM, IO) at both ends of the transmission reach the reference value or exceed x times the reference value, such as x=0.1;
f. each node grabs the packet.
(3) If none of a-e exceeds 10%, the combined device grabs the packet for analysis:
a. the packet is grasped at each node to check and analyze whether the information that the opposite terminal does not respond is requested for many times, so that extra loss is caused;
b. statistics of interaction times among A- > D- > E: the method comprises the steps of capturing packets at each node, setting Count, checking the number of times that service demands are continuously connected to obtain a certain value, calculating the rationality of the access frequency, and comprehensively analyzing by combining the service condition of server resources;
c. a- > D, D- > E, A- > E segmentation time consuming statistics: and calculating time consumption of each section according to the packet grabbing data, and analyzing nodes which cause the time consumption of the whole link.
(4) After the scope is reduced by using the bale breaking analysis method, the positioning problem is further analyzed according to program analysis tools used in different languages.
As shown in fig. 4, the second layer screening (single server multiple concurrent request analysis): initiating N requests from A; n=100000, the initiation time is noted as T, tm and Tn times (m < N):
a. carrying out full-link packet capturing at the Tm time;
b. carrying out full-link packet capturing at the Tn moment;
c. carrying out statistical analysis on the Tm packet to obtain a time-consuming average value, a maximum value, a minimum value and a 90% average value of each node section;
d. carrying out statistical analysis on the Tn packets to obtain time-consuming average values, maximum values, minimum values and 90% average values of the node sections;
e. comparing 90% average values of the sections A- > D, D- > E and A- > E at the Tm and Tn time, and evaluating the performance change of each node;
f. and (5) narrowing the range according to the steps, combining a program analysis tool, and positioning the performance bottleneck.
As shown in fig. 5, the third layer of screening (multi-server round robin concurrency request analysis): sequentially sending out N requests from A, B, C, wherein N=10000, initiating A request at time T, initiating B request at time Tt and initiating C request at time T2T:
a. at any time in the T-Tt interval, recorded as Tm, and the A, D, E node is grabbed;
b. at any time in the Tt-T2T interval, marked as Tn, the A, B, D, E node is grabbed;
c. at any time in the interval T2T-T', marked as Tp, the A, B, C, D, E node is grabbed;
d. carrying out statistical analysis on the Tm packet to obtain a time-consuming average value, a maximum value, a minimum value and a 90% average value of each node section;
e. carrying out statistical analysis on the Tn packets to obtain time-consuming average values, maximum values, minimum values and 90% average values of the node sections;
f. carrying out statistical analysis on the Tp packets to obtain time-consuming average values, maximum values, minimum values and 90% average values of the node sections;
g. comparing the average value of 90% of the comparison A-D, D-E, A-E at the time of Tm and Tn and Tp, and evaluating the performance change trend of each node;
h. and (5) narrowing the range according to the steps, combining a program analysis tool, and positioning the performance bottleneck.
The present invention provides a practical example, concretely as follows:
the user uses the payment device to associate with my bank card to make payment operation. The systems involved in this scenario are: an external connection platform cluster (2), an encryption machine system single unit, a private business system cluster (2), a credit card system cluster and a debit card system cluster. According to the expected index, the link is tested to bear 1000 concurrent 50000TPS pressure, and the index cannot be met when the link is tested. The three-layer assay of the invention can be applied at this time:
first layer analysis:
(1) Before the test is initiated, the device is used for acquiring various examination item information of the current environment;
(2) Transmitting a transaction, and acquiring information of each examination item by using the device;
(3) Comparing the data in the step (2) with the data in the step (1), and if the deviation exceeds x times, setting x=5% in the project, terminating the test to find out the reason of the large deviation of the inspection item;
(4) If no abnormality is found in the step (3), analyzing the packet capturing files of each node by using the device to obtain the calling relationship, the times and the time consumption among the nodes, and deducing the bottleneck node by combining system resources and the like;
(5) Further analyzing the node obtained in step (4), wherein the analysis tool is by means of an industry-universal programming language-based analysis tool.
In this case, through the first layer analysis, it has been found that the communication between the external application and the encryptor system is abnormal, and it is known from the packet grabbing analysis: one TCP connection to the encryptor system is externally connected, and data is transferred after 2 handshakes. For further analysis, a second layer analysis was used.
Second layer analysis:
(6) Configuring a 1000 concurrency scene, lasting for 10 minutes, after initiating a transaction, using the device of the invention to grasp packets at the 3 rd minute and the 8 th minute respectively, comparing and calculating to obtain the time-consuming change trend of the packets in the two time periods, and deducing possible bottleneck points;
(7) Further analyzing the node obtained in step (6), wherein the analysis tool is by means of an industry-universal programming language-based analysis tool.
In the case, through the second layer analysis, the time consumption of processing the request packet by the core system is increased in a trend that the private service system and the core system are increased along with the time under the high pressure; after feedback to the project team colleague, the discovery is caused by the physical deployment mode of the core application. And (3) using the second layer analysis method again, and continuing to check by combining the third layer analysis method at the moment that no abnormality is found.
Third layer analysis:
(8) For a system containing clusters, a sequential round-robin cluster application server scenario is set. For example, the externally connected platform includes 2 application servers, and sets a scenario testing strategy to be that the pressure simulator presses a testing link: an external connection application server-an encryption machine system-a private business system-a debit card system; pressure simulator pressure measurement link: an external application server-an encryptor system-a private business system-a debit card system. Firstly, initiating a pressure test of a link to serve as background pressure, and when the scene runs for 3 minutes, using the device to grab a packet; after the scene runs for 5 minutes, the pressure test of the link is started, and when the scene runs for 8 minutes, the device is used for grabbing packets. And comparing the time-consuming change trends of the packets of the two time periods obtained by calculation, and deducing possible bottleneck points.
(9) Further analysis of the bottleneck nodes obtained in step (8) is performed by means of an industry-generic programming language-based analysis tool.
In this case, through third layer analysis, it is determined that the bottleneck point is in the encryptor system: when the pressure to the second application server is started, the background pressure TPS curve is obviously reduced, and the time consumption from the external connection application server to the encryptor system is obviously increased; without significant change in time consumption from the bus to the debit card system. Because the encryption machine system purchases the product for the third party, the test personnel feed back the test result to the manufacturer, and the manufacturer is positioned as the result of local hardware damage after evaluation. The pressure test result can be expected after the equipment is replaced.
In a word, the method, the device, the storage medium and the electronic equipment for locating the performance bottleneck can remarkably improve the working efficiency, and can provide effective auxiliary evidence for locating the performance bottleneck.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing descriptions of specific exemplary embodiments of the present invention are presented for purposes of illustration and description. It is not intended to limit the invention to the precise form disclosed, and obviously many modifications and variations are possible in light of the above teaching. The exemplary embodiments were chosen and described in order to explain the specific principles of the invention and its practical application to thereby enable one skilled in the art to make and utilize the invention in various exemplary embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims and their equivalents.
Claims (8)
1. A method of locating a performance bottleneck, comprising:
the method comprises the steps that a packet grabbing tool is used for grabbing packets of at least one tested server and a peripheral system based on a request, and a preset language is used for analyzing packet grabbing files;
the bottleneck nodes of the parsed bale plucking file are positioned based on a three-layer analysis method, and the method comprises the following steps:
a first layer of screening, wherein performance bottleneck nodes are positioned based on comparison of the information of each inspection item before and after the tested server sends a request;
a second layer of screening, namely selecting two time periods to carry out packet grabbing comparison and calculating to locate a performance bottleneck node based on the preset time after the tested server sends a request; and
and the third layer of screening is to initiate a plurality of requests at a plurality of moments based on the at least one tested server, and to carry out node packet grabbing and statistical analysis on each moment by a packet grabbing tool so as to locate the performance bottleneck node.
2. The method of locating a performance bottleneck of claim 1, wherein the first layer screening specifically comprises:
before the tested server sends a request, acquiring reference information;
after the tested server sends a request, acquiring information of each inspection item, and comparing the information with the reference information;
if the comparison deviation exceeds the preset value, terminating the test, and verifying the reason of the large deviation; and
if the comparison deviation does not exceed the preset value, analyzing the packet capture file of each node to obtain the calling relationship, the times and the time consumption among the nodes, and deducing the bottleneck node by combining the system resources.
3. The method of locating a performance bottleneck of claim 1, wherein the second layer screening specifically comprises:
the tested server initiates a request and lasts for a preset time;
selecting two time periods within the preset time, and respectively grabbing the package through a package grabbing tool; and
comparing and calculating the time-consuming change trend of the packets of the two time periods, and combining an analysis tool to locate the performance bottleneck.
4. The method of locating a performance bottleneck of claim 1, wherein the number of at least one server under test is three.
5. The method for locating a performance bottleneck of claim 4, wherein the third layer screening specifically comprises:
at a first moment, a first tested server initiates a first request;
at a second moment, a second tested server initiates a second request;
at a third moment, a third tested server initiates a third request; and
and respectively carrying out node packet grabbing on the first time to the second time, the second time to the third time and the third time to the end time through a packet grabbing tool, carrying out statistics analysis on the time-consuming change trend of the packets of each node, and combining an analysis tool to locate the performance bottleneck.
6. An apparatus for locating a performance bottleneck, comprising:
the single server single request analysis module is used for comparing the information of each inspection item before and after the tested server sends the request so as to locate the performance bottleneck;
the single-server multi-concurrent request analysis module is used for selecting two time periods to carry out packet grabbing comparison and calculation based on the preset time after the tested server sends a request, so that the performance bottleneck is positioned; and
the multi-server round-robin multi-concurrency request analysis module is used for initiating a plurality of requests at a plurality of moments based on at least one tested server, and node packet grabbing and statistic analysis are respectively carried out on each moment through the packet grabbing tool, so that the performance bottleneck is located.
7. A computer readable storage medium having stored thereon computer executable instructions for performing the method of locating a performance bottleneck as claimed in any one of claims 1 to 5.
8. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor;
wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of locating a performance bottleneck of any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911341426.2A CN111143179B (en) | 2019-12-24 | 2019-12-24 | Method and device for positioning performance bottleneck, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911341426.2A CN111143179B (en) | 2019-12-24 | 2019-12-24 | Method and device for positioning performance bottleneck, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111143179A CN111143179A (en) | 2020-05-12 |
| CN111143179B true CN111143179B (en) | 2023-06-13 |
Family
ID=70519442
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911341426.2A Active CN111143179B (en) | 2019-12-24 | 2019-12-24 | Method and device for positioning performance bottleneck, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111143179B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113778892B (en) * | 2021-07-13 | 2024-05-07 | 统信软件技术有限公司 | Method for locating performance bottleneck of operating system, computing device and storage medium |
| CN113656292B (en) * | 2021-08-04 | 2022-05-17 | 航天中认软件测评科技（北京）有限责任公司 | Multi-dimensional cross-space-time basic software performance bottleneck detection method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2014178865A (en) * | 2013-03-14 | 2014-09-25 | Nippon Telegr & Teleph Corp <Ntt> | Bottleneck analysis device, method, and program |
| CN110278122A (en) * | 2018-03-16 | 2019-09-24 | 厦门靠谱云股份有限公司 | A kind of cloud database data on flows sampling analysis method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4594258B2 (en) * | 2006-03-10 | 2010-12-08 | 富士通株式会社 | System analysis apparatus and system analysis method |
| EP2948845A4 (en) * | 2013-01-26 | 2016-09-07 | F5 Networks Inc | Methods and systems for detecting, locating and remediating a congested resource or flow in a virtual infrastructure |
| US10423875B2 (en) * | 2014-01-07 | 2019-09-24 | Stephen L. Thaler | Electro-optical device and method for identifying and inducing topological states formed among interconnecting neural modules |
-
2019
- 2019-12-24 CN CN201911341426.2A patent/CN111143179B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2014178865A (en) * | 2013-03-14 | 2014-09-25 | Nippon Telegr & Teleph Corp <Ntt> | Bottleneck analysis device, method, and program |
| CN110278122A (en) * | 2018-03-16 | 2019-09-24 | 厦门靠谱云股份有限公司 | A kind of cloud database data on flows sampling analysis method |
Non-Patent Citations (2)
| Title |
|---|
| 网络测试与故障查找;李清霞;《中国教育技术装备》;20090825(第21期);106-108 * |
| 软件定义光传送网控制器测试方法研究;徐云斌等;《光通信研究》;20180330(第02期);12-14 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111143179A (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110245078B (en) | Software pressure testing method and device, storage medium and server | |
| US20150074463A1 (en) | SAN Performance Analysis Tool | |
| CN111143179B (en) | Method and device for positioning performance bottleneck, storage medium and electronic equipment | |
| CN109669766A (en) | Processing method, device, equipment and the storage medium of batch processing job | |
| WO2017114152A1 (en) | Service dial testing method, apparatus and system | |
| CN105404580B (en) | Distributed pressure testing system and method | |
| CN108769083A (en) | Login method, apparatus and system based on distributed server | |
| US10523550B2 (en) | Scout functions | |
| CN111181800A (en) | Test data processing method and device, electronic equipment and storage medium | |
| CN112650676A (en) | Software testing method, device, equipment and storage medium | |
| CN106126419A (en) | The adjustment method of a kind of application program and device | |
| US9658932B2 (en) | Lightweight functional testing | |
| CN109918275B (en) | Method, device and system for realizing pressure test on server performance | |
| CN111143151B (en) | Service monitoring method and device and electronic equipment | |
| CN112214373B (en) | Hardware monitoring method and device and electronic equipment | |
| CN112235300B (en) | Cloud virtual network vulnerability detection method, system, device and electronic equipment | |
| CN111639022B (en) | Transaction testing method and device, storage medium and electronic device | |
| CN109359034A (en) | A kind of operation system test method, computer readable storage medium and terminal device | |
| EP3062228B1 (en) | Lightweight functional testing | |
| CN110932879B (en) | Network performance test method, data processing device and storage medium | |
| WO2023224685A1 (en) | Impact-aware mitigation for computer networks | |
| CN116346395A (en) | Industrial control network asset identification method, system, equipment and storage medium | |
| CN112134764B (en) | Method and device for determining connectivity of test environment | |
| CN114461350A (en) | Method and device for testing availability of container | |
| CN113656313A (en) | Automatic test processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |