JP5696627B2 - Program, information processing apparatus, and information processing method - Google Patents

Description

  The present invention relates to a program for performing information processing by a computer having a control unit, an information processing apparatus, and an information processing method.

  2. Description of the Related Art A technique for identifying a delay point by analyzing the processing time and response time of each computer in response to a processing request based on a communication packet flowing on a network is known (see, for example, Patent Documents 1 and 2).

JP 2006-11683 A JP 2011-128969 A

  However, with the technique of Patent Document 1, it is possible to obtain a delay with respect to a specific URL (Uniform Resource Locator) from the breakdown of processing time of each hierarchy for each business model, but it is not possible to grasp the influence between processes. Further, since the technique of Patent Document 2 determines the delay based on the frequency distribution of the number of stays requested for processing, the delay cannot be determined when there is no saturation associated with the restriction on the number of stays required for processing.

  In one aspect, an object of the present invention is to provide a program or the like that can identify a process causing a delay.

  The program disclosed in the present application acquires a request time of request data and a response time of response data, and sets a request time between a request time of one request data and a response time of response data corresponding to the one request data. Counting the number of other requested data having, and when the counted value exceeds the first threshold, using the calculation processing unit to calculate the first time based on the request time of a plurality of request data, When the second time is calculated based on the response times of a plurality of response data, and the difference or ratio between the calculated first time and the second time exceeds a second threshold, Causes the computer to execute processing for outputting delay information.

  According to one aspect of the present application, it is possible to identify a process causing a delay.

It is explanatory drawing which shows the outline | summary of an information processing system. It is a block diagram which shows the hardware group of information processing apparatus. It is explanatory drawing which shows the record layout of a history file. It is explanatory drawing which shows the sort process by a protocol and message ID. It is explanatory drawing which shows the sort process by URL. It is explanatory drawing which shows the record after an extraction process. It is a flowchart which shows the memory | storage process procedure of data. It is a flowchart which shows the procedure of a delay judgment process. It is a flowchart which shows the procedure of a delay judgment process. It is explanatory drawing which shows the record layout of a history file. It is explanatory drawing which shows the sort process by a protocol and message ID. It is explanatory drawing which shows the sort process by URL. It is a flowchart which shows the removal process procedure of the group which violates FIFO. It is a flowchart which shows the removal process procedure of the group which violates FIFO. It is explanatory drawing which shows the image of the output screen of delay information. It is explanatory drawing which shows the display form of other screen data. It is a graph which shows a delay condition. It is a flowchart which shows the procedure of the output process of delay information. It is a flowchart which shows the procedure of the output process of delay information. It is a functional block diagram which shows operation | movement of the information processing apparatus of the form mentioned above. FIG. 10 is a block diagram illustrating a hardware group of an information processing device according to a third embodiment.

