Fujitsu Corporation

Nobutaka Imamura

Hidekazu Takahashi

Yoshinori Sakamoto

Miho Murata

Yuichi Tsuchimoto

Toshiaki Saeki

Hiromichi Kobashi

Kenji Kobayashi

Soichi Shigeta

Yasuo Yamane

Hiroki Moue

Masazumi Matsubara

Toshihiro Shimizu

Hiroaki Ishihata

Akira Ura

Yusuke Koyanagi

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.

Search point determining method and search point determining apparatus

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.

Apparatus and method for processing data

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.

Distributed processing system and control method

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.

Data processing management method and information processing apparatus

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.

Event management method and distributed system

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.

Server device, computer-readable storage medium and movement control method

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.

Process cooperation method, process cooperation program, and process cooperation system

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.

Communication method and information processing system

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.

Server device, computer-readable storage medium, and method of assuring data order

An arrangement device includes an acquisition unit, a specifying unit, and a determination unit. The acquisition unit acquires information representing the number of times of communication between queries executed in a plurality of devices in which the plurality of queries are arranged, the query being used for performing processes when data meets set conditions. The specifying unit specifies a set of queries based on the number of times of communication that is represented by the information acquired by the acquisition unit. The determination unit determines to arrange the set of queries specified by the specifying unit in a same device.

Apparatus and method for arranging query

Each of plurality of nodes connected to each other via a network includes a local instance processor and a user application processor. The local instance processor executes a data sharing method for accessing shared data. The data sharing method includes: storing a value of first shared data with a function identifier of an update function upon receiving a registration request, wherein the update function is commutative and idempotent; updating the stored value of the first shared data to a first update value in accordance with an execution result of the update function upon receiving an update request; returning a completion message upon updating the stored value of the first shared data stored in the first node; and transmitting a first reflection request to a second node upon updating the stored value of the first shared data stored in the first node.

Computer-readable medium storing data sharing program, data sharing method, and data sharing processor

A clock determination method executed by a first one of apparatuses included in a system includes receiving a list including first definite clock values of respective apparatuses, the list being circulated among the apparatuses; determining the first clock value of the first apparatus at a point in time based on a smallest of logical clock values regarding corresponding commands on which processing is not completed, the commands being included in commands received by the first apparatus and the logical clock values being obtained at a time of receiving the corresponding commands and being stored, and updating the first clock value, the updated first clock value being included in the list, by using the determined first clock value; specifying, as a second clock value for the system, a smallest of the first clock values included in the updated list; and transmitting the updated list to a second one of the apparatuses.

Method for determining definite clock and node apparatus

A first node apparatus included in a distributed data store acquires first operation information and a first timestamp corresponding to target data. The first operation information specifies a first operation to be executed on the target data. The first timestamp indicates a first receipt time of the first operation information. The first node apparatus determines whether the first receipt time is earlier than some of second receipt times on the basis of second timestamps and the acquired first timestamp. The second timestamp indicates the second receipt time of second operation information. The second operation information specifies a second operation executed on the target data. The first node apparatus re-executes the second operations together with the first operation on the target data in the order of the receipt time when it is determined that the first receipt time is earlier than some of the second receipt times.

Information processing method and information processing apparatus

A relay apparatus includes: a tag information acquisition section that acquires tag information attached to the network-connected device; a management section that manages the tag information read out by the tag information acquisition section and an IP address assigned by the management apparatus, and an identification information assigned to the relay apparatus itself in association with one another; and a processing section that receives information that the management apparatus has transmitted with the tag information or IP address as a transmission destination and receives information transmitted from the network-connected device for execution of predetermined processing.

Relay apparatus, relay program, relay method, and management system for managing devices connected to network

A first storing unit stores therein a chain indivisibility instruction. A detecting unit detects a change of first data that is distributed in a node computer. A first designating unit designates, when the detecting unit detects the change in the first data, an indivisibility instruction corresponding to the first data from which the change is detected, by referring to the first storing unit. A first executing unit executes the indivisibility instruction designated by the first designating unit.

Relay node communication interface transmitting update packet to higher node by executing chain indivisibility instructions upon receiving data change notification from lower node

Growing community of inventors

Yokohama, Japan

Nobutaka Imamura