Abstract: An information processing apparatus submits jobs for execution on a server. Jobs are classified into a plurality of groups, and these groups are ranked in ascending order of workload that the groups of jobs impose on the server. A processor in the information processing apparatus counts ongoing jobs that are currently executed on the server and belong to a specified number of top-ranked groups. The processor designates pending jobs that belong to other groups than the specified number of top-ranked groups and suspends submission of processing requests of the designated pending jobs to the server, when the number of ongoing jobs is greater than or equal to a threshold and when there are one or more pending jobs that belong to the specified number of top-ranked groups.

Abstract: In an information processing apparatus, an extraction unit extracts, from a storage unit, processing period records corresponding to operations whose response times from respective request input times to respective response output times are greater than a threshold. With respect to the operations whose response times are greater than the threshold, a first analysis unit analyzes, based on the request input times in the extracted processing period records, variations in input frequency of operation requests, and a second analysis unit analyzes, based on the response output times in the extracted processing period records, variations in output frequency of responses. A determination unit determines the cause of occurrence of the operations whose response times are greater than the threshold based on the variations in input frequency and output frequency.

Abstract: This message tying processing method include: extracting tying keys from a key definition database storing, for each protocol, tying keys included in messages relating to the protocol and used in a message tying processing, and generating data of a structure including nodes respectively corresponding to the extracted tying keys and links connecting between the nodes of the tying keys belonging to the same protocol: judging whether or not a loop is formed in the structure by the links; when it is judged that the loop is not formed in the structure, identifying, among allocation patterns that are combinations of allocation of the tying keys to each of plural tying processors, that respectively carry out the tying processing in cooperation with each other, an allocation pattern satisfying a first condition that a communication load between the tying processors is the minimum.

Abstract: An apparatus has a unit that receives plural messages, which belong to plural transactions and respectively have a pertinent transaction identifier, in an indefinite order; plural processors each having a queue storing the messages belonging to a transaction in charge, and outputting, after the messages belonging to one of the transactions in charge have become complete, the complete messages in the queue to a message processing unit; an allocation unit that outputs the received message to one of the plural processors, wherein one of the processors is identified based on the transaction identifier of the received message and an allocation rule predetermined for the transaction identifier; and a change unit that changes the allocation rule when activating or stopping the processor. When the change unit changes the allocation rule, each of the processors outputs at least messages for which re-allocation is necessary to the allocation unit.

Abstract: A server management system includes a management server and a mail server. The management server includes a source determination unit and an alert mail creator. The source determination unit determines as a source a symbol identifying a failure cause of a system according to the failure cause. The alert mail creator creates an alert mail with the source and with the system administrator of the system as a destination. The mail server sends the alert mail to a terminal device that the system administrator uses.

Abstract: A model-match-rate evaluating unit of a transaction monitoring device, which monitors a transaction system, evaluates a ratio of the number of transactions that match any models and respective processing times of all layers in the transaction are each within a corresponding normal range to the number of transactions observed per unit time as a model match rate. When the model-match-rate evaluating unit detects an abnormality of the system based on the model match rate, a suspicious-point-in-suspicious-model extracting unit of a transaction detail analyzing device extracts a point where a processing time deviates from the normal range as a suspicious point, a problematical-point evaluating unit evaluates a problem of each suspicious point as a problematical point, and a detail-analysis-result display unit displays an evaluation result of the problematical point and the suspicious point.

Abstract: In an information processing apparatus, a calculation unit retrieves data that indicates processing periods of processes executed in each time window constituting an analysis period. The calculation unit then calculates a total processing time for each time window by adding up processing times spent for execution of processes. The calculation unit also calculates a total progress quantity for each time window by adding up progress quantities of the processes. A determination unit determines, based on the total processing time and total progress quantity of each time window, a threshold of the total processing times at which the ratio of an increase of the total progress quantity to an increase of the total processing time is equal to or smaller than a predetermined value. A detection unit detects time windows whose total processing times are equal to or longer than the threshold.

Abstract: A processing time can be defined in a system including a plurality of computers for which the processing time is calculated, by displaying candidates of paths corresponding to flow of a series of processings as to transmission and reception of each message based on transmission and reception of messages among a plurality of computers; receiving an input that selects one path among the displayed candidates; and creating a processing time in each of computers in the flow of a series of processings as to transmission and reception of messages based on the received input.

Abstract: To which method on each method call order pattern included in a series of application codes executed in response to a request a method included in an application code executed in response to a request corresponds is detected; a code is generated based on identification information corresponding to the detected method on the call order pattern; and the generated code is inserted to the application code.

Abstract: A tied server includes a first storage unit that stores appearance patterns of messages having a transaction identifier to identify a transaction. The tied server also includes a second storage unit that stores messages executed on the transaction DB server having the transaction ID by the application server and communicated between an application server and a DB server. The tied server classifies the messages stored in the second storage unit with respect to each transaction based on the appearance patterns of the messages stored in the first storage unit.