Embodiment 1
Hereinafter, embodiments will be described with reference to the drawings. FIG. 1 is an explanatory diagram showing an outline of an information processing system. The information processing system includes an information processing apparatus 1, client computers 21, 22, 23 (hereinafter represented by 2 in some cases), server computers 31, 32, 33 (hereinafter represented by 3 in some cases), a switch 4, and the like. . The server computer 3 is, for example, a Web server computer 31, an application server computer 32, a database (hereinafter referred to as DB) server computer 33, or the like. In the present embodiment, the number of client computers 2 and server computers 3 is 3, but this is an example and the present invention is not limited to this.

  The information processing apparatus 1 is a server computer or a personal computer, for example. The information processing apparatus 1 and each server computer 3 are connected to each other via a switch 4. The switch 4 is connected to the client computer 2 via a communication network N such as the Internet or a LAN (Local Area Network). The Web server computer 31, application server computer 32, and DB server computer 33 provide services in response to requests from the client computers 21, 22, and 23.

  In a transaction for providing a service, a message may be transmitted / received via the switch 4 between the Web server computer 31, the application server computer 32, and the DB server computer 33. The information processing apparatus 1 monitors messages transmitted and received through the switch 4 to analyze the operating state of the system. The switch 4 has a function of mirroring data passing through the switch 4. Mirroring is a function for outputting the same data as data output to a certain port from other ports.

  For example, the port to which the information processing apparatus 1 is connected is designated as the mirroring destination of the port to which the Web server computer 31 is connected, the port to which the application server computer 32 is connected, and the port to which the DB server computer 33 is connected. . Thus, a packet addressed to each server computer 3 is input to the server computer 3 as a destination and also input to the information processing apparatus 1.

  For example, it is assumed that each server computer 3 provides a service in conjunction with a request from the client computer 21. In this case, first, an HTTP (HyperText Transfer Protocol) packet is transmitted from the client computer 21 to the Web server computer 31. At this time, an HTTP packet having the same content as the HTTP packet is input to the information processing apparatus 1. Next, an IIOP (Internet Inter-ORB Protocol) packet is transmitted from the Web server computer 31 to the application server computer 32.

  In this case, an IIOP packet having the same content as the IIOP packet is input to the information processing apparatus 1. Further, when a DB access packet is transmitted from the application server computer 32 to the DB server computer 33, a DB access packet having the same content as the DB access packet is input to the information processing apparatus 1.

  The information processing apparatus 1 detects a delay based on a packet indicating a request for processing (hereinafter referred to as request data) and a packet indicating a response processed according to the request data (hereinafter referred to as response data). . The information processing apparatus 1 stores the request time every time request data is received, and stores the response time every time response data is received. The information processing apparatus 1 extracts request data having a request time from a request time of one request data to a response time of response data corresponding to the one request data. The information processing apparatus 1 reads the request time and response time of the extracted request data. The information processing apparatus 1 includes a first time between request times of a plurality of request data (hereinafter referred to as a first time) and a second time between response times of a plurality of response data (hereinafter referred to as a second time). Compare The information processing apparatus 1 outputs delay information when the difference or ratio between the first time and the second time exceeds a second threshold (hereinafter referred to as a second threshold). Details will be described below.

  FIG. 2 is a block diagram illustrating a hardware group of the information processing apparatus 1. The information processing apparatus 1 includes a CPU (Central Processing Unit) 11 as a control unit (calculation processing unit), a RAM (Random Access Memory) 12, an input unit 13, a display unit 14, a storage unit 15, a communication unit 16, a clock unit 18, and the like. Including. The CPU 11 is connected to each part of the hardware via the bus 17. The CPU 11 controls each part of the hardware according to the control program 15P stored in the storage unit 15. The RAM 12 is, for example, SRAM (Static RAM), DRAM (Dynamic RAM), flash memory, or the like. The RAM 12 also functions as a storage unit, and temporarily stores various data generated when the CPU 11 executes various programs.

  The input unit 13 is an input device such as a mouse, a keyboard, or a touch panel, and outputs received operation information to the CPU 11. The display unit 14 is a liquid crystal display, an organic EL (electroluminescence) display, or the like, and displays various information according to instructions from the CPU 11. The communication unit 16 is, for example, a LAN card or the like, and transmits / receives information to / from another computer via the communication network N in addition to transmitting / receiving information to / from the switch 4. The clock unit 18 outputs the current time or the elapsed time starting from an arbitrary time point to the CPU 11. The storage unit 15 is, for example, a hard disk or a large-capacity flash memory, and stores a control program 15P, a history file 151, and the like.

  FIG. 3 is an explanatory diagram showing a record layout of the history file 151. The history file 151 includes a time stamp field, a protocol field, a message ID field, a message type field, an object field, and the like. The time stamp field stores the current time output from the clock unit 18 when the CPU 11 receives request data or response data via the communication unit 16. In the present embodiment, an example in which the current time is stored will be described, but the present invention is not limited to this. For example, an elapsed time starting from an arbitrary time may be stored in the time stamp field. Hereinafter, the time when the request data is received is referred to as a request time, and the time when the response data is received is referred to as a response time. Each time the CPU 11 receives the request data and the response data, the CPU 11 stores the request time and the response time in the time stamp field of the history file 151.

  The protocol field stores the protocol type of request data and response data. For example, the protocol is HTTP or SQL (Structured Query Language). The message ID field stores an ID for specifying request data and response data. The message type field stores information indicating whether the acquired data is request data or response data. In the example of FIG. 3, it is request data that stores the message type as a request, and response data that is stored as a response.

  In the object field, when the protocol is HTTP and the message type is request, the URL of the request destination of request data is stored. The CPU 11 extracts the protocol, message ID, message type, and object described in the header of the request data and response data, and stores them in the history file 151. For example, in the case of time stamp 000 (for the sake of simplification, a decimal part is sometimes displayed), the protocol is HTTP, the message ID is 1, the message type is request, and the object is URL1. Here, the object may be described by extracting a specific character string from the URL character string in order to group similar requests. For example, only the path portion of the URL can be extracted, or the URL path and some specific CGI parameters can be extracted and described. Response data corresponding to the request data is stored in the time stamp 015 field. The CPU 11 determines that the message type having the same protocol and message ID is data corresponding to the request data of the request and the response data of the message type corresponding to the response. Similarly, the protocol is HTTP, the message ID is 1, and the message type is stored as response. In the present embodiment, the history file 151 is provided in the storage unit 15, but the present invention is not limited to this. In addition to being stored in the RAM 12, it may be stored in an external DB (not shown). Further, the data layout of the history file 151 is merely an example, and is not limited to this. Other storage forms may be used as long as the relationship between the data is maintained.

  FIG. 4 is an explanatory diagram showing sort processing by protocol and message ID. The CPU 11 extracts a record of request data and response data having the same protocol and message ID. For example, the CPU 11 extracts request data having the protocol HTTP, message ID 1 and time stamp 000, and response data having the time stamp 015. Further, the CPU 11 extracts the request data having the protocol SQL, the message ID 2, the time stamp 007, and the response data having the time stamp 009. The CPU 11 stores the relationship between the extracted request data and the corresponding response data in the RAM 12.

  The CPU 11 calculates the elapsed time based on the request time of the extracted request data and the response time of the corresponding response data. Specifically, the elapsed time is calculated by subtracting the request time from the response time. For example, 0.015 is calculated by subtracting the request time 0.000 from the response time (time stamp) 0.015. The CPU 11 stores the calculated elapsed time in the RAM 12 in association with the request data and the response data.

  FIG. 5 is an explanatory diagram showing sort processing by URL. The CPU 11 refers to the URL stored in the object field and groups the combinations of the extracted request data and response data. Here, grouping is performed in consideration of first-in first-out (hereinafter referred to as FIFO) conditions. Although omitted in FIGS. 3 and 4, in FIG. 5, a record having a time stamp of 01.000 to 01.018 and an object of URL2 is also added to show an example of a FIFO violation. In the example of FIG. 5, the group of the object URL1, the group in which no object is stored (request data and response data whose protocol is SQL), and the group of the object URL2 are divided into four groups. Here, the CPU 11 may read a threshold time (predetermined time, for example, 0.005 seconds) from the storage unit 15, and the CPU 11 may extract only combinations of request data and response data whose elapsed time exceeds the threshold time as a group. In the example of FIG. 5, only combinations of request data and response data in which an elapsed time of the threshold time of 0.005 or more is stored are extracted as a group. The CPU 11 reads out the request time related to the earliest request data and the response time corresponding to the request time among the grouped request data. The CPU 11 determines whether there is other request data and response data having both the request time and the response time between the read request time and response time. If the CPU 11 determines that the group exists, the CPU 11 determines that the group is in violation of the FIFO and terminates the process without performing the delay process. In the example of FIG. 5, the CPU 11 reads the request time 1.000 and the response time 1.016 related to the earliest request data. Here, the request time of the message ID 5 is 1.006 and the response time is 1.012. Both the request time and the response time are the request time 1.000 and the response time 1. 016. In this case, the CPU 11 ends the process without performing the delay process for the group.

  The group extraction may be performed in addition to the above-described method with respect to the number of other requested data in which the requested time exists between the requested time and the response time of the first requested data. The CPU 11 reads the request time and response time of the first request data from the history file 151. Next, the CPU 11 counts request data having a request time between the read request time and the response time. The CPU 11 stores the counted value in the RAM 12. For example, in the example of the time stamp 000 in FIG. That is, the request time 000 and the response time 015 of the first request data are read out. The CPU 11 counts two request data having request times 001 and 008. The CPU 11 reads a first threshold value (hereinafter referred to as a first threshold value) from the storage unit 15. The first threshold is 1, for example. The CPU 11 extracts a group having a count value exceeding the first threshold. The CPU 11 stores the record after the extraction process in the RAM 12.

  FIG. 6 is an explanatory diagram showing a record after extraction processing. The CPU 11 calculates the first time by adding the time between the requested times. In the example of FIG. 6, the time (007) between the request time 001 and the request time 008 is added to the time (001) between the request time 000 and the request time 001, and the first time 0.008 ( 001 + 007) is calculated. The CPU 11 stores 0.008 in the RAM 12 in association with the group. Similarly, the CPU 11 calculates the second time by adding the time between response times. In the example of FIG. 6, the time (001) between the response time 016 and the response time 017 is added to the time (001) between the response time 015 and the response time 016, and the second time 0.002 ( 001 + 001) is calculated. The CPU 11 stores 0.002 in the RAM 12 in association with the group.

  The CPU 11 calculates the difference or ratio between the first time and the second time. In this embodiment, an example using a ratio will be described, but a difference may be used. The CPU 11 divides the first time by the second time. Note that the second time may be divided by the first time. The CPU 11 reads the second threshold value from the storage unit 15. The CPU 11 determines whether or not the divided value exceeds the second threshold value. When the divided value exceeds the second threshold value, the CPU 11 outputs delay information indicating a delay. Note that the delay information may be output to the display unit 14, to a speaker (not shown), or to another computer connected via the communication network N.

  In the above hardware, software processing will be described using a flowchart. FIG. 7 is a flowchart showing a data storage processing procedure. The CPU 11 receives the protocol, message ID, message type, and object of the request data transmitted from the switch 4 via the communication unit 16 (step S71). The CPU 11 stores the request time, protocol, message ID, message type, and object output from the clock unit 18 at the time of reception in the history file 151 (step S72). The CPU 11 refers to the message type and determines that the data is request data and the time is request time.

  The CPU 11 receives the protocol, message ID, message type, and object of the response data transmitted from the switch 4 via the communication unit 16 (step S73). The CPU 11 stores the response time, protocol, message ID, message type, and object output from the clock unit 18 at the time of reception in the history file 151 (step S74). The CPU 11 refers to the message type and determines that the data is response data and the time is response time.

  8 and 9 are flowcharts showing the procedure of the delay determination process. After storing data in the history file 151, the CPU 11 performs the following processing at regular time intervals, at an arbitrary time, or at a predetermined time. The CPU 11 obtains (reads out) the request data request time, protocol, message ID, message type, and object from the history file 151 (step S81). The CPU 11 obtains (reads) the response time, protocol, message ID, message type, and object of the response data from the history file 151 (step S82).

  The CPU 11 expands the acquired request time, response time, protocol, message ID, message type, and object in the RAM 12 (step S83). CPU11 extracts the combination which makes a protocol and message ID common (step S84). The CPU 11 performs grouping based on the object and the FIFO (step S85). The CPU 11 calculates the elapsed time based on the combination of the request time and the response time (step S86). Specifically, the request time is subtracted from the response time related to the extracted combination in the group, and the elapsed time is calculated.

  CPU11 reads threshold time from the memory | storage part 15 (step S87). The CPU 11 deletes the combination whose elapsed time exceeds the threshold time from the data in the group created in step S85 (step S88). The CPU 11 reads out the request time associated with the request data (one request data) having the earliest request time of the extracted group (step S89). The CPU 11 reads the response time related to the response data corresponding to the previous request data from the RAM 12 (step S91).

  The CPU 11 refers to the RAM 12 and counts the number of request data having a request time between the request time and the response time related to the read previous request data (step S92). The CPU 11 reads the first threshold value from the storage unit 15 (step S93). The CPU 11 determines whether or not the count value counted in step S92 exceeds the first threshold value (step S94). If the CPU 11 determines that the first threshold value is not exceeded (NO in step S94), the process ends. If the CPU 11 determines that the first threshold value is exceeded (YES in step S94), the process proceeds to step S95.

  The CPU 11 deletes groups that do not exceed the first threshold from the RAM 12. The CPU 11 calculates the first time by adding the time between the request times stored in the RAM 12 (step S95). Specifically, the CPU 11 calculates the first time by obtaining the time between the request times that are consecutive to each other and adding them up. The calculation of the first time is an example, and the first time is not limited to this as long as the request times related to a plurality of request data are used. For example, the first time may be calculated as the sum of the subtracted request times from the request time with the latest time. In addition, the CPU 11 divides the total value of the time between consecutive request times or the value obtained by subtracting the request time with the earliest time from the request time with the latest time by the count value counted in step S92. Thus, the first time may be calculated.

  The CPU 11 adds the time between the response times stored in the RAM 12 to calculate the second time (step S96). Specifically, the CPU 11 calculates the second time by obtaining the time between response times that are consecutive to each other and adding them up. Note that the calculation of the second time is an example, and the second time is not limited to this as long as it uses response times related to a plurality of response data. For example, the second time may be calculated as the sum of the response times obtained by subtracting the previous response times from the latest response time. In addition, the CPU 11 divides the total value of the time between consecutive response times or the value obtained by subtracting the response time with the earliest time from the response time with the latest time by the count value counted in step S92. Accordingly, the second time may be calculated.

  The CPU 11 divides the first time by the second time (step S97). The CPU 11 reads the second threshold value from the storage unit 15 (step S98). The CPU 11 determines whether or not the divided value exceeds the second threshold value (step S99). Note that the second threshold is, for example, 2 or the like. If the CPU 11 determines that the second threshold value is not exceeded (NO in step S99), the process ends. The CPU 11 erases the group record stored in the RAM 12. If the CPU 11 determines that the divided value exceeds the second threshold value (YES in step S99), the CPU 11 displays delay information indicating that there is a delay via the display unit 14 or the communication unit 16 (not shown). (Step S910). Thereby, it is possible to determine whether the processing of the specific server computer 3 is generally delayed or whether the server is delayed due to the specific processing.

  Next, the FIFO extraction process will be described. The CPU 11 reads the request time and response time related to the earliest request data among the grouped request data. When the request data having both the request time and the response time and the response data corresponding to the request data are stored between the read request time and the response time, the CPU 11 does not determine the delay and performs the process. finish.

  FIG. 10 is an explanatory diagram showing a record layout of the history file 151. The history file 151 includes a time stamp field, a protocol field, a message ID field, a message type field, and an object field.

  FIG. 11 is an explanatory diagram showing sort processing by protocol and message ID. The CPU 11 extracts a record of request data and response data having the same protocol and message ID. For example, the CPU 11 extracts request data having the protocol HTTP, message ID 1 and time stamp 1.000, and response data having the time stamp 1.016. Further, the CPU 11 extracts the request data having the protocol SQL, the message ID is 1, the time stamp is 1.002, and the response data having the time stamp 1.005. The CPU 11 calculates the elapsed time based on the request time of the extracted request data and the response time of the corresponding response data.

  FIG. 12 is an explanatory diagram showing sort processing by URL. The CPU 11 refers to the URL stored in the object field and groups the combinations of the extracted request data and response data. In the example of FIG. 12, the object URL2 group, the group in which no object is stored (request data and response data whose protocol is SQL), and the object URL1 group are divided. Here, attention is focused on a group whose object is URL2. The CPU 11 reads out the request time 1.000 and the response time 1.016 related to the earliest request data among the grouped request data. Here, the request time of message ID 5 is 1.006, and the response time is 1.012. Both the request time and the response time are the request time 1.000 and the response time related to the earliest request data. It exists between 1.016. In this case, the CPU 11 ends the process without performing the delay process for the group.

  FIG. 13 and FIG. 14 are flowcharts showing a procedure for removing a group that violates the FIFO. Since the processing between steps S81 to S91 is as described above, detailed description thereof is omitted. After step S91, the CPU 11 refers to the RAM 12, and determines whether there is a combination of request data and response data having the request time and the response time between the request time and the response time related to the earliest request data. (Step S131). If the CPU 11 determines that it does not exist (NO in step S131), the process proceeds to step S92. Since the process after step S92 is as above-mentioned, detailed description is abbreviate | omitted.

  When the CPU 11 determines that there is a combination (YES in step S131), the CPU 11 shifts the processing to step S132 because it is contrary to the FIFO. The CPU 11 deletes the record related to the group in which the combination exists in the step S131 from the RAM 12 (step S132). The CPU 11 determines whether or not the processing in step S131 has been executed for all the groups extracted in step S88 (step S133). If the CPU 11 determines that the processing is not executed for all the groups (NO in step S133), the CPU 11 proceeds to step S89 and performs the same processing for the unprocessed group.

  If the CPU 11 determines that the process has been executed for all groups (YES in step S133), the process ends. In this case, the counting process described in step S92, the calculation process in steps S95 and S96, and the output process in step S910 are stopped (skipped). Note that the processing of steps S131 to S133 added in the present embodiment may be executed after the counting processing of steps S92 to S94. In this case, the calculation process in steps S95 and S96 and the output process in step S910 are stopped. Moreover, you may perform the process of step S131-S133 added by this embodiment after the calculation process of step S95-S99.

  In this case, the output process in step S910 is stopped. In this way, by removing the group that violates the FIFO, it becomes possible to prevent the output of delay information that is not caused by the delay of the specific processing.

