Abstract: A search point determining method in an estimation process of a function, executed by a processor included in a search point determining apparatus, the method includes, calculating a search prediction time and a confidence interval upper limit obtained by using a Gaussian process for the function in each search candidate point from a past search result of the function, generating an area in a parameter space for each search candidate point by using a position of a search point close to the relevant search candidate point in a past search result, a search prediction time corresponding to each search candidate point, and a confidence interval upper limit corresponding to each search candidate point, and determining a search point based on a size of the area in a plurality of parameter spaces.

Abstract: A parameter selection method includes processing, performed by a computer, of: calculating a response surface that predicts an evaluation value, from evaluation values obtained from training data and sets of parameter values, which are stored in a memory; working out, from each of maximum evaluation values among the obtained evaluation values, shortest distances to a contour line defined at a position equal to or smaller than the maximum evaluation values on the calculated response surface; and specifying a set of parameter values farthest from the contour line, from among the shortest distances worked out for each of the maximum evaluation values.

Abstract: A search point determining method in an estimation process of a function, executed by a processor included in a search point determining apparatus, the method includes, calculating a search prediction time and a confidence interval upper limit obtained by using a Gaussian process for the function in each search candidate point from a past search result of the function, generating an area in a parameter space for each search candidate point by using a position of a search point close to the relevant search candidate point in a past search result, a search prediction time corresponding to each search candidate point, and a confidence interval upper limit corresponding to each search candidate point, and determining a search point based on a size of the area in a plurality of parameter spaces.

Abstract: An apparatus for processing data includes a processor configured to acquire size information on a size of first result data from a first node. The first result data is generated in first distributed processing executed by the first node on a first part of first input data for the first distributed processing executed by a plurality of nodes. The processor is configured to acquire data arrangement information for second distributed processing executed by the plurality of nodes. The processor is configured to generate a data arrangement instruction on basis of the size information and the data arrangement information. The data arrangement instruction defines an arrangement pattern of second result data generated in the first distributed processing executed by the plurality of nodes and stored in the plurality of nodes as the second input data. The processor is configured to transmit the data arrangement instruction to the plurality of nodes.

Abstract: A control method for controlling a distributed processing system that performs distributed processing using a plurality of devices is executed by a processor. The method including acquiring load information from each of the plurality of devices, identifying a source device and a destination device based on the acquired load information, the source device being a device of a migration source of an allocated processing operation and the destination device being a device of a migration destination of the allocated processing operation. The method further including selecting as a processing operation of a migration target from among a plurality of processing operations allocated to the source device, a processing operation with which a rate that data used by the processing operation at the source device is to be used at the destination device is relatively high or higher than a predetermined rate.

Abstract: A computer-readable recording medium storing therein a data deletion determining program is disclosed. Deletion effect information indicating effect degrees due to deletions of a plurality of sets of output data is generated based on process contents, output data information, and an execution time. The plurality of sets of output data are generated over a course of a plurality of processes acquiring a final result acquired through a plurality of processes from subject data. The process contents are related to each of the plurality of processes. The output information is accumulated in a memory for the plurality of sets of the output data. The execution time is taken for one or more of the processes until generating the output data. The output data to be deleted from the memory is extracted based on respective sets of the deletion effect information for the plurality of the sets of the output data.

Abstract: An apparatus for processing data includes a processor configured to acquire size information on a size of first result data from a first node. The first result data is generated in first distributed processing executed by the first node on a first part of first input data for the first distributed processing executed by a plurality of nodes. The processor is configured to acquire data arrangement information for second distributed processing executed by the plurality of nodes. The processor is configured to generate a data arrangement instruction on basis of the size information and the data arrangement information. The data arrangement instruction defines an arrangement pattern of second result data generated in the first distributed processing executed by the plurality of nodes and stored in the plurality of nodes as the second input data. The processor is configured to transmit the data arrangement instruction to the plurality of nodes.

Abstract: A computer-readable recording medium storing a data accumulation determination program is disclosed. A first cost and a second cost are calculated from a process content pertinent to a process for acquiring a final result by a plurality of processes. The process content includes a plurality of process contents respective to a plurality sets of output data generated in paths until the final result is acquired by the plurality of processes from subject data. The first cost corresponds to a cost for accumulating the output data in a repository. The second cost corresponds to a cost for generating the output data that are not accumulated in the repository. An accumulation necessity is determined for each of the plurality of sets of the output data based on the first cost and the second cost.

Abstract: First and second machines execute a plurality of distributed processes. A storing unit stores therein progress information of a process executed by the first machine. A calculating unit transmits the progress information to the second machine upon receiving a reassignment instruction indicating reassignment of the process to the second machine. The calculating unit transmits data to be used in the process to the second machine together with the progress information upon receiving the data during the transmission of the progress information. Upon receiving the progress information and the data, the second machine executes the process reassigned from the first machine using the progress information and the data.

