Abstract: 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.

Abstract: A non-transitory computer-readable storage medium storing therein a program that causes a computer to execute a process includes managing a data processing by a processing target node among a plurality of nodes in which respective nodes have relations with other nodes, the processing target node being traced from a start node on the basis of the relations, and calculating a total number of nodes linked to the start node on the basis of numbers of stages indicating distances of processed nodes and the processing target node from the start node, and numbers of branches from the processed nodes and the processing target node, while the processing target node performs the data processing.

Abstract: A plurality of computers dispersedly store pieces of data and pieces of depository information of the respective pieces of data. The depository information indicates a depository computer storing data of the pieces of data. A first computer of the plurality of computers stores, when depository information of first data is absent in a first storing unit of the first computer, first depository information in the first storing unit. The first depository information indicates the first computer as a first depository computer storing the first data. The first data is stored in a second storing unit of the first computer. The first computer identifies, by searching the first storing unit, a second computer as a second depository computer storing second data to be manipulated in association with third data stored in the second storing unit.

Abstract: A storage section stores segment information indicative of the correspondences between segments and keys. A control section divides, according to an increase in data which belongs to a segment, the segment into a plurality of segments and updates the segment information. In addition, the control section allows data that belongs to at least one of a plurality of second segments obtained by dividing a first segment once or by hierarchically dividing the first segment N (N>1) times, at the time of the N meeting a determined condition, to be moved from a storage device which stores data that belongs to the first segment to another storage device. The control section restricts the movement of data at the time of the N not meeting the determined condition.

Abstract: A first node is assigned a first data group, and a second node is assigned a second data group. In addition, the second node manages a backup copy of the first data group. The second node receives, from the first node, a log indicating an instruction executed on a data record belonging to the first data group, and stores the received log in a memory of the second node. The second node writes logs for a plurality of instructions accumulated in the memory into a storage device of the second node different from the memory when a predetermined condition is satisfied.

Abstract: A computer-readable recording medium storing a data processing program that causes a computer of a group of mutually communicable computers to execute, an acquisition procedure configured, when a processing request for an arbitrary data is inputted, to acquire the number of replicas set in the arbitrary data, a selection procedure configured to select computers, which serve as arrangement destinations of the arbitrary data and are as many as the number of replicas, from the computers of the computer group by using a predetermined algorithm, a transmission procedure of the number of replicas, configured to transmit the number of replicas of the arbitrary data, which number is acquired by the acquisition procedure, to all the computers of the computer group, and a processing request transmission procedure configured to transmit the processing request to each the computers that are selected by the selection procedure and as many as the number of replicas.

Abstract: An information processing apparatus includes a first storage device that stores in a first storage area a first data group that includes a first plurality of data to be processed successively, and stores in a second storage area a second data group that includes a second plurality of data to be processed successively, a second storage device that includes a third storage area that stores a command to access data stored in the first storage area and a fourth storage area that stores a command to access data stored in the second storage area, and a processor configured to store, in a corresponding storage area of the third storage area and the fourth storage area, a received command, select one of the third storage area and the fourth storage area, and process one or more command stored in a selected storage area.

Abstract: By transmitting information on a condition enabling execution of one service to a resource broker that manages an assignment state of a resource node used among services, a resource node enabling execution of one service out of resource nodes used among services is specified. And by receiving information on use state of the resource node out of the specified resource nodes and based on the information on the received use state, a resource node used for one service out of specified resource nodes is determined.