Embodiment 2
The second embodiment relates to a mode for outputting delay information. FIG. 15 is an explanatory diagram showing an image of a delay information output screen. When the CPU 11 determines in step S99 that the second threshold value is exceeded, the CPU 11 reads screen data for displaying delay information from the storage unit 15. As shown in FIG. 15, the screen data serving as a template stores information indicating that a delay has occurred, such as “a delay has occurred due to the following request data”. The CPU 11 reads the request time related to the earliest request data read from the RAM 12 in step S89. Further, the CPU 11 reads the protocol, message ID, message type, and object corresponding to the request data. The CPU 11 describes a request time (time stamp), a protocol, a message ID, a message type, and an object related to the request data in the screen data serving as a template. The CPU 11 outputs the delay information after the description to the display unit 14.

  In the example of FIG. 15, the request time is 00: 00: 00.000, the protocol is HTTP, the message ID is 1, the message type is request, and the object is URL1. It is not necessary to display all of these. For example, only the requested time may be displayed. In the present embodiment, the output destination of the delay information is the display unit 14, but the present invention is not limited to this. For example, the CPU 11 may store the e-mail address in the storage unit 15 and transmit the above described screen data to the stored e-mail address when outputting the delay information. The CPU 11 may store screen data including delay information in the storage unit 15 and transmit the screen data to another computer when there is a transmission request from another computer (not shown).

  FIG. 16 is an explanatory diagram showing a display form of other screen data. Further, the CPU 11 may display various data of the group determined to exceed the second threshold value in step S99 among the groups remaining in step S88. The CPU 11 describes a time stamp (request time and response time), a protocol, a message ID, a message type, an object, an elapsed time, a first time, and a second time concerning the group request data and response data. Note that at least the request time of request data and the response time of response data may be described. Other display items may be added as appropriate. In FIG. 16, the elapsed time, the first time, and the second time are displayed in addition to the time stamp.

  FIG. 17 is a graph showing a delay situation. The CPU 11 may further display the delay status in a graph based on the data stored in the RAM 12. The horizontal axis represents time, and the vertical axis represents the presence or absence of a request or response. The solid lines indicate request data and response data at request time 000 and response time 015. Dotted lines indicate request data and response data at request time 001 and response time 016. The alternate long and short dash line indicates request data and response data at request time 008 and response time 017. Based on the request time of the request data and the response time of the response data, the CPU 11 displays a temporal change in a graph. The CPU 11 displays the time change display process in a different form so that the combination of each request data and response data can be identified. For example, as in this embodiment, in addition to being identified by a solid line and a dotted line, it may be identified by coloring.

  The CPU 11 describes the request time of request data and the response time of response data on the horizontal axis. The CPU 11 reads the first time and the second time from the RAM 12. The CPU 11 describes the first time between the time of the first request data earliest in time and the time of the last request data in time. In the example of FIG. 17, a bidirectional arrow extending left and right is displayed between the request times 000 and 008, and further, the first time 0.008 is displayed. The CPU 11 describes the second time between the time of the first response data earliest in time and the time of the last response data in time. In the example of FIG. 17, a bidirectional arrow extending to the left and right is displayed between the request times 015 and 017, and the second time 0.002 is further displayed.

  18 and 19 are flowcharts showing the procedure of the delay information output process. The CPU 11 extracts groups that exceed the second threshold (step S181). Specifically, out of the groups extracted in step S88, a group exceeding the second threshold is extracted in step S99. The CPU 11 reads the time stamp, protocol, message ID, message type, and object related to the request data and response data of the group from the RAM 12 (step S182). Similarly, the CPU 11 reads the elapsed time, the first time, and the second time related to the request data and the response data (step S183). The elapsed time, the first time, and the second time are calculated in steps S86, S95, and S96, and data stored in the RAM 12 in association with the request data and response data may be used.

  CPU11 reads the screen data used as a template from the memory | storage part 15 (step S184). In the screen data serving as a template, a sentence indicating that a delay has occurred is described in advance. The CPU 11 describes the time stamp, protocol, message ID, message type, object, elapsed time, first time, and second time in the screen data (step S185). The CPU 11 displays the screen data after the description on the display unit 14 as shown in FIG. 16 (step S186). When the CPU 11 receives a request for displaying a graph from the input unit 13, the CPU 11 performs the following processing.

  CPU11 reads the graph data used as a template (step S187). In the graph data as a template, the horizontal axis is described in advance so that the communication status between the client computer 2 and the server computer 3 can be shown in a time series in addition to text indicating that a delay has occurred. Yes. For example, the lower side may be the client computer 2 and the upper side may be the server computer 3. In addition, the display example of a graph is an example to the last, and is not restricted to this. For example, it may be rotated 90 degrees clockwise. That is, the direction of passage of time may be defined from top to bottom, and the left side may be the client computer 2 and the right side may be the server computer 3.

  The CPU 11 describes temporal changes in the request data and response data based on the request time and response time of the request data and response data read in step S182 (step S188). Specifically, an arrow from the request time to the axis of the client computer 2 to the server computer 3 is described. The CPU 11 describes an arrow from the response time as the starting point to the axis of the server computer 3 toward the axis of the client computer 2. Finally, a line connecting the tip of the arrow indicating the request data and the end of the line indicating the response data is described.

  The CPU 11 describes the request time and response time read in step S182 (step S189). The CPU 11 determines whether or not the processing for steps S188 and S189 for all request data and response data has been completed (step S191). If the CPU 11 determines that all the processes have not been completed (NO in step S191), the process returns to step S188, and processes the request data and response data related to other combinations. When executing the process of step S188, the CPU 11 describes a line that can be identified as a line that has already been described.

  If the CPU 11 determines that the processing for all the request data and response data in the group has been completed (YES in step S191), the process proceeds to step S192. The CPU 11 reads the first time read in step S183 (step S192). The CPU 11 reads the first request time and the last request time from the RAM 12 (step S193). The CPU 11 describes the first time between the first request time and the last request time (step S194). The CPU 11 reads the second time read in step S183 (step S195). The CPU 11 reads the first response time and the final response time from the RAM 12 (step S196). The CPU 11 describes the second time between the first response time and the final response time (step S197). CPU11 displays the graph after description on the display part 14 (step S198).

  The CPU 11 displays the first request time causing the delay so that it can be distinguished from other times (step S199). Specifically, the time is blinked or displayed in a color different from the colors of other times. In the example of FIG. 17, the request time 000 blinks. Further, the CPU 11 displays the line related to the first request data that causes the delay so that it can be distinguished from other lines (step S1910). For example, an arrow line related to the first request data is displayed by blinking or a color different from other arrows or a dotted line. In the example of FIG. 17, an arrow extending upward from the axis of the client computer 2 to the axis of the server computer 3 is blinked at the request time 000.

  The CPU 11 displays the first time indicating the delay in a form different from the second time (step S1911). For example, the first time is blinked or displayed in a different color from the second time. In the example of FIG. 17, the second time may be black and the first time may be red. As a result, the user can easily specify a delay caused by a specific cause, and can quickly cope with the delay.

  The second embodiment is as described above, and the other parts are the same as those of the first embodiment. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

