CN102346710B - Dynamic stubbing technology based time-delay analysis method for data packet processing - Google Patents
Dynamic stubbing technology based time-delay analysis method for data packet processing Download PDFInfo
- Publication number
- CN102346710B CN102346710B CN201110309258.6A CN201110309258A CN102346710B CN 102346710 B CN102346710 B CN 102346710B CN 201110309258 A CN201110309258 A CN 201110309258A CN 102346710 B CN102346710 B CN 102346710B
- Authority
- CN
- China
- Prior art keywords
- machine
- function
- packet
- kernel
- module
- 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.)
- Expired - Fee Related
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a dynamic stubbing technology based time-delay analysis method for data packet processing. The method comprises the following five main steps of: 1, collecting a kernel symbol table and acquiring a function list capable of being stubbed; 2, determining a function list to be stubbed; 3, configuring a stubbing module, inserting a section of codes into each function to be stubbed, and adding function addresses and time stamps for function calling to a current data packet under processing; 4, starting a packet sending and receiving module; and 5, counting and analyzing the data packets stored in the step 4 to obtain the time consumed by each function of a kernel. The method disclosed by the invention has the advantages of less expense and very strong instantaneity and adaptability, can be used for elaborately analyzing the expense brought by each function and time delay for the data packets to wait in a queue in a process of treating the data packets by the Linux kernel, can provide a powerful basis for network analysis and optimization, and has a better practical value and a wide application prospect in the technical field of computers.
Description
(1) technical field
The present invention relates to a kind of processing data packets Delay Analysis based on dynamic pitching pile technology, be specifically related to a kind of method that utilization is analyzed the processing delay of each function of operating system nucleus in packet processing procedure based on dynamic pitching pile technology, belong to field of computer technology.
(2) background technology
Enriching constantly in recent years along with network application, network distribution is more and more wider, and network traffics are also increasing, and the network performance for data center proposes new demand and challenge.In order to tackle this challenge, data center is necessary to adjust network structure, improves the processing power of server.But, current many data centers in order to improve server utilization factor, simplify server the availability administering and maintaining, improve application program, reduce costs, mostly start to adopt Intel Virtualization Technology.Intel Virtualization Technology has a lot of advantages, but also can introduce extra expense, especially in I/O is virtual.Under virtualized environment, the processing procedure of packet is more complicated, and transmission path is longer, makes overall network performance very poor.
In order to optimizing network performance, where just must know the bottleneck of system, which link expense of system is maximum, then improves targetedly.Have the network performance of many people under how research improves virtualized environment at present, these researchs are from virtualized principle mostly, attempt to reduce virtualized expense, improve the network bandwidth, reduce network delay.But these study the analysis do not quantized the processing delay of packet, do not have instrument can analyze packet automatically from the time delay receiving each function sent whole processing procedure at present yet.The present invention is based on dynamic pitching pile technology, devise a kind of can the method for the time delay of each function of automatic analysis operating system nucleus in Packet Generation and receiving course.
Pitching pile technology be a kind of have in software test use widely, GCC compiler also provides corresponding function for test code coverage rate, and some operating system also supports pitching pile technology, as the Kprobe etc. of DTrace, Linux of Solaris.Dynamic pitching pile technology is a nearlyer step then, dynamically one section of code insertion can be used for the behavior of the information of collecting or reprogramming to certain position of program, and not need to change to original program when program is run.The present invention analyzes operating system processing data packets time delay based on dynamic pitching pile technology.
(3) summary of the invention
1, object
The object of this invention is to provide a kind of processing data packets Delay Analysis based on dynamic pitching pile technology, it can count the time that in processing data packets process, each function of operating system nucleus consumes and the time waited in line in queue, for the further network optimization provides strong foundation.
2, technical scheme
Technical scheme of the present invention is as follows: a kind of processing data packets Delay Analysis based on dynamic pitching pile technology, its overall framework as shown in Figure 1, machine in Fig. 1 can be real computing machine, also can be by the virtual virtual machine out of virtualization software, machine 1 in Fig. 1 and machine 2 mainly divide from the angle of function, and they can be deployed in same physical machine simultaneously.The major function of machine 1 is to provide control inerface, analyze and Output rusults, machine 1 deploy give out a contract for a project module and statistical module, the major function of machine 2 is collection information, and by the information feed back collected to machine 1, machine 2 deploy pitching pile module and packet receiving module.Idiographic flow as shown in Figure 2, a kind of processing data packets Delay Analysis based on dynamic pitching pile technology of the present invention, the method comprises the following steps:
Step 201. collects Kernel Symbol Table on machine 2, obtains the corresponding relation of kernel function and address, exports the function list that can carry out pitching pile, and passes to machine 1.
Step 202. according to the target optimized, determines the function of Water demand on machine 1, exports the function list needing pitching pile, and passes to machine 2.
Determined for step 202 function list is delivered on machine 2 by step 203., and machine 2 uses dynamic pitching pile technology to insert one section of code at the head of the function needing monitoring, and this code can by the address of function and current timestamp write packet.
Step 204. starts packet receiving module and module of giving out a contract for a project.Machine 1 starts to send packet, data packet delivery to machine 2 kernel after, if detect, the destination of packet is the packet receiving module of machine 2, just by the address of the current function performed and timestamp write packet.When packet arrives the packet receiving module of machine 2, packet is returned to machine 1 by packet receiving module, and the packet from machine 2 stores by the module of giving out a contract for a project of machine 1 in the form of a file.
All packets from machine 2 receiver module added up by step 205. machine 1, calculate and export statistics.
Wherein, it is the symbol table will collecting the kernel run that step 201 collects Kernel Symbol Table on machine 2, kernel function and the address of variable in internal memory is have recorded in Kernel Symbol Table, under linux system, by System.map corresponding with kernel version under reading/boot catalogue or directly read/proc/ksyms just can get Kernel Symbol Table, in addition, the Kernel Symbol Table that can also be obtained by analysis kernel file or kernel tailoring information.Owing to not only have recorded the address in internal memory of kernel function in Kernel Symbol Table, also have recorded the address of kernel variable, therefore the Kernel Symbol Table to reading is needed to analyze, filter out the interior nuclear symbol of those non-functional, export the symbol table of all kernel function, these functions are exactly the function list that can carry out pitching pile, after determining, are passed to machine 1.
Wherein, step 202 according to the target optimized, determines the function of Water demand on machine 1, exports the function list needing pitching pile.What receive machine 2 when machine 1 after the function list of pitching pile, can determine the function list needing pitching pile manually or automatically.Manually determine that needs are familiar for kernel processes process, know which function kernel can call and carry out handle packet, the then manual function writing in files of pitching pile that will need forms the function list needing pitching pile.Except manually determining, also can write a little step and automatically be determined by the method for name matching.Certainly manually determine the quantity that can reduce pitching pile, the impact of pitching pile on network performance can be reduced.
Wherein, first determined for step 202 function list will be delivered on machine 2 by step 203, then on machine, the dynamic pitching pile technology of 2 utilization inserts a bit of code at all heads of the function of monitoring that needs, after insertion completes, first kernel can perform the code of insertion when performing this function, then perform original function.The function of the code inserted detects the current packet processed, if meet some condition, added after packet in the address of the current function performed and current timestamp.
Wherein, step 204 can activate the packet receiving module of give out a contract for a project module and the machine 2 of machine 1 after having disposed pitching pile module.The packet receiving module of give out a contract for a project module and the machine 2 of machine 1 is all the application program operated under User space.Packet can be sent according to certain speed that is configured to of user to the packet receiving module of machine 2 after the module of giving out a contract for a project of machine 1 is activated, the structure of packet as shown in Figure 3, packet comprises two parts information, and metamessage part have recorded the information such as side-play amount and the side-play amount needing insertion information at present of packet size altogether, data message; Data message is then relatively simple, is exactly the form of a function address and timestamp, and function address and timestamp are all written to the end of data message by pitching pile module at every turn.The data information portion zero padding of the packet of the module transmission of giving out a contract for a project of machine 1, after packet arrives machine 2, timestamp when needing address and this function of kernel calls of the function of monitoring can be write the data information portion of packet by the pitching pile module being arranged in kernel, and the metamessage of Update Table bag.After data packet delivery to packet receiving module, packet receiving module can not Update Table bag, but directly packet is returned to the module of giving out a contract for a project of machine 1.
Wherein, after the module of giving out a contract for a project of step 205 machine 1 receives the packet that machine 2 returns, first packet is stored in the form of a file, the Kernel Symbol Table collected of integrating step 201 again after end, by analyzing the data message of packet, kernel can be calculated in processing data packets process, have invoked which function, and the time that each function consumes.If familiar for the processing data packets process of kernel, by checking the timestamp into queue and dequeue, the queuing delay of packet in processing procedure can also be analyzed.
3, advantage and effect
A kind of processing data packets Delay Analysis based on dynamic pitching pile technology of the present invention, it compared with prior art, its main advantage is: the processing procedure of the tracking data bag that (1) the present invention can be omnidistance, the time that in detailed analysis receives data packets and process of transmitting, each function consumes, and queue up in queue the consumed time.(2) because the transmission rate of packet is that user is controlled, the expense that effectively can control pitching pile module by regulating the transmission rate of packet and bring, therefore total system overhead is very little.(3) the present invention has good real-time and adaptability, and real-time refers to that the result of Packet Delay analysis reflects the situation of the processing data packets time delay under current environment.But along with the change of offered load, the time delay of packet also can change a lot, and the system overhead brought due to the present invention is little, even if therefore also can use, so have very strong adaptability when heavy offered load.
(4) accompanying drawing explanation
The overall framework schematic diagram of Fig. 1 processing data packets Delay Analysis of the present invention
The schematic flow sheet of Fig. 2 processing data packets Delay Analysis of the present invention
The structural representation of the packet that Fig. 3 processing data packets Delay Analysis of the present invention uses
In figure, symbol description is as follows:
201-205 step number.
(5) embodiment
Express clearly clear for making the object, technical solutions and advantages of the present invention, below in conjunction with drawings and the specific embodiments, the present invention is further described in more detail.
Main thought of the present invention uses dynamic pitching pile technology collect and record the address of function relevant to processing data packets in kernel and invoked timestamp information, again by drawing the time that each function of kernel consumes in Packet Generation and receiving course to the statistics and analysis of these information and queuing up in queue the consumed time, thus provide detailed analysis data for the network optimization.
The present invention arranges two machines, and namely machine 1 and machine 2, two machines are all real computing machines, concrete model is the perfectly sound R510 server of association, as shown in Figure 1, machine 1 and machine 2 mainly divide from the angle of function, and they can be deployed in same physical machine simultaneously.The major function of machine 1 is to provide control inerface, analyze and Output rusults, machine 1 deploy give out a contract for a project module and statistical module, the major function of machine 2 is collection information, and by the information feed back collected to machine 1, machine 2 deploy pitching pile module and packet receiving module.
The present invention requires that on software each machine adopts (SuSE) Linux OS, and the kernel of (SuSE) Linux OS on machine 2 should be 2.6.18 or version thereafter, to support kprobe technology.Concrete enforcement is roughly divided into three phases and has come, and first stage is initialization, and main work obtains Kernel Symbol Table, determines the function needing pitching pile; Second stage is in machine 2 deploy pitching pile module, owing to collecting and recording function address and timestamp; Three phases starts the bag that transmits and receive data, and carry out statistics and analysis to result, obtains a result.
Be described with an example below, as shown in Figure 2, a kind of processing data packets Delay Analysis based on dynamic pitching pile technology of the present invention, the method concrete steps are as follows:
Step 201: the Kernel Symbol Table of collecting robot 2, the method for collection be first check/whether proc/ksyms exist, if existed, then by its copy content to a file, then pass to machine 1.If there is no then check/boot catalogue under whether there is the System.map file mated with the kernel run, if had, passed to machine 1, if not, Water demand kernel file or kernel tailoring information obtain, if or can not obtain, collect the failure of kernel symbolic information.Also need the kernel symbolic information filtering out those non-functional after getting Kernel Symbol Table, thus obtain can the function list of pitching pile.
Step 202: if step 201 successfully have collected the kernel symbolic information of machine 2, then can obtain one can the function list of pitching pile, and then manually or automatically method determines the function list needing pitching pile.
Step 203: after determining the function needing pitching pile, those needed the function passes of pitching pile to machine 2, after machine 2 obtains and needs the function list of pitching pile, ensuing work is exactly need the head of the function of pitching pile to add one section of code at those, is used for recording the timestamp when address sum functions of function is called.This needs the kprobe mechanism provided by means of Linux, and kprobe mechanism can be inserted one section of code and be used for collecting the relevant information of kernel in any position of kernel.In order to the convenience of disposing can adopt SystemTap, SystemTap is a kind of script based on kprobe, and file translation can be become a C file by it, and is compiled into kernel module, adds in kernel dynamically.The code segment providing function name and needs to insert to it is only needed during use.Therefore, after getting the function list needing pitching pile, the work of pitching pile can be completed easily by SystemTap.
Step 204: start packet receiving module and module of giving out a contract for a project.After completing pitching pile work, just can to start the machine 2 packet receiving module, its can wait for the packet that come from machine 1 on certain port.After starting packet receiving module, machine 1 starts module of giving out a contract for a project, and machine 1 can send packet with certain speed to machine 2, also receives machine 2 return data bag simultaneously, and packet is stored in the form of a file, can statistics and analysis be continued below.
Step 205: will receive packet having stored with file of machine 2 in step 204, this step is exactly mainly read this file, and statistics and analysis goes out the time consumed of each function, and Output rusults.
Fig. 3 is the structural representation of the packet that processing data packets Delay Analysis of the present invention uses
It should be noted last that: above embodiment is the unrestricted technical scheme of the present invention in order to explanation only, although with reference to above-described embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that: still can modify to the present invention or equivalent replacement, and not departing from any modification or partial replacement of the spirit and scope of the present invention, it all should be encompassed in the middle of right of the present invention.
Claims (1)
1. based on a processing data packets Delay Analysis for dynamic pitching pile technology, it is characterized in that: the method concrete steps are as follows:
Step one. on machine 2, collect Kernel Symbol Table, obtain the corresponding relation of kernel function and address, export the function list that can carry out pitching pile, and pass to machine 1;
Step 2. according to the target optimized on machine 1, determine the function of Water demand, export the function list needing pitching pile, and pass to machine 2;
Step 3. be delivered on machine 2 by determined for step 2 function list, machine 2 uses dynamic pitching pile technology to insert one section of code at the head of the function needing monitoring, and this code can by the address of function and current timestamp write packet;
Step 4. start packet receiving module and module of giving out a contract for a project; Machine 1 starts to send packet, data packet delivery to machine 2 kernel after, if detect, the destination of packet is the packet receiving module of machine 2, just by the address of the current function performed and timestamp write packet; When packet arrives the packet receiving module of machine 2, packet is returned to machine 1 by packet receiving module, and the packet from machine 2 stores by the module of giving out a contract for a project of machine 1 in the form of a file;
Step 5. all packets from machine 2 receiver module added up by machine 1, calculate and export statistics;
Wherein, described machine 1 and machine 2 are real computing machines, or by the virtual virtual machine out of virtualization software, they are deployed in same physical machine simultaneously; The function of machine 1 is to provide control inerface, analyzes and Output rusults, machine 1 deploy give out a contract for a project module and statistical module, and the function of machine 2 is collection information, and by the information feed back collected to machine 1, machine 2 deploy pitching pile module and packet receiving module;
Wherein, " on machine 2, collecting Kernel Symbol Table " described in step one refers to: the symbol table collecting the kernel run, kernel function and the address of variable in internal memory is have recorded in Kernel Symbol Table, under linux system, by System.map corresponding with kernel version under reading/boot catalogue or directly read/proc/ksyms just gets Kernel Symbol Table, in addition, also by Kernel Symbol Table that analysis kernel file or kernel tailoring information obtain; Owing to not only have recorded the address in internal memory of kernel function in Kernel Symbol Table, also have recorded the address of kernel variable, therefore the Kernel Symbol Table to reading is needed to analyze, filter out the interior nuclear symbol of those non-functional, export the symbol table of all kernel function, these functions are exactly the function list that can carry out pitching pile, after determining, are passed to machine 1;
Wherein, described in step 2 " according to the target optimized on machine 1; determine the function of Water demand; export the function list needing pitching pile; and pass to machine 2 " refer to: after machine 1 receives the function list of energy pitching pile of machine 2, determine the function list needing pitching pile manually or automatically; Manually determine to need to be familiar with for kernel processes process, know which function kernel can call and carry out handle packet, the then manual function writing in files of the pitching pile formation that will need needs the function list of pitching pile; Except manually determining, also can write a little step and automatically be determined by the method for name matching;
Wherein, " being delivered on machine 2 by determined for step 2 function list; machine 2 uses dynamic pitching pile technology to insert one section of code needing the head of function of monitoring; this code can by the address of function and current timestamp write packet " described in step 3 refers to: need the head of the function of monitoring to insert after one section of code completes, first kernel can perform the code of insertion when performing this function, then perform original function; The function of the code inserted detects the current packet processed, if satisfy condition, adds after packet by the address of the current function performed and current timestamp;
Wherein, " start packet receiving module and give out a contract for a project module " described in step 4 refers to: the packet receiving module of give out a contract for a project module and the machine 2 of machine 1 is all operate in the application program under User space; Packet can be sent according to certain speed that is configured to of user to the packet receiving module of machine 2 after the module of giving out a contract for a project of machine 1 is activated, packet comprises two parts information, metamessage part have recorded packet size altogether, data message side-play amount and need the side-play amount of insertion information at present; Data message is exactly the form of a function address and timestamp, and function address and timestamp are all written to the end of data message by pitching pile module at every turn; The data information portion zero padding of the packet of the module transmission of giving out a contract for a project of machine 1, after packet arrives machine 2, timestamp when needing address and this function of kernel calls of the function of monitoring can be write the data information portion of packet by the pitching pile module being arranged in kernel, and the metamessage of Update Table bag; After data packet delivery to packet receiving module, packet receiving module can not Update Table bag, but directly packet is returned to the module of giving out a contract for a project of machine 1;
Wherein, described in step 5 " all packets from machine 2 receiver module added up by machine 1, calculate and export statistics " refer to: after the module of giving out a contract for a project of machine 1 receives the packet that machine 2 returns, first packet is stored in the form of a file, the Kernel Symbol Table collected of integrating step two again after end, by analyzing the data message of packet, calculate kernel and have invoked which function in processing data packets process, and the time that each function consumes, if to the words that the processing data packets process of kernel is familiar with, by checking the timestamp into queue and dequeue, the queuing delay of packet in processing procedure can also be analyzed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110309258.6A CN102346710B (en) | 2011-10-13 | 2011-10-13 | Dynamic stubbing technology based time-delay analysis method for data packet processing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110309258.6A CN102346710B (en) | 2011-10-13 | 2011-10-13 | Dynamic stubbing technology based time-delay analysis method for data packet processing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102346710A CN102346710A (en) | 2012-02-08 |
| CN102346710B true CN102346710B (en) | 2015-04-29 |
Family
ID=45545404
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110309258.6A Expired - Fee Related CN102346710B (en) | 2011-10-13 | 2011-10-13 | Dynamic stubbing technology based time-delay analysis method for data packet processing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102346710B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9063759B2 (en) * | 2012-03-28 | 2015-06-23 | International Business Machines Corporation | Optimizing subroutine calls based on architecture level of called subroutine |
| CN103049378A (en) * | 2012-12-18 | 2013-04-17 | 惠州市亿能电子有限公司 | Program debugging method without emulator |
| CN103365775B (en) * | 2013-06-21 | 2016-04-06 | 北京大学 | Based on the unit test method that internal state checks |
| CN105528284B (en) * | 2014-09-28 | 2018-09-28 | 华为技术有限公司 | A kind of kernel fault filling method and electronic equipment |
| CN104504333B (en) * | 2014-11-25 | 2018-03-06 | 武汉安天信息技术有限责任公司 | Malicious code detecting method and device in ELF files |
| CN104680042B (en) * | 2015-03-10 | 2017-10-24 | 北京深思数盾科技股份有限公司 | A kind of method and system of virtual machine performance analysis |
| CN106155897B (en) * | 2015-04-16 | 2020-12-08 | 腾讯科技（深圳）有限公司 | Service processing method and device |
| CN105577480B (en) * | 2016-02-01 | 2019-04-12 | 新浪网技术(中国)有限公司 | A kind of monitoring method and device being connected to the network performance |
| CN106649063B (en) * | 2016-11-22 | 2020-11-17 | 腾讯科技（深圳）有限公司 | Method and system for monitoring time-consuming data during program operation |
| CN108664372A (en) * | 2018-05-08 | 2018-10-16 | 平安科技（深圳）有限公司 | Monitoring device, method and the computer readable storage medium of test process |
| CN109558325A (en) * | 2018-12-03 | 2019-04-02 | 浪潮电子信息产业股份有限公司 | A kind of delay statistics method, apparatus and computer readable storage medium |
| CN110109673B (en) * | 2019-04-25 | 2020-10-30 | 武汉大学 | Compiler detection device and method based on Beidou subnanosecond high-precision time service |
| CN112363900B (en) * | 2020-11-16 | 2022-09-27 | 中国科学院计算技术研究所 | Host inner container network performance analysis method and system based on pile insertion |
| CN112416794B (en) * | 2020-12-03 | 2023-11-21 | 平安银行股份有限公司 | Code coverage rate processing method, device, equipment and storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101465863A (en) * | 2009-01-14 | 2009-06-24 | 北京航空航天大学 | Method for implementing high-efficiency network I/O in kernel virtual machine circumstance |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004295162A (en) * | 2003-02-04 | 2004-10-21 | I-Net Device Co Ltd | Remote monitoring system |
| CN102460408B (en) * | 2009-06-01 | 2014-08-06 | 惠普开发有限公司 | System and method for collecting application performance data |
-
2011
- 2011-10-13 CN CN201110309258.6A patent/CN102346710B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101465863A (en) * | 2009-01-14 | 2009-06-24 | 北京航空航天大学 | Method for implementing high-efficiency network I/O in kernel virtual machine circumstance |
Non-Patent Citations (1)
| Title |
|---|
| 动态跟踪系统的性能模型研究及基于动态跟踪技术的机群监测软件的设计与实现;陶捷;《中国优秀博士学位论文全文数据库》;20090315;第46页第4.4.1节-第51页第4.5节、第115页第7.6.5节-第123页第7.7.4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102346710A (en) | 2012-02-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102346710B (en) | Dynamic stubbing technology based time-delay analysis method for data packet processing | |
| Argollo et al. | COTSon: infrastructure for full system simulation | |
| CN101465863B (en) | Method for implementing high-efficiency network I/O in kernel virtual machine circumstance | |
| CN100451989C (en) | Software testing system and testing method | |
| DE112018004464T5 (en) | Technologies for programming flexible, accelerated network pipelines using eBPF | |
| CN104102543A (en) | Load regulation method and load regulation device in cloud computing environment | |
| Minkenberg et al. | Trace-driven co-simulation of high-performance computing systems using OMNeT++ | |
| CN101630285A (en) | Software performance testing method applied in embedded system | |
| CN102567203A (en) | Method and system for testing performance of distributed file system (DFS) | |
| CN102981944B (en) | A kind of log storing method based on file system | |
| CN104077328B (en) | The operation diagnostic method and equipment of MapReduce distributed system | |
| CN102929613A (en) | Adjusting and optimizing device and method for operating system | |
| CN102831046A (en) | Method and device for collecting software performance in communication system | |
| CN103856337A (en) | Resource occupation rate acquiring method, providing method, system and server thereof | |
| CN107817401A (en) | The method for testing pressure and device of a kind of power information acquisition system | |
| CN106970841A (en) | A kind of resource constraint and dynamic adjusting method based on cloud computing | |
| CN102916848A (en) | Automatic test method of Ethernet interface equipment based on script technology | |
| CN102571474B (en) | Virtualized Radius test macro and method | |
| CN111970151A (en) | Flow fault positioning method and system for virtual and container network | |
| Huang et al. | OOOPS: An innovative tool for IO workload management on supercomputers | |
| CN103645935A (en) | Device and method for adjusting JVM (java virtual machine) parameters in domestic environment | |
| CN109213566B (en) | Virtual machine migration method, device and equipment | |
| CN102043594A (en) | System and method for realizing collection and playback of input/output trace under distribution environment | |
| CN103955394A (en) | GPU (Graphic Processing Unit) virtualization optimization method based on delayed submitting | |
| CN106528411A (en) | Method and device for coverage rate detection and equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150429 Termination date: 20181013 |