Abstract: In one embodiment, a method for migrating a virtual machine (VM) under operation from one server to another server among a plurality of servers is provided. The method includes providing a schema defined beforehand by an operator, an Application-dependent policy using the schema, and an total optimization policy to optimize the system totally, receiving periodically a status information for the application on the VM and a static or dynamic information for the server and the VM from each server, judging whether there is any VM to migrate to another server by referring to the application-dependent policy and the total optimization policy, based on the status information of the application and the static or dynamic information of the VM, and determining a migration destination of the VM matched with the migration condition.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A disclosed information processing system includes a receiving node and a storing node, the receiving node includes an order information adding unit that adds first order information to operation instructions included in an operation instruction sequence, the first order information indicating an order among the operation instruction sequences and an operation instruction transmission unit that transmits the one or more operation instructions to the storing node, the storing node includes an operation instruction execution unit that executes the operation instructions. Further, upon a receipt of a second operation instruction having the first order information indicating that the second operation instruction is earlier than the one or more first operation instructions, which was already executed, in the first order relationship, the storing node re-executes the first operation instruction after the second operation instruction is executed.

Abstract: 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.

Abstract: A computer-readable recording medium storing a data processing program that causes a computer of a group of mutually communicable computers to execute, an acquisition procedure configured, when a processing request for an arbitrary data is inputted, to acquire the number of replicas set in the arbitrary data, a selection procedure configured to select computers, which serve as arrangement destinations of the arbitrary data and are as many as the number of replicas, from the computers of the computer group by using a predetermined algorithm, a transmission procedure of the number of replicas, configured to transmit the number of replicas of the arbitrary data, which number is acquired by the acquisition procedure, to all the computers of the computer group, and a processing request transmission procedure configured to transmit the processing request to each the computers that are selected by the selection procedure and as many as the number of replicas.

Abstract: 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.

Abstract: It is intended to provide methods for suppressing the huntington gene expression by using a double-stranded RNA (dsRNA), huntington gene expression inhibitors to suppress the huntington gene expression, and preventives and/or remedies of Huntington's disease. Targeting against a specific sequence of mRNA at immediately upstream of CAG repeats in HD genes of Huntington's disease, the huntington gene expression is suppressed by using a dsRNA homologous to the sequence. In this invention, a short siRNA (short double-stranded RNA) having bp as short as around 21-23 bp can be effectively used as the dsRNA homologous to a specific RNA sequence in a region at immediately upstream of CAG repeats. The dsRNA of this present invention can be used as a huntington gene expression inhibitor, or a preventive and/or a remedy of Huntington's disease by administering or introducing into a living body or a living cell in mammals for the prevention and/or treatment of Huntington's disease.

Abstract: In one embodiment, a method for migrating a virtual machine (VM) under operation from one server to another server among a plurality of servers is provided. The method includes providing a schema defined beforehand by an operator, an application-dependent policy using the schema, and an total optimization policy to optimize the system totally, receiving periodically a status information for the application on the VM and a static or dynamic information for the server and the VM from each server, judging whether there is any VM to migrate to another server by referring to the application-dependent policy and the total optimization policy, based on the status information of the application and the static or dynamic information of the VM, and determining a migration destination of the VM matched with the migration condition.

Abstract: By transmitting information on a condition enabling execution of one service to a resource broker that manages an assignment state of a resource node used among services, a resource node enabling execution of one service out of resource nodes used among services is specified. And by receiving information on use state of the resource node out of the specified resource nodes and based on the information on the received use state, a resource node used for one service out of specified resource nodes is determined.

Abstract: It is intended to provide methods for suppressing the huntingtin gene expression by using a double-stranded RNA (dsRNA), huntingtin gene expression inhibitors to suppress the huntingtin gene expression, and preventives and/or remedies of Huntington's disease. Targeting against a specific sequence of mRNA at immediately upstream of CAG repeats in HD genes of Huntington's disease, the huntingtin gene expression is suppressed by using a dsRNA homologous to the sequence. In this invention, a short siRNA (short double-stranded RNA) having bp as short as around 21-23 bp can be effectively used as the dsRNA homologous to a specific RNA sequence in a region at immediately upstream of CAG repeats. The dsRNA of this present invention can be used as a huntingtin gene expression inhibitor, or a preventive and/or a remedy of Huntington's disease by administering or introducing into a living body or a living cell in mammals for the prevention and/or treatment of Huntington's disease.