Embodiment 3
FIG. 20 is a functional block diagram showing the operation of the information processing apparatus 1 having the above-described form. When the CPU 11 executes the control program 15P and the like, the information processing apparatus 1 operates as follows. The CPU 11 expands the acquisition unit 121, the counting unit 122, the calculation unit 123, and the output unit 124 related to the module of the control program 15P in the RAM 12. The acquisition unit 121 acquires a request time of request data and a response time of response data. The counting unit 122 counts the number of other request data having the request time between the request time of one request data acquired by the acquisition unit 121 and the response time. The calculation unit 123 calculates the second time calculated based on the first time calculated based on the request time of each request data and the response time of each request data when the count value counted by the counting unit 122 exceeds the first threshold. Calculate time. The output unit 124 outputs delay information when the difference or ratio between the request time and the response time calculated by the calculation unit 123 exceeds the second threshold.

  FIG. 21 is a block diagram illustrating a hardware group of the information processing apparatus 1 according to the third embodiment. A program for operating the information processing apparatus 1 is stored by causing a reading unit 10A such as a disk drive to read a portable recording medium 1A such as a CD-ROM, a DVD (Digital Versatile Disc) disk, or a USB (Universal Serial Bus) memory. You may memorize | store in the part 15. FIG. Further, a semiconductor memory 1B such as a flash memory storing the program may be mounted in the information processing apparatus 1. Further, the program can be downloaded from another server computer (not shown) connected via a communication network N such as the Internet. The contents will be described below.

  The information processing apparatus 1 shown in FIG. 21 reads a program for executing the above-described various software processes from the portable recording medium 1A or the semiconductor memory 1B, or another server computer (not shown) via the communication network N. Download from. The program is installed as the control program 15P, loaded into the RAM 12, and executed. Thereby, it functions as the information processing apparatus 1 described above.

  The third embodiment is as described above, and the others are the same as in the first and second embodiments. Therefore, the corresponding parts are denoted by the same reference numerals, and detailed description thereof is omitted.

  The following additional notes are further disclosed with respect to the embodiments including the first to third embodiments.

