Abstract:
An analysis method for carrying out an analysis for responses of a computer system including a plurality of servers, includes: obtaining data concerning a CPU utilization ratio of each of the plurality of servers from the computer system, and storing the data concerning the CPU utilization ratio into a CPU utilization ratio storage; obtaining processing history data generated in the computer system, generating data of a request frequency by users of the computer system, and storing the processing history data into a request frequency data storage; and estimating an average delay time in each server by using the CPU utilization ratio of each server, which is stored in the CPU utilization ratio storage, and the request frequency stored in the request frequency data storage, and storing the estimated average delay time into a server delay time storage. By carrying out such a processing, the analysis can be carried out without changing the computer system to be analyzed and any additional cost.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS  
       [0001]     This application is a continuing application, filed under 35 U.S.C. section 111(a), of International Application PCT/JP2004/016051, filed Oct. 28, 2004. 
     
    
     TECHNICAL FIELD OF THE INVENTION  
       [0002]     This invention relates to an analysis technique for responses in a computer system.  
       BACKGROUND OF THE INVENTION  
       [0003]     Along with development of a network service, a system to provide the service becomes complicated and large-scale. A lot of services have come to be provided by combining many servers. In such a system, it becomes very difficult to grasp how the utilization state of the resources of each server influences the response to the user.  
         [0004]     Conventionally, following two methods are known in order to investigate what ratio the delay in each server of a system having plural servers occupies for a response time the user feels. Namely, (1) a special identification tag is attached to messages transmitted and received between servers, and the delay is measured by using the tag. (2) Messages transmitted and received between servers are captured by the packet capture to analyze such information.  
         [0005]     However, the method (1) has to change the existing system and the service, and the introduction of this function is not easy. In addition, the method (2) requires an expensive equipment and a storage having a large capacity for the packet capture. Furthermore, in view of the security, the packet capture is not preferable.  
         [0006]     In addition, US-2003/0236878-A1 discloses a technique to effectively evaluate, by the limited number of experiment times, the response capability of each application under various utilization states for one or plural applications operating on an information system. More specifically, when the load injection experiment corresponding to various utilization states of the application is carried out plural times, the quantity concerning the utilization state of the application, the quantity concerning the response capability of the application, the quantity concerning the utilization state of the hardware resource and the quantity of the response capability of the hardware resource are obtained, and by creating estimate equations describing the dependence relation between the quantities, the evaluation of the response capability of the application, by using the estimate equations, is enabled. However, this technique needs the “experiment”, and the analysis cannot be carried out while carrying out a regular processing.  
       SUMMARY OF THE INVENTION  
       [0007]     Therefore, an object of this invention is to provide a technique for carrying out an analysis concerning the response of a computer system by using information that can be easily obtained from the computer system to be analyzed (hereinafter, to be monitored).  
         [0008]     An analysis method according to this invention is an analysis method for carrying out an analysis for responses of a computer system including a plurality of servers. The analysis method includes: obtaining data concerning a CPU utilization ratio of each of the plurality of servers from the computer system, and storing the data concerning the CPU utilization ratio into a CPU utilization ratio storage; obtaining processing history data generated in the computer system, generating data of a request frequency by users of the computer system, and storing the data of the request frequency into a request frequency data storage; and estimating an average delay time in each server by using the CPU utilization ratio of each server, which is stored in the CPU utilization ratio storage, and the request frequency stored in the request frequency data storage, and storing the estimated average delay time into a server delay time storage.  
         [0009]     Thus, because the processing is carried out by using data that can be easily obtained such as the CPU utilization ratio and the processing history data, the analysis processing can be carried out while reducing the introduction cost, and without causing any problem on the security.  
         [0010]     Furthermore, the aforementioned estimating may include: estimating an average consumed CPU time per one request for each server by using the CPU utilization ratio of each server, which is stored in the CPU utilization ratio storage and the request frequency stored in the request frequency data storage, and storing the average consumed CPU time into a consumed CPU time storage; and estimating an average delay time in each server by using the average consumed CPU time per one request for each server, which is stored in the consumed CPU time storage, and the CPU utilization ratio of each server, which is stored in the CPU utilization ratio storage, and storing the average delay time in each server into a server delay time storage.  
         [0011]     In addition, in the aforementioned estimating the average consumed CPU time, the average consumed CPU time per one request for each server may be estimated by carrying out a regression analysis by using the CPU utilization ratio of each server in a predesignated time range and the request frequency. Thus, by limiting to the predesignated time range, it is possible to exclude the time range when the request by the user is not processed so much and to improve the calculation accuracy.  
         [0012]     Furthermore, in the aforementioned estimating the average delay time, a pertinent coefficient value representing a relation between the average consumed CPU time per one request for the server and the average delay time in the server may be read out by referring to a matrix storage storing said coefficient values for each predetermined unit of the CPU utilization ratio, which is an element to determine the coefficient value and for each number of CPUs, and the average delay time in the server may be calculated from the coefficient value and the average consumed CPU time per one request for the server. Because the coefficient value is a function of the CPU utilization ratio and the number of CPUs, the coefficient value can be calculated each time. However, because the calculation amount is actually increased, the coefficient values may be stored in the aforementioned matrix storage in order to enhance the processing speed.  
         [0013]     In addition, this invention may further include, when the plurality of servers included in the computer system are categorized according to job types to be executed, estimating the average delay time for each category. For example, in a computer in which layers are defined, the average delay time may be calculated for each layer as the category. For example, it is to extract a problem for each job.  
         [0014]     Furthermore, this invention may further include estimating an average delay time for the entire computer system by using the data stored in the server delay time storage, and storing the average delay time for the entire computer system into a system delay time storage.  
         [0015]     In addition, this invention may further include: obtaining an average actual measurement value of a response time for a request by a user, and storing the average actual measurement value into an average actual measurement value storage; and estimating a delay time, which occurs in a portion other than the servers, by a difference between the average actual measurement value stored in the average actual measurement value storage and the average delay time of the entire computer system, which is stored in the system delay time storage. When the delay time, which occurs in the portion other than the server is shorter than the average delay time of the entire computer system, the estimation is improper because of any reasons, and it also becomes possible to detect such a case.  
         [0016]     Furthermore, this invention may further include: calculating, for each category, a correlation coefficient between a total sum of the average consumed CPU times and the request frequency, determining a confidence degree of the average delay time for each category based on the correlation coefficient, and storing the confidence degree into a confidence degree data storage; and correcting the average delay time for each category based on the confidence degree of the average delay time for each category, which is stored in the confidence degree data storage, and storing the corrected average delay time into a storage device. For example, as for the average delay time whose confidence degree is high, the average delay time is used as it is, and as for the average delay time whose confidence degree is low, the average delay time is largely corrected.  
         [0017]     Furthermore, the aforementioned correcting may include: sorting the average delay times in descending order of the confidence degree; accumulating the average delay times for each category in the descending order of the confidence degree, and identifying an order of the confidence degree at which the accumulated average delay time becomes the maximum value less than the delay actual measurement value; and correcting the delay time in a next order of the identified order of the confidence degree to a difference between the delay actual measurement value and a value obtained by accumulating the average delay times for each category in the descending order of the confidence degree up to the identified order of the confidence degree.  
         [0018]     In addition, this invention may further include: when the request frequency is experimentally changed, for example, changing the CPU utilization ratio of each server according to the changed request frequency, and storing the changed CPU utilization ratio into the storage device; estimating the average delay time for each server by using the changed CPU utilization ratio for each server, which is stored in the storage device, and storing the estimated average delay time into the storage device; and outputting the average delay time for each server before and after the change, which are stored in the server delay time storage and the storage device, in a comparable manner. It is possible to know how the delay time is changed for the change of the request frequency.  
         [0019]     In addition, this invention may further include: when the number of CPUs is experimentally changed, for example, changing the CPU utilization ratio of each server according to the changed number of CPUs, and storing the changed CPU utilization ratio into the storage device; estimating the average delay time in each server by using the changed CPU utilization ratio of each server, which is stored in the storage device, and the changed number of CPUs, and storing the estimated average delay time into the storage device; and outputting the average delay times of each server after and before the change, which are stored in the server delay time storage and the storage device, in a comparable manner. When increasing the number of CPUs, for example, it is possible to try how much the delay time is decreased, and the reasonability of the investment can be judged from the effect.  
         [0020]     This invention may further include: when the number of servers is changed, calculating an average consumed CPU time per one request for each server according to the changed number of servers, and storing the calculated average consumed CPU time into the storage device; calculating a CPU utilization ratio for each server after the change by using the number of CPUs and the average consumed CPU time per one request for each server after the change, which is stored in the storage device, and storing the calculated CPU utilization ratio into the storage device; and estimating an average delay time for each server after the change by using the average consumed CPU time per one request for each server after the change, which is stored in the storage device, and the CPU utilization ratio for each server after the change, and storing the estimated average delay time into the storage device. When the number of servers is increased, for example, it is possible to try how much the delay time is decreased, and the reasonability of the investment can be judged from the effect.  
         [0021]     Furthermore, this invention may further include estimating an average delay time for each category defined by classifying the plurality of servers in the computer system according to a job type to be executed by using the average delay time for each server after the change, which is stored in the storage device, and the changed number of servers, and storing the estimated average delay time into the storage device.  
         [0022]     Incidentally, it is possible to create a program for causing a computer to execute the aforementioned analysis method. The program is stored into a storage medium or a storage device such as a flexible disk, a CD-ROM, a magneto-optical disk, a semiconductor memory, or a hard disk. In addition, the program may be distributed as digital signals over a network in some cases. Incidentally, data under processing is temporarily stored in the storage device such as a computer memory. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0023]      FIG. 1  is a diagram showing the principle of this invention;  
         [0024]      FIG. 2  is a diagram showing the principle of this invention;  
         [0025]      FIG. 3  is a diagram to explain the entire system in an embodiment of this invention;  
         [0026]      FIG. 4A  is a functional block diagram of a delay time analysis apparatus in the embodiment of this invention;  
         [0027]      FIG. 4B  is a functional block diagram of the delay time analysis apparatus in the embodiment of this invention;  
         [0028]      FIG. 5  is a diagram showing a main processing flow of the embodiment of this invention;  
         [0029]      FIG. 6  is a diagram showing an example of obtained data;  
         [0030]      FIGS. 7A and 7B  are diagrams to explain regression calculation;  
         [0031]      FIG. 8  is a diagram to explain the reason to limit objects of the regression calculation to the business time;  
         [0032]      FIG. 9  is a diagram showing a processing flow of a confidence degree calculation processing;  
         [0033]      FIG. 10  is a diagram showing a processing flow of a correction processing of the delay time according to the confidence degree;  
         [0034]      FIGS. 11A  to  11 C are diagrams to explain a specific example of the correction processing of the delay time according to the confidence degree;  
         [0035]      FIG. 12  is a diagram showing a processing flow of an estimation processing of the delay time change at the request frequency change;  
         [0036]      FIG. 13  is a diagram showing a processing of an estimation processing of the delay time change at change of the number of CPUs;  
         [0037]      FIG. 14  is a diagram showing a processing flow of an estimation processing of the delay time change at change of the number of servers;  
         [0038]      FIG. 15  is a diagram showing an example of a processing result tabulation;  
         [0039]      FIG. 16  is a diagram showing an example of a processing result graphing; and  
         [0040]      FIG. 17  is a functional block diagram of a computer. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0000]     [Principle of this Invention] 
         [0000]     A. Derivation of a Theoretical Value Xˆ (a Symbol That ˆ is Attached on the Top of X is Also Indicated as “Xˆ”) of an Average Delay Time in a Web System Model  
         [0000]     A-1. Modeling of the Delay Time of a Single Server  
         [0041]     First, by using  FIG. 1 , it is considered that the average delay time in the single server S having plural CPUs is derived. The server S shown in  FIG. 1  has C CPUs from CPU_ 1  to CPU_C, and requests input from the outside at the request frequency λ (req/sec) are input into a queue Sw and then processed by C CPUs. At this time, the utilization ratio of the CPU is represented as ρ(%). Then, from an analysis result of the M/M/s queue mode, an average stay time T (C, λ, ρ) is as follows:  
               T   ⁡     (     C   ,   λ   ,   ρ     )       =       F   ⁡     (     C   ,   λ   ,   ρ     )       ⁢           ⁢     G   ⁡     (     C   ,   ρ     )                 (   1   )                 F   ⁡     (     C   ,   λ   ,   ρ     )       =       C   ⁢           ⁢   ρ     λ             (   2   )                 G   ⁡     (     C   ,   ρ     )       =         (       C   ⁡     (           1   -   ρ         C   C     ⁢     ρ   C         ⁢     C   !     ⁢           ⁢       ∑     r   =   0       C   -   1       ⁢         C   r     ⁢     ρ   r         i   !           +   1     )       ⁢     (     1   -   ρ     )       )       -   1       +   1             (   3   )             
 
         [0042]     From the expressions (1) to (3), the average stay time T(C, λ, ρ) in the server S satisfies the following relation. Incidentally, α represents a ratio of requests that reach the server S.  
               T   ⁡     (     C   ,     α   ⁢           ⁢   λ     ,   ρ     )       =       1   α     ⁢     T   ⁡     (     C   ,   λ   ,   ρ     )                 (   4   )             
 
 A-2. Modeling of the Delay Time in the N-Th Server Layer 
 
         [0043]     Here, by using a delay model in the single server, an average delay time of the requests in a specific single layer of plural layers is calculated.  FIG. 2  shows a system model as an assumption. In the first layer, M 1  servers S (1,1) , S (1,2) , . . . S (1,M1)  exist, in the second layer, M 2  servers S (2,1) , S (2,2) , . . . S (2,M2)  exist, and further in the n-th layer, M N  servers S (N,1) , S (N,2) , . . . s (n, MN)  exist. In addition, α n  represents a ratio of requests that reach the n-th layer, and when the requests are evenly assigned to servers in each layer, and the requests are input at the request frequency λ all  (req/sec) to this system, λ all /M 1  requests are input into each server in the first layer, the requests leaving from the first layer is (1−α 2 )λ all , α 2 λ all /M 2  requests are input to each server of the second layer, the requests leaving from the second layer is (α 2 -α 3 ) λ all , the request leaving from the (N-1)-th layer is (α N-1 -α N ) λ 11 , α N λ all /M N  requests are input to each server of the N-th layer, and the requests output from the N-th layer are α N λ all . Incidentally, 1≦n≦N, and 1≦m≦M n .  
         [0044]     Different roles such as a Web server used as a front end for the user, an application server for dynamically processing the requests and the like are respectively assigned to each layer.  
         [0045]     Then, when the request frequency to the n-th layer server S (n,m)  is λ (n,m) , the average delay time in the server S (n,m)  can be represented by T(C (n,m) , λ (n,m) , ρ (n,m) . In addition, when the total sum of the requests input into the n-th layer is α n λ all , and those are evenly assigned to M n  servers, the following expressions are satisfied.  
         λ     (     n   ,   m     )       =         α   n       M   n       ⁢     λ   all           
 
         [0046]     Because the requests are evenly assigned to each server, the average delay time W, of all the requests in the n-th layer is an average of the average delay times of all the servers existing in the n-th layer.  
               W   n     =       1     M   n       ⁢       ∑     i   =   1       M   n       ⁢     T   ⁡     (       C     (     n   ,   i     )       ,     λ     (     n   ,   i     )       ,     ρ     (     n   ,   i     )         )                   (   5   )             
 
         [0047]     Here, W n  is represented by using the expressions (1) to (4) as follows:  
                     W   n     =       1     M   n       ⁢       ∑     i   =   1       M   n       ⁢     T   ⁡     (       C     (     n   ,   i     )       ,     λ     (     n   ,   i     )       ,     ρ     (     n   ,   i     )         )                       =       1     M   n       ⁢       ∑     i   =   1       M   n       ⁢     T   ⁡     (       C     (     n   ,   i     )       ,         α   n       M   n       ⁢     λ   all       ,     ρ     (     n   ,   i     )         )                       =       1     α   n       ⁢       ∑     i   =   1       M   n       ⁢       T   ⁡     (       C     (     n   ,   i     )       ,     λ   all     ,     ρ     (     n   ,   i     )         )       .                       (   6   )             
 
         [0048]     Here, in order to simplify the notation, H n  is defined as follows:  
               H   n     =       ∑     i   =   1       M   n       ⁢     T   ⁡     (       C     (     n   ,   i     )       ,     λ   all     ,     ρ     (     n   ,   i     )         )                 (   7   )             
 
 A-3. Modeling of the Delay Time in the Entire System 
 
         [0049]     Here, by using the delay model in each layer, the modeling of the delay time in the entire system is carried out. After the servers from the first layer to the n-th layer are used, the number R n  of requests leaving from the system among all the requests is as follows: 
 
 R   n =(α n -α n+1 )λ all (α 1 =1 , α N+1 =0)  (8) 
 
         [0050]     In addition, after the servers from the first layer to the n-th layer are used, the average delay L n  of the requests leaving from the system is as follows:  
               L   n     =       ∑     i   =   1     n     ⁢     W   i               (   9   )             
 
         [0051]     In addition, the following relation is satisfied from the definition. 
 
 L   n   −L   n−1   =W   n   (10) 
 
         [0052]     Because the average delay time Xˆ per one request is represented by the product of the delay for requests leaving from the system after the servers from the first layer to the i-th layer are used and a ratio of the requests for all the requests, the average delay time Xˆ is represented as follows:  
                     X   ^     =       1     λ   all       ⁢       ∑     i   =   1     N     ⁢       R   i     ⁢     L   i                       =       ∑     i   =   1     N     ⁢       (       α   i     -     α     i   +   1         )     ⁢     L   i                     =         (       α   1     -     α   2       )     ⁢     L   1       +       (       α   2     -     α   3       )     ⁢     L   2       +   …   +       (       α   N     -     α     N   +   1         )     ⁢     L   N                     =         α   1     ⁢     L   1       +       α   2     ⁡     (       L   2     -     L   1       )       +   …   +       α   N     ⁡     (       L   N     -     L     N   -   1         )       -       α     N   +   1       ⁢     L   N                     =         α   1     ⁢     W   1       +       α   2     ⁢     W   2       +   …   +       α   N     ⁢     W   N                     =       ∑     n   =   1     N     ⁢     H   n                     (   11   )             
 
         [0053]     As the aforementioned results, when considering the average delay time of all the requests, H, represents the delay, which occurs in each layer, and it can be said that its total sum Xˆ represents the average delay time in the entire system for all the requests.  
         [0000]     [Specific Processing] 
         [0054]      FIG. 3  shows an outline of a system including a monitor target system  100  and a delay analysis apparatus  120 . The monitor target system  100  is connected with a network, and has an n-layer configuration (in  FIG. 3 , two layers to simplify the explanation) as shown in  FIG. 2 . In each layer, load distribution apparatuses  101  and  102  are provided, and the load distribution apparatuses almost evenly assign the requests to servers S (1,1) , S (1,2)  and S (1,M1)  and servers S (N,2)  and S (N, MN)  in each layer. For the servers of the first layers, a server log  111   a  is provided, the log data generated when the processing for the request is carried out is stored. In addition, in each server, Central Processing Unit (CPU) utilization ratio obtaining units  112   a  and  112   b  are provided, and in this embodiment, the CPU utilization ratio is obtained by % unit. These CPU utilization ratio obtaining units  112   a  and  112   b  are general tools executed by a command such as sar, mpstat and iostat in UNIX (Registered Trade Mark) Operating System (OS) and the like, and a lot of recent OS have the similar function.  
         [0055]     The delay analysis apparatus  120  is connected with the monitor target system  100 , and carries out a processing by using the log data stored in the server log  111   a  and the CPU utilization ratio. Thus, different from the conventional arts, because there is no need to install any special mechanism into the monitor target system  100 , the introduction of the delay analysis apparatus  120  is easy, and furthermore, because all the packets processed in the monitor target system  100  do not have to be analyzed, there is no need to use a storage having a large capacity, and the problem on the security does not occurs easily. The delay analysis apparatus  120  is connected to an input/output unit  121  such as a display device, mouse, keyboard and the like.  
         [0056]      FIGS. 4A and 4B  show functional block diagrams of the delay analysis apparatus  120 . The delay analysis apparatus  120  has a request frequency obtaining unit  1201 , a CPU utilization ratio obtaining unit  1202 , a log data storage  1203 , a request frequency storage  1204 , a delay actual measurement value storage  1205 , a CPU utilization ratio storage  1206 , a system configuration data storage  1207 , a CPU time calculator  1208 , a CPU time storage  1209 , a performance prediction processor  1213 , a server delay time calculator  1210 , a G table storage  1211 , a server delay time storage  1214 , a layer delay time calculator  1215 , a layer delay time storage  1216 , a system delay time calculator  1217 , a system delay time storage  1218 , a remaining delay time calculator  1219 , a remaining delay time storage  1220 , a confidence degree calculator  1221 , a confidence degree storage  1222 , a delay time corrector  1223 , and a corrected delay time storage  1224 .  
         [0057]     The request frequency obtaining unit  1201  receives the log data from the server log  111   a  of the monitor target system  100 , and stores the log data into the log data storage  1203 , and processes the log data stored in the log data storage  1203  to calculate a request frequency (req/sec), and stores the request frequency into the request frequency storage  1204 . In addition, the request frequency obtaining unit  1201  processes the log data stored in the log data storage  1203  to calculate an average delay actual measurement value, and stores the average delay actual measurement value into the delay actual measurement value storage  1205 . The CPU utilization obtaining unit  1202  obtains data of a CPU utilization ratio from the CPU utilization ratio obtaining unit  112  of the monitor target system  100   r  and stores the data into the CPU utilization ratio storage  1206 .  
         [0058]     The CPU time calculator  1208  refers to the request frequency storage  1204 , the CPU utilization ratio storage  1206  and the system configuration data storage  1207  to calculate a consumed CPU time per one request, and stores the calculated data into the CPU time storage  1209 . The server delay time calculator  1210  refers to the CPU time storage  1209 , the G table storage  1211  and the CPU utilization ratio storage  1206  to calculate a delay time for each server, and stores the calculated data into the server delay time storage  1214 . Incidentally, the server delay time calculator  1210  may refer to the request frequency storage  1204  and the system configuration storage  1207  when the G table storage  1211  is not referenced.  
         [0059]     Furthermore, the layer delay time calculator  1215  refers to the server delay time storage  1214  and the system configuration data storage  1207  to calculate the delay time for each layer, and stores the calculated data into the layer delay time storage  1216 . The system delay time calculator  1217  refers to the layer delay time storage  1216  and the system configuration data storage  1207  to calculate the delay time of the entire system, and stores the calculated data into the system delay time storage  1218 . The remaining delay time calculator  1219  refers to the delay actual measurement value storage  1205  and the system delay time storage  1218  to calculate a remaining delay time consumed by other apparatuses other than the servers, and stores the calculated data into the remaining delay time storage  1220 .  
         [0060]     In addition, the confidence degree calculator  1221  refers to the remaining delay time storage  1220 , the system configuration data storage  1207 , the delay actual measurement value storage  1206 , the request frequency storage  1204 , the CPU utilization ratio storage  1206  and the layer delay time storage  1216 , and when the remaining delay time consumed by other apparatuses other than the servers is less than 0, the confidence degree calculator  1221  calculates a confidence degree for the delay time of each layer, and stores the calculated confidence degree data into the confidence degree storage  1222 . The delay time corrector  1223  refers to the layer delay time storage  1216  and the confidence degree storage  1222  to correct the delay time for each layer, and stores data of the corrected delay time into the corrected delay time storage  1224 .  
         [0061]     The performance prediction processor  1213  carries out a processing by using the CPU utilization ratio storage  1206 , the system configuration data storage  1207 , the CPU time storage  1209  and the request frequency storage  1204 .  
         [0062]     Incidentally, the input/output unit  121  can output the data in the respective storages in the delay analysis apparatus  120  to the display device or the like.  
         [0063]     Next, the processing content of the system shown in  FIGS. 3, 4A  and  4 B will be explained with reference to FIGS.  5  to  16 . First, the request frequency obtaining unit  1201  obtains the log data from the server log  111   a  of the monitor target system  100 , and stores the log data into the log data storage  1203 , and the CPU utilization ratio obtaining unit  1202  obtains data of the CPU utilization ratio from the CPU utilization ratio obtaining unit  112  of the monitor target system  100 , and stores the data of the CPU utilization ratio into the CPU utilization ratio storage  1206  ( FIG. 5 : step S 1 ).  
         [0064]     An example of the log data stored in the log data storage  1203  is shown below.  
         [0000]     “192.168.164.108−−[14/Sep/2004:12:27:50+0900] “GET/˜hoge/SSSS/SSSS — 20040816.pdfHTTP/1.1” 200 147067 “−” “Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; .NET CLR 1.1.4322)”  0.053”(Windows is the Registered Trade Mark.)    
         [0065]     This is an example of a log picked in a custom log format in the Apache Web server. Generally, the logs are stored as the server log  111   a  under a directory /var/log/httpd/ of the Web server included in the monitor target system  100  or the like. This first section “192.168.164.108” represents an IP address of an access source client. The second and third sections are omitted. The fourth section “[14/Sep/2004:12:27:50+0900]” represents an access time. The fifth section “GET/˜hoge/SSSS/SSSS_ 20040817 .pdf HTTP/1.1” represents an access content. The sixth section “200” represents the status (here, normal). The seventh section “147067” represents the number of transmitted and received bytes. The eighth section “−” represents a URL path requested. The ninth section “Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; .NET CLR 1.1.4322)” represents a browser used in the access source client. The tenth section “0.053” represents a time (sec) consumed to handle the request.  
         [0066]     Next, the input/output unit  121  accepts setting inputs of a period to be analyzed and a business time range, and stores the setting inputs into a storage device such as a main memory (step S 3 ). The business time range means that a time range that the CPU time the server consumes for a processing other than requests from the users is few. By designating the business time range, it is possible to reduce an estimation error caused by consuming, by the server, the large CPU time when the request is few such as night.  
         [0067]     Then, the request frequency obtaining unit  1201  reads out the log data in the designated period to be analyzed and the business time range from the log data storage  1203 , and counts the requests processed for each one hour, for example, and divides the count value by 3600 seconds (=one hour) to calculate the request frequency λ per one second (req/sec), and stores the request frequency into the request frequency storage  1204 . In addition, the request frequency obtaining unit  1201  adds the time consumed to handle all the requests every one hour, for example, and divides the added time by the number of requests to calculate an average delay actual measurement value, and stores the average delay actual measurement value into the delay actual measurement value storage  1205 . Furthermore, the CPU utilization ratio calculator  1208  calculates an average CPU utilization ratio ρ i   (n,m)  of each server S (n,m)  for each one hour based on data of the CPU utilization ratio stored in the CPU utilization ratio storage  1206 , and stores the average CPU utilization ratio ρ i   (n,m)  into the CPU utilization ratio storage  1206  (step S 5 ). When one server has plural CPUs, an average CPU utilization ratio of the plural CPUs is calculated to obtain the CPU utilization ratio of the server. Incidentally, i in the average CPU utilization ratio ρ i   (n,m)  represents the i-th unit time (here, for each one hour). In addition, hereinafter, the word “average” may be omitted.  
         [0068]     When the processing result until here is summarized, it is as shown in  FIG. 6 , for example. In an example of  FIG. 6 , for each time range, the unit time number i, the request frequency λ i (req/sec), the delay actual measurement value A i , the CPU utilization ratio ρ i   (1,1) , ρ i   (1,2) , ρ i   (2,1)  and ρ i   (3,1)  are shown.  
         [0069]     Next, the CPU time calculator  1208  refers to the request frequency storage  1204 , the CPU utilization ratio storage  1206  and the system configuration data storage  1207  to calculate a consumed CPU time per one request, and stores the consumed CPU time into the CPU time storage  1209  (step S 7 ). In order to calculate the delay time, which occurs in each server, first, it is necessary to calculate how long the CPU time per one request is consumed in each server for the request frequency λ i  (req/sec) input from the outside to the entire system. However, when the average consumed CPU time per one request is calculated, as a following expression, by simply dividing the product of the CPU utilization ratio ρ i   (n,m)  of the server S (n,m)  in the unit time i and the number C (n,m)  of CPUs by request frequency λ i , the following problem occurs.  
               F   ⁡     (       C     (     n   ,   m     )       ,     λ   i     ,     ρ     (     n   ,   m     )     i       )       =         C     (     n   ,   m     )       ⁢     ρ     (     n   ,   m     )     i         λ   i               (   12   )             
 
 That is, in the server, generally, a few CPU time other than the processing of the request is consumed by the maintenance and the like of the system. When the request frequency is extremely small, because the ratio of such a CPU time becomes relatively large, the consumed CPU time per one request is estimated to be large and an error may be caused. That is, when, as shown in  FIG. 7A , the horizontal axis represents the request frequency, and the vertical axis represents the CPU utilization ratio, and the expression (12) is interpreted as it is, the CPU utilization ratio must be “0” when there is no request. Then, when the inclination of the straight line connecting the origin with each measurement point is handled as the consumed CPU time per one request, the large difference occurs. 
 
         [0070]     In order to solve this problem, it is supposed that the consumed CPU time per one request 1/μ (n,m)  is represented as follows:  
                 ρ     (     n   ,   m     )     i     ⁢     C     (     n   ,   m     )         =         1     μ     (     n   ,   m     )         ⁢     λ   i       +     α     (     n   ,   m     )                 (   13   )             
 
 Then, the consumed CPU time per one request 1/μ (n,m)  is calculated by the regression analysis, and the approximation is carried out by the following expression.  
         F   ⁡     (       C     (     n   ,   m     )       ,     λ   i     ,     ρ     (     n   ,   m     )     i       )       ≈     1     μ     (     n   ,   m     )             
 
         [0071]     As shown in  FIG. 7B , when the regression calculation is carried out, it is possible to calculate the inclination of the regression straight line connecting each measurement point as the consumed CPU time per one request, and obtain an actually closer value.  
         [0072]     Incidentally, when the regression calculation is carried out, only data within the business time range designated by the user is used. In a case where all data in the period to be analyzed is used, when the batch processing or the like is carried out during the night in which the number of requests is small, and a phenomenon that a large CPU time is consumed occurs, a phenomenon that the CPU utilization ratio in a case where the number of requests is small is higher than one in a case where the number of requests is large occurs. Then, there is possibility that a large error in the estimation of the consumed CPU time per one request by using the regression calculation is caused. As shown in  FIG. 8 , when measurement points by the night batch processing are represented by black circles, the black circles are plotted in an upper area of the vertical axis because the CPU utilization ratio becomes high though the request frequency is small. Therefore, when the regression calculation is carried out together with the measurement points (represented by white circles) for a daytime request processing, there is a case where the regression straight line like a solid line is obtained. On the other hand, when only the measurement points for the daytime request processing are used, a proper regression straight line whose inclination is positive like a dotted line is obtained. Therefore, the data should be narrowed to the business time range.  
         [0073]     The aforementioned regression calculation is described in detail. When drawing a straight line like an expression (13) for data (CPU utilization ratio ρ (n,m) , the number C (n,m)  of CPUs, which is the system configuration data, and the request frequency λ i ) in the business time range designated by the user among data in the period to be analyzed, the inclination 1/μ (n,m)  and an intercept α (n,m)  are calculated by the least-square method so that the deviation becomes the least, and stored into the CPU time storage  1209 . However, when α (n,m)  becomes negative, because the possibility that the inclination is excessively estimated is high, the intercept is set to “0”, and 1/μ (n,m)  is calculated by carrying out the regression analysis as the following straight line again.  
           ρ     (     n   ,   m     )     i     ⁢     C     (     n   ,   m     )         =       1     μ     (     n   ,   m     )         ⁢     λ   i           
 
         [0074]     In addition, when the inclination 1/μ (n,m)  becomes negative, it is judged that the average delay time per one request in the server cannot be analyzed, and a code representing it cannot be analyzed is stored into the CPU time storage  1209 . When such a code is stored, the average delay time, which occurs in the layer in which the server is included, cannot be also analyzed.  
         [0075]     Returning to the explanation of  FIG. 5 , next, the server delay time calculator  1210  refers to the CPU utilization ratio storage  1206 , the system configuration data storage  1207 , the CPU time storage  1209  and the G table storage  1211  to calculate an average delay time per one request, which occurs in each server, and stores the calculated value into the server delay time storage  1214  (step S 9 ). In the i-th unit time, the average delay time T i   (n,m)  per one request, which occurs in each server, is given by the following expression.  
               T     (     n   ,   m     )     i     =       T   ⁡     (       C     (     n   ,   m     )       ,     λ   i     ,     ρ     (     n   ,   m     )     i       )       ≈       1     μ     (     n   ,   m     )         ⁢     G   ⁡     (       C     (     n   ,   m     )       ,     ρ     (     n   ,   m     )     i       )                   (   14   )             
 
 However, when ρ=0, G(C, 0)=1. 
 
         [0076]     Here, although 1/μ (n,m)  represents the consumed CPU time per one request, this is equal to the average delay time, which occurs when the load is 0%. Then, when the load is p, it means that the delay becomes G(C, ρ) times of a case when the load is 0%.  
         [0077]     G(C, ρ) is calculated by the number of CPUs and the CPU utilization ratio of the server, as shown in the expression (3). However, because it takes relatively long time to calculate the expression (3) as it is, when the grain size of the analysis has been determined, it is possible to calculate G(C, ρ) in advance by changing the number of CPUs and the CPU utilization ratio of the server. For example, when the grain size of the analysis is enough in 1% unit for the CPU utilization ratio and the assumed number of CPUs per one server is equal to or less than 50, G(C, ρ) is calculated in advance in respective cases of the CPU utilization ratio from 0 to 99% (1% interval) and the number of CPUs in the server from 1 to 50, and they are stored in the G table storage  1211  as a matrix 100×50. Then, when obtaining the number of CPUs from the system configuration data storage  1207 , and obtaining the CPU utilization ratio from the CPU utilization ratio storage  1206 , a value of G(C, ρ) can be obtained from the G table storage  1211 .  
         [0078]     Finally, the average delay time T i   (n,m)  per one request, which occurs in each server, (hereinafter, also called as the average delay time of each server, simply) is calculated according to the expression (14), and stored into the server delay time storage  1214 .  
         [0079]     Next, the layer delay time calculator  1215  refers to the server delay time storage  1214  and the system configuration data storage  1207  to calculate the delay time L i   n  in each layer, and stores the delay time into the layer delay time storage  1216  (step S 11 ). The delay time L i   n , in each layer is the sum of the average delay times of the servers for each layer. M n  is obtained from the system configuration data storage  1207 .  
         L   n   i     =       ∑     m   =   1       M   n       ⁢     T     (     n   ,   m     )     i           
 
         [0080]     Then, the system delay time calculator  1217  refers to the layer delay time storage  1216  and the system configuration data storage  1207  to calculate the delay time D i  of the entire system, and stores the delay time into the system delay time storage  1218  (step S 13 ). The delay time D i  of the entire system is the sum of the delay times L i   n  in each layer n, and is represented as follows: 
 
 N is obtained from the system configuration data storage  1207 .  
         D   i     =       ∑     n   =   1     N     ⁢     L   n   i           
 
         [0081]     After that, the remaining delay time calculator  1219  refers to the delay actual measurement value storage  1205  and the system delay time storage  1218  to calculate the delay time E i  consumed in the portion other than the server, and stores the delay time into the remaining delay time storage  1220  (step S 15 ). The delay time E i  is a difference between the delay time D i  of the entire system and the delay actual measurement value A i , and is calculated as follows:  
         E   i     =     {             A   i     -     D   i             (       A   i     ≥     D   i       )             0         (       A   i     &lt;     D   i       )                 
 
         [0082]     A i &lt;D i  means that the aforementioned estimation result is not proper, and in such a case, E i =0 is set.  
         [0083]     Then, in order to correct the delay time mainly in a case of E i =0, the confidence degree calculator  1221  refers to the remaining delay time storage  1220 , the layer delay time storage  1216 , the system configuration data storage  1207 , the request frequency storage  1204 , the CPU utilization ratio storage  1206  and the delay actual measurement value storage  1205  to carry out a calculation processing of the confidence degree of the average delay time for each layer, and stores the processing result into the confidence degree storage  1222  (step S 17 ). This processing is explained by using  FIG. 9 . First, the confidence degree calculator  1221  calculates a correlation coefficient between the total sum ρ of the consumed CPU times of the n-th layer and the request frequency λ as an initial confidence degree R i   n  of the average delay time of each layer n, and stores the correlation coefficient into the confidence degree storage  1222  (step S 31 ). When a function to calculate the correlation coefficient is represented by “correl”, the confidence degree R i   n  is calculated according to the following expression.  
               R   n   i     =     correl   (         ∑     m   =   1       M   n       ⁢       C     (     n   ,   m     )       ⁢     ρ     (     n   ,   m     )           ,   λ     )             (   15   )             
 
 The first item of the correl function in the expression (15) is the total sum of the consumed CPU time in the n-th layer. Incidentally, because the correlation coefficient is also used for the later calculation, that is held for each layer. 
 
         [0084]     Then, the confidence degree calculator  1221  judges whether or not the correlation coefficient R i   n  is negative (step S 33 ). In a case of the correlation coefficient &lt;0, the confidence degree calculator  1221  sets the confidence degree R i   n =0 (step S 37 ). This is because it is assumed that the positive correlation exists between the consumed CPU time and the request frequency, and there is no meaning for the negative correlation. On the other hand, in a case of the correlation coefficient ≧0, the confidence degree calculator  1221  judges whether or not the estimated delay time D i  of the entire system is longer than the average delay actual measurement value A i  (step S 35 ). When D i &gt;A i  is satisfied, the processing shifts to step S 37  because impossible estimation is made and the calculated delay time itself has the low confidence. That is, the confidence degree calculator  1221  sets the confidence degree R i   n =0. On the other hand, in a case of D i ≦A i , the correlation coefficient calculated at the step S 31  is used as the confidence degree as it is.  
         [0085]     Returning to the explanation of  FIG. 5 , the delay time corrector  1223  refers to the confidence degree storage  1222  and the layer delay time storage  1216  to correct the delay time according to the confidence degree, and stores the corrected delay time into the corrected delay time storage  1224  (step S 19 ). Incidentally, in a case of A i ≧D i , this step is skipped. This processing will be explained by using  FIG. 10 . First, the delay time corrector  1223  refers to the layer delay time storage  1215  and the confidence degree storage  1222  to sort the delay time of each layer in descending order of the confidence degree, and stores the sorting result into the correct delay time storage  1224  (step S 41 ). Incidentally, when plural layers whose confidence degree is “0” exist, the delay time is sorted in descending order of those correlation coefficients.  
         [0086]     Then, the delay time corrector  1223  adds the delay time of the layer in descending order of the confidence degree according to the sorting result, and identifies an order B of the confidence degree at which the added value becomes the maximum value less than the average delay actual measurement value (step S 43 ). Here, it is assumed that P x =n represents the order of the confidence degree R i   n  of the n-th layer is the x-th from the top. Then, R i   Px &gt;R i   Px+1  is always satisfied. Then, at the step S 43 , the maximum y satisfying the following expression is calculated. This is B.  
         A   i     &gt;       ∑     x   =   1     y     ⁢     L     P   x     i           
 
         [0087]     It is unnecessary to correct the delay time of the layer whose confidence degree is one of 1st to B-th, which was calculated as described above. Therefore, the delay time corrector  1223  corrects the delay time of the layer whose confidence degree is the (B+1)-th as follows: (step S 45 ). That is, the estimated delay time L i   Px+1  of the (P B+1 )-th layer is corrected, and the result is L′ i   Px+1 . The correction result and the delay times of the layers, which is unnecessary to correct (layers whose confidence degree is one of 1st to B-th), are stored into the corrected delay time storage  1224 .  
         L     P     B   +   1         ′   ⁢           ⁢   i       =       A   i     -       ∑     x   =   1     B     ⁢     L     P   x     i             
 
 This expression represents that the delay time of the layer whose confidence degree is the (B+1)-th so that the delay actual measurement value is equal to the total sum of the delay times (estimated average value) from the top of the confidence degree to the (B+1)-th among the confidence degree of each layer. 
 
         [0088]     In addition, the delay time corrector  1223  corrects the confidence degree of the layer whose confidence degree is the (B+1)-th as follows (step S 47 ). That is, the delay time corrector  1223  corrects the confidence degree R i   Px+1  of the (P B+1 )-th layer, and uses the result as R′ i   Px+1 . The correction result and the confidence degree data of the layers, which are unnecessary to correct, (layers whose confidence degree is one of 1st to B-th) is stored into the corrected delay time storage  1224 .  
         R     B   +   1       ′   ⁢           ⁢   i       =       L     P     B   +   1         ′   ⁢           ⁢   i         L     P     B   +   1       i           
 
 This expression represents that the confidence degree is corrected so that the smaller the difference between the delay time before the correction and the delay time after the correction is, the higher the confidence degree becomes. 
 
         [0089]     Furthermore, the delay time corrector  1223  corrects the delay time and the confidence degree of the layer whose confidence degree is the (B+2)-th or the subsequent as follows (step S 49 ). The correction result is stored into the corrected delay time storage  1224 . 
 
 L′   i   Pn =0 ( n&gt;B+ 1) 
 
 R′   i   Pn =0 ( n&gt;B+ 1) 
 
         [0090]     A specific example of this correction processing will be explained by using  FIGS. 11A  to  11 C. First,  FIG. 11A  indicates the delay time estimation result and the actual measurement result. The first layer of the monitor target system  100  in this example is a Web server, and the second layer is an application server, and the third layer is a DB server. Here, the estimated delay time of the first layer is 150 m seconds, the correlation coefficient is 0.9, and the confidence degree is 0. The estimated delay time of the second layer is 60 m seconds, the correlation coefficient is 0.85, and the confidence degree is 0.85. The estimated delay time of the second layer is 30 m seconds, the correlation coefficient is 0.6, and the confidence degree is 0.6. Incidentally, the average delay actual measurement value is 100 m seconds.  
         [0091]     Then, when the sorting is carried out at the step  541 , as shown in  FIG. 11B , the layers are arranged in order of the second layer, the third layer and the first layer, the delay time of the entire system apparently exceeds the average delay actual measurement value, and the estimated delay time of the entire system exceeds on the way of the first layer.  
         [0092]     Therefore, as shown in  FIG. 11C , as for the second and third layers, the delay times and the confidence degrees are used as they are, and the estimated delay time of the first layer is decreased to the difference between the average delay actual measurement value and the sum of the delay times of the second and third layers, and 10 m seconds is obtained. Moreover, the confidence degree is also corrected to 0.06(=10/150).  
         [0093]     By carrying out such a processing, the correction so as to fit the estimated value to the actual measurement value is carried out.  
         [0094]     Returning to the explanation of  FIG. 5 , the input/output unit  121  carries out an output processing (step S 21 ). Data the input/output unit  121  outputs includes (1) the estimated value T i   (n,m)  of the delay time, which occurs in each server, (2) the estimated value L i   n  of the delay time, which occurs in each layer, (3) the estimated value D i  of the delay time, which occurs in the entire system, (4) the delay time E i  of the portion other than the servers, (5) the confidence degree of the delay time of each layer and the like. In a case of the confidence degree, the value itself may be output, and the confidence degree R i   n  may be categorized into three levels described below, for example, and the categorization result may be output. That is, if R i   n &gt;0.7, the confidence degree is “high”, if 0.7≧R i   n &gt;0.3, the confidence degree is “middle”, and if 0.3≧R i   n , the confidence degree is “low”.  
         [0095]     The categorization of the confidence degree such as “high”, “middle” and “low”, which is described above, is based on values generally used for the judgment of the correlation strength in the correlation coefficient. That is, generally, when the absolute value of the correlation coefficient is equal to or greater than 0.7, it is judged that there is strong correlation between two parameters, when it is within a range from 0.3 to 0.7, it is judged that there is weak correlation, and when it is equal to or less than 0.3, it is judged that there is almost no correlation. This is because the square of the correlation coefficient is an explanatory rate of the variance. Then, when the correlation coefficient is 0.7, the explanatory rate is 0.49 (about 50%). That is, about a half of the variance of the dependent variable can be explained by the explanatory variable. In addition, when the correlation coefficient is 0.3, the explanatory rate is 0.1 (about 10%), and because the variance caused by the explanatory variable among the variance of the dependent variable is only about 10%, it is judged that there is almost no correlation between the explanatory variable and the dependent variable.  
         [0096]     Similarly considering in this embodiment, when the correlation coefficient is equal to or greater than 0.7, there is enough correlation between the CPU utilization ratio and the request frequency, and because the consumed CPU time per one request can be appropriately estimated, it is considered that the confidence degree becomes high. In addition, when the guidance of the relation between this confidence degree and the prediction error is obtained from the experimental result in the experiment environment, the possibility is high in which the prediction error is about within ±50% in a case of the confidence degree “high”, the prediction error is about within ±100% in a case of the confidence degree “middle”, and the prediction error is greater than ±100% in a case of the confidence degree “low”. However, this result is mere guidance based on the experimental result after all, and the aforementioned accuracy (error range) is not secured.  
         [0097]     By carrying out such a processing as described above, it becomes possible to calculate the delay times of each server, each layer and the entire system by using the elements, which already exist in the monitor target system  100 . In addition, it is possible to correct the delay time from the relation with the delay actual measurement value, and further present the confidence degree for the user.  
         [0098]     Next, the performance prediction using the aforementioned model will be explained.  
         [0099]     First, the estimation of the delay time change at the request frequency change will be explained by using  FIG. 12 . Here, it is assumed that at a certain time i, the request frequency is λ, and the estimated average delay time will be calculated when the request frequency changes from λto λ′. Namely, λ′ is input from the input/output unit  121 , and the performance prediction processor  1213  of the delay analysis apparatus  120  accepts the input (step S 50 ). Then, the performance prediction processor  1213  changes the CPU utilization ratio ρ for all the servers S (n,m)  according to the request frequency change, and stores the changed CPU utilization ratio into the CPU utilization ratio storage  1206  (step S 51 ). The CPU utilization ratio ρis changed to ρ′ described below. In addition, the server delay time calculator  1210  calculates the delay time T′ i   (n,m)  of each server after the change by using the CPU utilization ratio ρ′ after the change, and stores the calculated delay time into the server delay time storage  1214  (step S 53 ). The calculations at the steps S 51  and S 53  are as follows:  
         ρ     (     n   ,   m     )       ′   ⁢           ⁢   i       =       ρ     (     n   ,   m     )     i     +         λ   ′     -   λ         μ     (     n   ,   m     )       ⁢     C     (     n   ,   m     )                 
         T     (     n   ,   m     )       ′   ⁢           ⁢   i       =       1     μ     (     n   ,   m     )         ⁢     G   ⁡     (       C     (     n   ,   m     )       ,     ρ     (     n   ,   m     )       ′   ⁢           ⁢   i         )             
 
         [0100]     Then, the layer delay time calculator  1215  calculates the delay time in each layer after the change by using the delay time T′ i   (n,m)  of each server after the change, which is stored in the server delay time storage  1214 , and stores the calculated delay time into the layer delay time storage  1216  (step S 55 ). Furthermore, the system delay time calculator  1217  calculates the delay time of the entire system after the change by using the delay time in each layer after the change, which is stored in the layer delay time storage  1216 , and stores the calculated delay time into the system delay time storage  1218  (step S 57 ).  
         [0101]     After that, the input/output unit  121  outputs each delay time and the like before and after the change (step  559 ). Thus, the user can investigate the change of the delay time according the change of the request frequency.  
         [0102]     Next, the performance prediction at the change of the number of CPUs will be explained by using  FIG. 13 . Here, the number of CPUs of the server S (n,m)  is changed from C (n,m)  to C′ (n,m) . Therefore, the number C′ (n,m)  of CPUs is input from the input/output unit  121 , and the performance prediction processor  1213  of the delay analysis apparatus  120  accepts the input (step S 61 ). Then, the performance prediction processor  1213  changes the CPU utilization ratio ρ according to the change of the number of CPUs, and stores the changed CPU utilization ratio into the CPU utilization ratio storage  1206  (step S 63 ). The CPU utilization ratio ρ is changed only for the server in which the number of CPUs is changed, as follows. In addition, the server delay time calculator  1210  calculates the delay time T′ i   (n,m)  of each server in which the number of CPUs is changed by using the CPU utilization ratio ρ′after the change, and stores the delay time into the server delay time storage  1214  (step S 65 ). The calculations at the steps S 63  and S 65  are as follows:  
         ρ     (     n   ,   m     )       ′   ⁢           ⁢   i       =         C     (     n   ,   m     )         C     (     n   ,   m     )     ′       ⁢     ρ     (     n   ,   m     )     i           
         T     (     n   ,   m     )       ′   ⁢           ⁢   i       =       1     μ     (     n   ,   m     )         ⁢     G   ⁡     (       C     (     n   ,   m     )     ′     ,     ρ     (     n   ,   m     )       ′   ⁢           ⁢   i         )             
 
         [0103]     Then, the layer delay time calculator  1215  calculates the delay time in the layer relating to the change by using the delay time T′ i   (n,m)  of the server after the changer which is stored in the server delay time storage  1214 , and stores the calculated delay time into the layer delay time storage  1216  (step S 67 ). Furthermore, the system delay time calculator  1217  calculates the delay time of the entire system after the change by using the delay time in each layer, which is stored in the layer delay time storage  1216 , and stores the calculated delay time into the system delay time storage  1218  (step S 68 ).  
         [0104]     After that, the input/output unit  121  outputs each delay time before and after the change (step S 69 ). Thus, the user can consider the change of the delay time according to the change of the number of CPUs. For example, by using this result, he or she investigates the effect in a case where the number of CPUs is increased.  
         [0105]     Next, the performance prediction at the number of servers will be explained by using  FIG. 14 . Here, it is assumed that the estimated delay time when the number of servers in the n-th layer is changed from M n  to M′ n  is calculated. Therefore, the number M′ n  of servers in the n-th layer is input from the input/output unit  121 , and the performance prediction processor  1213  of the delay analysis apparatus  120  accepts the input (step S 71 ). Then, the performance prediction processor  1213  corrects the consumed CPU time per one request according to the change of the number of servers, and stores the corrected consumed CPU time into the CPU time storage  1209  (step S 73 ) The consumed CPU time 1/μ (n,m)  per one request is changed to 1/μ′ (n,m)  as follows. In addition, the performance prediction processor  1213  corrects the CPU utilization ratio ρ according to the correction of the consumed CPU time per one request, and stores the corrected CPU utilization ratio into the CPU utilization ratio storage  1206  (step S 75 ). The CPU utilization ratio ρ is changed to ρ′ as follows:  
                 1     μ     (     n   ,   m     )     ′       =         M   n       M   n   ′       ⁢     1     μ     (     n   ,   m     )             ⁢     
     ⁢       ρ     (     n   ,   m     )       ′   ⁢           ⁢   i       =       1     C     (     n   ,   m     )         ⁢     (         1     μ     (     n   ,   m     )     ′       ⁢     λ   i       +     α     (     n   ,   m     )         )                 (   16   )             
 
 Incidentally, α (n,m)  is an intercept obtained when 1/μ (n,m)  is calculated, and is stored in the CPU time storage  1209 . Therefore, this value is used. 
 
         [0106]     Next, the server delay time calculator  1210  calculates the server delay time after the change by using the CPU utilization ratio ρ′ after the change, which is stored in the CPU utilization ratio storage  1206 , and the consumed CPU time 1/μ′ (n,m)  per one request after the change, which is stored in the CPU time storage  1209 , and stores the calculated server delay time into the server delay time storage  1214  (step S 77 ). The server delay time T′ i   (n,m)  after the change is represented as follows:  
         T     (     n   ,   m     )       ′   ⁢           ⁢   i       =       1     μ     (     n   ,   m     )     ′       ⁢     F   ⁡     (       C     (     n   ,   m     )       ,     ρ     (     n   ,   m     )       ′   ⁢           ⁢   i         )             
 
         [0107]     Then, the layer delay time calculator  1215  calculates the delay time in each layer by using the server delay time T′ i   (n,m)  after the change, which is stored in the server delay time storage  1214 , and stores the calculated delay time into the layer delay time storage  1216  (step S 79 ). Incidentally, also at this step, M i   n  from the performance prediction processor  1213  is used for the following calculation.  
         L   n     ′   ⁢           ⁢   i       =         M   n   ′       M   n       ⁢       ∑     m   =   1       M   n       ⁢     T     (     n   ,   m     )       ′   ⁢           ⁢   i               
 
         [0108]     Incidentally, L′ i   n  is represented from the expression (16) as follows:  
               L   n     ′   ⁢           ⁢   i       =         M   n   ′       M   n       ⁢       ∑     m   =   1       M   n       ⁢     T     (     n   ,   m     )       ′   ⁢           ⁢   i                       =         M   n   ′       M   n       ⁢       ∑     m   =   1       M   n       ⁢         M   n       M   n   ′       ⁢     1     μ     (     n   ,   m     )         ⁢     G   ⁡     (       C     (     n   ,   m     )       ,     ρ     (     n   ,   m     )       ′   ⁢           ⁢   i         )                         =       ∑     m   =   1       M   n       ⁢       1     μ     (     n   ,   m     )         ⁢     G   ⁡     (       C     (     n   ,   m     )       ,     ρ     (     n   ,   m     )       ′   ⁢           ⁢   i         )                     
 
         [0109]     Furthermore, the system delay time calculator  1217  calculates the delay time of the entire system after the change by using the delay time in each layer, which is stored in the layer delay time storage  1216 , and stores the calculated delay time into the system delay time storage  1218  (step S 81 ).  
         [0110]     After that, the input/output unit  121  outputs each delay time before and after the change (step S 83 ). Thus, the user can consider the change of the delay time according to the change of the number of servers. For example, by using this result, he or she investigates the effect when the number of servers is increased.  
         [0111]     Although the embodiment of this invention is described above, this invention is not limited to this. For example, the functional block diagrams shown in  FIGS. 4A and 4B  are mere examples, and the actual program configuration does not always correspond. As for the output processing, not only the values are displayed as they are, but also the table as shown in  FIG. 15  (table to display, for each unit time i, the consumed CPU time per one request, the CPU utilization ratio, the average delay time for each server, the average delay time for each layer, the delay actual measurement value, the estimated delay time other than the server and the confidence degree of the delay time for each layer) and the graph as shown in  FIG. 16  (graph in which the horizontal axis represents time, and the vertical axis represents the delay time, and which represents the time change of the delay times of the Web server (the first layer), the application server (the second layer), the DB server (the third layer) and other) may be generated and displayed. Incidentally, when watching the graph of  FIG. 16 , it becomes possible to judge that during the normal time from 9 to 12 o&#39;clock, the delay of the Web server almost occupies the half and more (portion A of  FIG. 16 ), from 12 to 15 o&#39;clock, because of the temporal load increase of the DB server, the response is extremely lowered (portion B of  FIG. 16 ), since 18 o&#39;clock, the delay time other than the server increases and any problem may occur (portion C of  FIG. 16 ).  
         [0112]     Incidentally, the aforementioned delay analysis apparatus  120  is a computer device as shown in  FIG. 17 . That is, a memory  2501  (storage device), a CPU  2503  (processor), a hard disk drive (HDD)  2505 , a display controller  2507  connected to a display device  2509 , a drive device  2513  for a removal disk  2511 , an input device  2515 , and a communication controller  2517  for connection with a network are connected through a bus  2519  as shown in  FIG. 28 . An operating system (OS) and an application program for carrying out the foregoing processing in the embodiment, are stored in the HDD  2505 , and when executed by the CPU  2503 , they are read out from the HDD  2505  to the memory  2501 . As the need arises, the CPU  2503  controls the display controller  2507 , the communication controller  2517 , and the drive device  2513 , and causes them to perform necessary operations. Besides, intermediate processing data is stored in the memory  2501 , and if necessary, it is stored in the HDD  2505 . In this embodiment of this invention, the application program to realize the aforementioned functions is stored in the removal disk  2511  and distributed, and then it is installed into the HDD  2505  from the drive device  2513 . It may be installed into the HDD  2505  via the network such as the Internet and the communication controller  2517 . In the computer as stated above, the hardware such as the CPU  2503  and the memory  2501 , the OS and the necessary application program are systematically cooperated with each other, so that various functions as described above in details are realized.