Abstract: An access control method includes: in response to a first access instruction that instructs accessing first data, reading the first data and second data from a storage and deleting the first data and the second data from the storage, the first data being read from a first storage area, the second data being read from a second storage area that is physically adjacent to the first storage area and is not an empty area; and in response to a second access instruction that instructs writing third data to the storage, writing the third data to a third storage area that is adjacent to a storage area located in a physically rearmost position among storage areas in which data has been stored in the storage.

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: A storage control apparatus includes a processor. The processor is configured to detect a dependency relationship between a first data access and a second data access made after passage of a delay time from the first data access. The first data access is made to a first storage area in a first storage device. The second data access is made to a second storage area in the first storage device. The processor is configured to transfer, when a current data access is made to the first storage area in a state in which the dependency relationship is detected, data in the second storage area to a second storage device before the delay time passes. The second storage device has a higher access speed than the first storage device.

Abstract: From unit storage areas each having a certain size in a first storage device, an extraction unit extracts, at certain time intervals, a monitored area formed by consecutive unit storage areas having been accessed at least a predetermined number of times that is greater than zero and being similar to each other in the number of times of access. When detecting movement between the positions of same-sized monitored areas among the extracted monitored areas over time, a prediction unit determines a predicted storage area predicted to be accessed in the storage area of the first storage device on the basis of the direction of the movement between the positions of the same-sized monitored areas, and performs a control operation so that the content of the predicted storage area is copied to a second storage device that provides faster access than the first storage device.

Abstract: For segments having the number of IOs exceeding a threshold, a data collection unit connects adjacent segments whose distance is within “s” to each other and extracts the connected segments and segments in the range of “s” from outside of the connected segments as an n_segment. A workload analysis unit then determines a target whose data is moved from an HDD to an SSD in units of n_segments.

Abstract: A storage controlling apparatus includes a processor that monitors a response performance to an inputted request regarding a plurality of unit regions obtained by dividing a storage region of the first storage apparatus in a predetermined size, divides, in a moving process for moving data stored in a unit region, which is a movement target, of the first storage apparatus to a second storage apparatus having a performance different from that of the first storage apparatus, the unit region of the movement target into a plurality of divisional regions by a predetermined division number and moves the data to the second storage apparatus in a unit of the divisional region, and changes the predetermined division number based on a first response performance during execution of the monitored moving process.

Abstract: A storage apparatus is provided, including a first storage device; a second storage device having an access speed higher than an access speed of the first storage device; a monitor that monitors a write access load for the first storage device; a comparator that compares the write access load for the first storage device monitored by the monitor, with a load threshold; and a switch that causes write access target data to be written into the first and second storage devices, when it is determined by the comparator that the write access load for the first storage device does not exceed the load threshold, while causing the write access target data to be written into the first storage device, when it is determined by the comparator that the write access load for the first storage device exceeds the load threshold.

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: 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: An information processing device includes a processor. The processor is configured to allocate a plurality of allocation unit areas to a virtual volume from a first storage device and a second storage device. The processor is configured to generate evaluation information related to access for each of a plurality of divided areas into which each of the plurality of allocation unit areas is divided. The processor is configured to determine based on the generated evaluation information, when allocation to the virtual volume is changed from a first allocation unit area of the first storage device to a second allocation unit area of the second storage device, a first data transfer order of transferring data in divided area units from the first allocation unit area to the second allocation unit area. The processor is configured to transfer the data in accordance with the first data transfer order.

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 apparatus is connected to a first storage and a second storage which is accessed at an access speed lower than an access speed of the first storage. The apparatus accesses each of blocks stored in the second storage, and counts, for each of the blocks, the number of accesses made for the each block. The apparatus determines, based on the number of accesses that has been counted for each of the blocks, a transfer target block that is a target which is to be transferred from the second storage to the first storage, and determines a transfer time at which transfer of the transfer target block is to be performed. The apparatus transfers the determined transfer target block to the first storage at the determined transfer time.

Abstract: An apparatus connected to first and second storages performs data transfer between the first and second storages for a plurality of times with different data sizes, and measures a transfer time defined as a transfer interval time for data transfer of each of the plurality of times. The apparatus identifies a maximum size data indicating a maximum data size for data transfer between the first and second storages, based on the transfer time and the data size for data transfer of each of the plurality of times. When data transfer is performed between the first and second storages, the apparatus divides transfer target data for the data transfer into plural pieces of divided data, based on the maximum size data, and outputs, for each of the plural pieces of divided data, a data transfer request for requesting the apparatus to perform data transfer between the first and second storages.

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: For segments having the number of IOs exceeding a threshold, a data collection unit connects adjacent segments whose distance is within “s” to each other and extracts the connected segments and segments in the range of “s” from outside of the connected segments as an n_segment. A workload analysis unit then determines a target whose data is moved from an HDD to an SSD in units of n_segments.

Abstract: A first memory unit stores requester event information pieces each including time information indicating an occurrence time of an event associated with a process executed by a first server. A second memory unit stores request-destination event information pieces each including time information indicating an occurrence time of an event associated with a process executed by a second server in response to a request from the first server. A determining unit determines, for each request-destination event information piece, a correction allowable range of the time information by comparing the time information of the request-destination event information pieces with that of the requester event information pieces.

Abstract: A storage system includes: a first storage unit; a second storage unit that has an access speed higher than an access speed of the first storage unit; and a storage controller that collects load information about respective loads in a plurality of areas in the first storage unit, selects a candidate area in the first storage unit which is to be migrated, based on the collected load information, and migrates data in the selected candidate area, to the second storage unit.

Abstract: A first memory stores requester event records describing events that occurred in relation to processes executed in a first server. A second memory stores requestee event records describing events that occurred in relation to processes executed in a second server in response to execution requests issued from the first server. An associating unit searches the first and second memories for requester event records and requestee event records whose transaction identifiers are identical and associates the found records together. A determining unit compares the associated event records with each other in terms of their time information. Based on this comparison, the determining unit determines a correction value for correcting time differences between requester event records in the first memory and requestee event records in the second memory.

Abstract: A character string which is unique in each transaction and a character string common to different transactions are extracted from a message log obtained when the same transaction is processed for a plurality of number of times. Then, messages stored by practically operating an information system are associated with each transaction by utilizing these character strings, and the character string common to the transactions of which execution times overlap with each other is deleted, so that the remained character strings are provided as linking keywords.