(Appendix 1)
Get request time of request data and response time of response data,
Counting the number of other request data having a request time between the request time of one request data and the response time of response data corresponding to the one request data;
When the counted value exceeds the first threshold, the calculation processing unit is used to calculate the first time based on the request times of the plurality of request data and based on the response times of the plurality of response data. Calculate the second time,
A program that causes a computer to execute a process of outputting delay information when a difference or ratio between the calculated first time and the second time exceeds a second threshold.

(Appendix 2)
The program according to claim 1, wherein a first time is calculated by adding a time between request times of each request data, and a second time is calculated by adding a time between response times of each response data.

(Appendix 3)
By adding the time between request times of each request data and dividing by the count value, calculating the first time, adding the time between response times of each response data, and dividing by the count value The program according to attachment 1, wherein the second time is calculated.

(Appendix 4)
Get request time of request data and response time of response data,
Counting the number of other request data having a request time between the request time of one request data and the response time of response data corresponding to the one request data;
When the counted value exceeds the first threshold, the calculation processing unit is used to calculate the first time based on the request times of the plurality of request data and based on the response times of the plurality of response data. Calculate the second time,
If the difference or ratio between the calculated first time and the second time exceeds a second threshold, output delay information;
When there is other request data having a request time and a response time between the request time and the response time of the one request data, the control unit causes the computer to execute the process of stopping the counting, calculation or output process program.