Abstract: A method for use in a computer including a storage to store a trace record including a pair of a key character string and a value in a message and a message that has not yet been subjected to linking. The method includes identifying, from a received message or trace information received from a different linking apparatus, pairs of a key character string and the value thereof, pairs of a key character string and a value included in messages that have not yet been subjected to linking and that are to be subjected to linking and registering the identified pairs in the storage.

Abstract: A linkage support system links related messages among a plurality of messages sent and received among a plurality of communication terminals. The linkage support system includes an information acquisition unit that acquires message types of the plurality of messages, character strings included in the plurality of messages, and amount of data flow when the character strings are transferred. An unnecessary character strings exclusion unit that excludes character strings that are not required as keywords for linkage processing, based on the information acquired by the information acquisition unit, and a processing order determination unit determines order for using a plurality of character strings from which unnecessary character strings are excluded by the unnecessary character strings exclusion unit.

Abstract: A method for identifying a key for associating messages include: extracting attribute values for a first attribute, which are included in messages, and appearance times of the messages, from a message storage unit storing messages, each including one or plural attribute values for one or plural attributes, and appearance times of corresponding messages; calculating, for each of the extracted attribute values for the first attribute, a difference between an earliest appearance time and a latest appearance time among the appearance times of the messages including a corresponding attribute value; determining whether or not a ratio of differences that are shorter than a predetermined period is equal to or greater than a predetermined threshold; and upon determining that the ratio is not less than the predetermined threshold, storing data representing the first attribute is a candidate of a key for associating the messages stored in the message storage unit.

Abstract: An analyzing apparatus extracts a plurality of sequence candidates for communications related to unauthorized access performed between a plurality of information processing apparatuses on a basis of communication histories stored in a storage unit storing the communication histories between the plurality of information processing apparatuses. The apparatus calculates and outputs an evaluation value representing a degree of probability that the respective plurality of sequence candidates are unauthorized accesses on a basis of normality of a transaction which is restorable by a second communication history excluding a first communication history corresponding to each of the plurality of sequence candidates, among the communication histories stored in the storage unit.

Abstract: An apparatus receives messages having a linking keyword for identification of a transaction, classifies the received messages in terms of transaction using message patterns and the linking keyword. It compares a series of messages associated with the transaction with the message patterns. It makes a decision as to whether the series of messages associated with the transaction matches any one of the message patterns. It creates a record including an identifier for the transaction and the linking keyword. It searches for the unclassified messages based on the linking keywords contained in the unclassified messages, and identifies the record containing the identical linking keyword. It stores the identifiers for the unclassified messages into a linked candidate list in a corresponding manner to linked candidate transactions. It adds the unclassified messages to the message pattern which corresponds to the linked candidate transaction to create a new message pattern.

Abstract: A method for use in a computer including a storage to store a trace record including a pair of a key character string and a value in a message and a message that has not yet been subjected to linking. The method includes identifying, from a received message or trace information received from a different linking apparatus, pairs of a key character string and the value thereof, pairs of a key character string and a value included in messages that have not yet been subjected to linking and that are to be subjected to linking and registering the identified pairs in the storage.

Abstract: A trouble-factor detecting device retrieves data packets on a transaction, determines whether the retrieved data is abnormal, and counts an access count and an abnormality count of the data in associated with each of resources that is accessed in the transaction. Moreover, the trouble-factor detecting device calculates an abnormality ratio of each of the resources based on the access count and the abnormality count, and selects a trouble factor that could cause a trouble in the system to be managed based on the abnormality ratio.

Abstract: A processing time can be defined in a system including a plurality of computers for which the processing time is calculated, by displaying candidates of paths corresponding to flow of a series of processings as to transmission and reception of each message based on transmission and reception of messages among a plurality of computers; receiving an input that selects one path among the displayed candidates; and creating a processing time in each of computers in the flow of a series of processings as to transmission and reception of messages based on the received input.

Abstract: A model-match-rate evaluating unit of a transaction monitoring device, which monitors a transaction system, evaluates a ratio of the number of transactions that match any models and respective processing times of all layers in the transaction are each within a corresponding normal range to the number of transactions observed per unit time as a model match rate. When the model-match-rate evaluating unit detects an abnormality of the system based on the model match rate, a suspicious-point-in-suspicious-model extracting unit of a transaction detail analyzing device extracts a point where a processing time deviates from the normal range as a suspicious point, a problematical-point evaluating unit evaluates a problem of each suspicious point as a problematical point, and a detail-analysis-result display unit displays an evaluation result of the problematical point and the suspicious point.

Abstract: This message tying processing method include: extracting tying keys from a key definition database storing, for each protocol, tying keys included in messages relating to the protocol and used in a message tying processing, and generating data of a structure including nodes respectively corresponding to the extracted tying keys and links connecting between the nodes of the tying keys belonging to the same protocol: judging whether or not a loop is formed in the structure by the links; when it is judged that the loop is not formed in the structure, identifying, among allocation patterns that are combinations of allocation of the tying keys to each of plural tying processors, that respectively carry out the tying processing in cooperation with each other, an allocation pattern satisfying a first condition that a communication load between the tying processors is the minimum.