Abstract: A first information processing apparatus executes a first process, while a second information processing apparatus executes a second process. The first information processing apparatus obtains a first issuance request produced by the first process. The first information processing apparatus also receives issuance timing information that the second information processing apparatus issues in response to a second issuance request from the second process. Based on this issuance timing information, the first information processing apparatus controls issuance timing of a timer event that is to be issued to the first process in response to the first issuance request.

Abstract: Each of slave nodes acquires data distribution information that is data distribution for each portion of processing target data that is subjected to distributed processing performed by each of the plurality of nodes. Then, each of the slave nodes monitors a process state of the distributed processing with respect to divided data obtained by dividing processing target data. Thereafter, each of the slave nodes that performs the monitoring changes, on the basis of the process state of the distributed processing and the data distribution information, the processing order of the divided data that is the processing target.

Abstract: A specification unit specifies a cycle in which data to be processed by queries is distributed, the queries being arranged at a node and movable between the nodes and performing a processing when the data matches with a set condition. An instruction unit instructs a node as a movement source to move the queries during a period when the data to be processed by the queries to be moved is not distributed on the basis of the specified cycle.

Abstract: A computer monitors a relevance ratio between pieces of data based on a frequency of access to a pair for each of the pairs of the pieces of data consecutively accessed in response to a request for access to a storage device storing a plural pieces of data, determines whether the pair is a pair having a relevance ratio representing a specified tendency, on the basis of tendencies of the monitored relevance ratios of the pairs, groups the plural pieces of data according to a result of the determining and the relevance ratio, and specifies data to be arranged in each group.

Abstract: A process cooperation method includes storing in a first storage device a first process result as a result of execution of a first process by a first processor and transmitting the first process result to a second processor, storing in a second storage device a second process result as a result of execution of a second process by the second processor based on the first process result received from the first processor, and transmitting the second process result to a third processor, and moreover transmitting the second process result and an identifier identifying the third processor to the first processor, and storing in the first storage device the second process result and the identifier received from the second processor by the first processor in association with the first process result.

Abstract: A first information processing apparatus executes a first process, while a second information processing apparatus executes a second process. The first information processing apparatus obtains a first issuance request produced by the first process. The first information processing apparatus also receives issuance timing information that the second information processing apparatus issues in response to a second issuance request from the second process. Based on this issuance timing information, the first information processing apparatus controls issuance timing of a timer event that is to be issued to the first process in response to the first issuance request.

Abstract: A system that includes circuitry configured to receive a plurality of pieces of data; store, for each of the plurality of pieces of data in a first memory area, a first identifier and associated node information identifying a node that processes associated piece of data; delete one of the first identifiers from the first memory area in a case that a number of first identifiers stored in the first memory area reaches a threshold; generate a second identifier based on deleted first identifier by applying a predetermined calculation on the deleted first identifier, the second identifier being shorter than the first identifier; store, in a second memory area, the second identifier and the associated node information; cause a node, associated with one of the first identifier and the second identifier stored in one of the first and second memory area, to process one of the plurality of pieces of data.

Abstract: A communication method in an information processing system including a group of first information processing apparatuses that transmit data and a group of second information processing apparatuses that receive the data is disclosed. The communication method includes storing data subject to being transmitted to one of the second information processing apparatuses in a data storage by associating the data with identifier information of the second information processing apparatus, and performing transmission processing to transmit the stored data to the second information processing apparatus in response to reception of a first token generated by the second information processing apparatus serving as a generating source of the first token, the first tokens indicating a transmission right to transmit the data to the second information processing apparatus and being transferred between the group of the first information processing apparatuses and between the group of the second information processing apparatuses.

Abstract: A stop unit stops transmitting data to a plurality of nodes for every predetermined period. An acquisition unit acquires versions of routing tables, which are updated in accordance with movement of a query, from the plurality of nodes when the transmission of the data is stopped. A comparison unit compares the versions of the routing tables of the plurality of nodes that are acquired. When there is a node in which the routing table of an old version is stored as a result of the comparison, an update unit updates the routing table of the node.

Abstract: A process cooperation method includes storing in a first storage device a first process result as a result of execution of a first process by a first processor and transmitting the first process result to a second processor, storing in a second storage device a second process result as a result of execution of a second process by the second processor based on the first process result received from the first processor, and transmitting the second process result to a third processor, and moreover transmitting the second process result and an identifier identifying the third processor to the first processor, and storing in the first storage device the second process result and the identifier received from the second processor by the first processor in association with the first process result.

Abstract: A control method for controlling a distributed processing system that performs distributed processing using a plurality of devices is executed by a processor. The method including acquiring load information from each of the plurality of devices, identifying a source device and a destination device based on the acquired load information, the source device being a device of a migration source of an allocated processing operation and the destination device being a device of a migration destination of the allocated processing operation. The method further including selecting as a processing operation of a migration target from among a plurality of processing operations allocated to the source device, a processing operation with which a rate that data used by the processing operation at the source device is to be used at the destination device is relatively high or higher than a predetermined rate.