(Appendix 5)
The elapsed time from the request time of one request data to the response time of response data corresponding to the one request data is calculated by the control unit,
The program according to any one of appendices 1 to 4, wherein when the calculated elapsed time is equal to or longer than a predetermined time stored in the storage unit, the control unit counts the number of other requested data.

(Appendix 6)
When the difference or ratio between the calculated request time and the response time exceeds the second threshold value, the control unit outputs information for specifying the one request data. The listed program.

(Appendix 7)
When the difference or ratio between the calculated request time and response time exceeds the second threshold, the control unit outputs information for specifying the request time and response time of the one request data and other request data The program according to any one of appendices 1 to 5.

(Appendix 8)
An acquisition unit for acquiring a request time of request data and a response time of response data;
A counting unit for counting the number of other request data having a request time between a request time of one request data acquired by the acquisition unit and a response time of response data corresponding to the one request data;
When the count value counted by the counting unit exceeds the first threshold, the first time is calculated based on the request times of the plurality of request data, and the second time is calculated based on the response times of the plurality of response data. A calculation unit for calculating time;
An information processing apparatus comprising: an output unit that outputs delay information when a difference or ratio between the first time and the second time calculated by the calculation unit exceeds a second threshold.

(Appendix 9)
Get request time of request data and response time of response data,
Counting the number of other request data having a request time between the request time of one request data and the response time of response data corresponding to the one request data;
When the counted value exceeds the first threshold, the calculation processing unit is used to calculate the first time based on the request times of the plurality of request data, and based on the response times of the plurality of response data. Calculate the second time,
An information processing method for outputting delay information when a difference or ratio between the calculated first time and the second time exceeds a second threshold.

