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 node determination method includes: associating a function with each of a plurality of nodes; calculating, by inputting a key for identifying specific data to each of the functions, a function value of the each of the functions; determining, on the basis of magnitude relation of the calculated function values, nodes for storing the specific data; and outputting a result of the determination.

Abstract: This method includes, in response to receipt of a snapshot request from a first node that receives an instruction to obtain a snapshot, identifying transactions in progress; transmitting data representing states of the identified transactions in progress to the first node; after the identifying, carrying out a first processing to prevent the transactions in progress from normally completing; receiving a list of first transactions whose results are reflected to snapshot data or a list of second transactions whose results are not reflected to the snapshot data; and executing copy-on-write on a basis of a specific time after removing the first transactions from among transactions to be processed in the first processing and confirming that the respective first transactions are normally completed or cancelled.

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: An information processing device verifies an update function. An initialization section creates, when an initialization function is called, verification-use data being a replica of original data. An update section updates, when an update function is called, the original data using the update function, and sequentially stores an argument of the update function to an update history. A reference section additionally stores, to the update history, when a reference function is called, at least one of the arguments selected from those in the update history in accordance with predetermined rules, and stores the arguments in the update history in the verification-use data while sequentially applying the arguments to the update function. An error section makes a comparison between the original data and the verification-use data including the arguments and, when there is a difference therebetween, executes a predetermined error process.

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 computer-readable recording medium stores therein a distributed storage managing program that causes a computer to execute obtaining a quantity M, the quantity M being a quantity of classes to which files are to be allocated; allocating, according to a predetermined algorithm, the files to the classes of the quantity M obtained at the obtaining; and allocating, by class and to storage apparatuses of a second quantity that is different from a current quantity of storage apparatuses, the files allocated to the classes of the quantity M at the allocating of the files to the classes, when a quantity of storage apparatuses used to store the files is changed from the current quantity to the second quantity.

Abstract: A method of manufacturing an air permeable electrocast shell comprising forming a conductive layer on the surface of a model, placing a layer of elutable particles into close contact with the surface of the conductive layer and effecting an electrocasting treatment to deposit metal between the conductive layer and the particles, except for the points of contact between the conductive layer and the particles, and between adjoining particles. The deposit of the metal is controlled so that the thickness of the electrocast shell is less than that of the particle layer. Thereafter, the particles are eluted from the electrocast shell to form innumberable fine vent holes which open at both surfaces of the electrocast shell.

Abstract: A vacuum mold for vacuum-forming a plastic sheet heated to a high temperature to transfer grain patterns onto the surface of the plastic sheet, the mold comprising an electrocast shell formed, by an electroforming step, with a casting surface having the grain patterns thereon and a multitude of fine vacuum holes uniformly distributed at the casting surface. A back-up body is mounted at the rear surface of the electrocast shell and is provided with vent holes communicating with the vacuum holes in the shell.