DESCRIPTION OF SYMBOLS 1 Information processing apparatus 1A Portable recording medium 1B Semiconductor memory 2, 21, 22, 23 Client computer 3, 31, 32, 33 Server computer 4 Switch 10A Reading part 11 CPU
12 RAM
DESCRIPTION OF SYMBOLS 13 Input part 14 Display part 15 Memory | storage part 15P Control program 16 Communication part 18 Clock part 121 Acquisition part 122 Count part 123 Calculation part 124 Output part 151 History file N Communication network

Claims (5)

Get request time of request data and response time of response data,
Counting the number of other request data having a request time between the request time of one request data and the response time of response data corresponding to the one request data;
When the counted value exceeds the first threshold, the calculation processing unit is used to calculate the first time based on the request times of the plurality of request data and based on the response times of the plurality of response data. Calculate the second time,
A program that causes a computer to execute a process of outputting delay information when a difference or ratio between the calculated first time and the second time exceeds a second threshold. The program according to claim 1, wherein a first time is calculated by adding a time between request times of each request data, and a second time is calculated by adding a time between response times of each response data. . By adding the time between request times of each request data and dividing by the count value, calculating the first time, adding the time between response times of each response data, and dividing by the count value The program according to claim 1, wherein the second time is calculated. An acquisition unit for acquiring a request time of request data and a response time of response data;
A counting unit for counting the number of other request data having a request time between a request time of one request data acquired by the acquisition unit and a response time of response data corresponding to the one request data;
When the count value counted by the counting unit exceeds the first threshold, the first time is calculated based on the request times of the plurality of request data, and the second time is calculated based on the response times of the plurality of response data. A calculation unit for calculating time;
An information processing apparatus comprising: an output unit that outputs delay information when a difference or ratio between the first time and the second time calculated by the calculation unit exceeds a second threshold. Get request time of request data and response time of response data,
Counting the number of other request data having a request time between the request time of one request data and the response time of response data corresponding to the one request data;
When the counted value exceeds the first threshold, the calculation processing unit is used to calculate the first time based on the request times of the plurality of request data, and based on the response times of the plurality of response data. Calculate the second time,
An information processing method for outputting delay information when a difference or ratio between the calculated first time and the second time exceeds a second threshold.

Images