Abstract: An internode put requesting unit detects a time-out with respect to a put request issued to the next node in the order of a multiplexing chain and notifies a put/get executing unit of the time-out. The put/get executing unit sends an error to the previous node in the order of the multiplexing chain or a client and instructs a put-failed-data synchronizing unit to synchronize data failed to be put, and the put-failed-data synchronizing unit performs a synchronization process. A primary makes other put requests wait until completion of the synchronization process. Furthermore, when having received the error, the client issues a get request to the tail end of the multiplexing chain.

Abstract: Multiple storage apparatuses are provided, at least part of which are individually incorporated into one of storage groups. Each of multiple control apparatuses is configured to, when assigned one or more of the storage groups each including one or more of the storage apparatuses, control data storage by storing data designating each assigned storage group redundantly in the storage apparatuses of the assigned storage group. An information processing apparatus is configured to, when a storage group with data redundancy being lost is detected, make a change in control apparatus assignment for the storage groups in such a manner that a storage group different from the detected storage group is not assigned to a control apparatus with the detected storage group assigned thereto. Subsequently, the information processing apparatus causes the control apparatus to execute a process of restoring the data redundancy of the detected storage group.

Abstract: A storage system having a plurality of storages. The each of the storages include a memory and a processor coupled to the memory. The processor executes a process including transmitting an update request for data which is commonly stored in the plurality of storages according to a predetermined transmission order indicating a path to transfer the update request. The process includes updating data when receiving an update request from another storage. The process includes changing the predetermined transmission order to a transmission order in which one or more storages included in the path are excluded according to the number of times the update request for the data is received.

Abstract: An information processing system includes: CPUs; storage devices; switches; dummy storage devices which are with respective storage devices and each of which sends, when receiving an identifying information request, its own identifying information back to a sender of the identifying information request; and dummy CPUs which are associated with respective CPUs and each of which tries to, when receiving an instruction for acquiring identifying information from a dummy storage device, acquire the identifying information of the dummy storage device by transmitting the identifying information request, and sends the identifying information as response information back to a sender device of the acquiring instruction.

Abstract: A storage management apparatus manages a plurality of storage apparatuses in a storage system that disperses and stores data that is made redundant so as to have a predetermined redundancy level. The storage management apparatus includes: a patrol process unit that performs, at a patrol speed, a patrol process of confirming that the plurality of storage apparatuses are being operated normally; a relocating process unit that performs, at a relocating process speed, a relocating process of moving the data between the plurality of storage apparatuses; a recovery process unit that performs, at a recovery process speed, a recovery process of recovering the redundancy level of the data when a fault occurs in the plurality of storage apparatuses; and a processing speed control unit that controls the recovery process speed or a sum of the patrol process speed and the relocating process speed to have a predetermined value.

Abstract: A data existence judging device includes: L number of first storage areas each associated with one of L hash values; M number of second storage areas each associated with some of the L hash values; an information setting part, for each data in a data set, to calculate k hash values about the data, and, for each calculated hash value, when a count value in the first storage area associated with the calculated hash value is less than 2n?1, to count up the count value, whereas when the count value is 2n?1, to set 1 into the first storage area associated with the calculated hash value; and a judging part to calculate k hash values about an input data, and to judge that the input data is a new data when a count value in the first storage area associated with the input data is 0.

Abstract: A storage method and system where the storage system includes a plurality of servers and a control server configured to select a storage area available to be used by each of the servers from among storage areas of a group of storage devices sharable among the plurality of servers. The system includes, a detecting unit configured to detect an available capacity of a specified storage device other than the storage group, where the specified storage device is designated for use only by a specified server selected from among the servers, a specifying unit configured to specify an available area corresponding to the available capacity detected from the specified storage device through the detecting unit, and a setting unit configured to set the specified available area to a shared storage area that is available to be shared among the server.

Abstract: An access method includes: obtaining, by a computer, a result of monitoring a busy rate and a number of access operations per unit time of a storage device, the storage device having a first storage area and a second storage area; calculating a characteristic of correlation between the busy rate and the number of access operations per unit time based on the result; calculating a second number of access operations per unit time based on the characteristic of the correlation such that a sum of a first busy rate corresponding to a first number of access operations per unit time and a second busy rate corresponding to a second number of access operations per unit time becomes equal to or lower than a given busy rate; and controlling a number of operations to access the second storage area per unit time based on the second number of access operations.

Abstract: A control method for a control device which connects, via a connecting device, each of a plurality of processors that each executes processing to at least one of a plurality of memory devices that each stores data, the control method comprises controlling the connecting device so that a second memory device, which is one of the plurality of memory devices, is connected to the first processor in response to a connect request issued by a first processor, which is one of the plurality of processors, since a predetermined amount of data has been written into a first memory device, which is one of the plurality of memory devices, the control device; and controlling the connecting device so that the first memory device is disconnected from the first processor in response to a disconnect request issued by the first processor after starting to write data into the second memory device.

Abstract: A data management apparatus sends specific data and key information corresponding to the specific data to another apparatus, when executing a process to change a storage destination of the specific data in which the hash value obtained by applying a predetermined hash function to corresponding key information belongs to a certain range, from the data management apparatus to the other apparatus, and sends the identification information of the other apparatus stored in correspondence with the certain range to a request source of an operation request, when the operation request with respect to data corresponding to key information is received after the process.

Abstract: An information processing apparatus includes a first storage unit and a processor. The first storage unit includes a first storage area. The processor receives a first request to write first data into the first storage area. The processor requests an external apparatus to write the first data into a second storage area in a second storage unit included in the external apparatus. The processor determines whether a first response has been received from the external apparatus. The first response indicates that the first data has been written into the second storage area. The processor writes the first data into the first storage area when the first response has been received. The processor requests, without writing the first data into the first storage area, the external apparatus to write second data stored in the first storage area into the second storage area when the first response has not been received.

Abstract: Nodes respectively store a multilayer transposed Bloom filter. A client selects a node N1 from among the group of nodes and transmits a search request to the node N1. Upon receiving a reply from the node N1, the client determines whether the received search result indicates “positive”. If the search result is not positive, the client selects in order of node number, a node N2 and transmits a search request to the node N2. Upon receiving a reply from the node N2, the client determines whether the received search result indicates “positive”. Upon determining that the search result is positive, the client outputs the search result and ends the search notification process.

Abstract: A method of managing storage implemented in a storage management device that manages storage to which access for information is made by a requesting processing apparatus, including randomly obtaining a prescribed number of data units from among data units that constitute the information from the storage, calculating a sample unit duplication ratio, which is a ratio at which the obtained data units duplicate each other, estimating an overall data unit duplication ratio, which is a ratio at which all data units stored in the storage duplicate each other, by using a prescribed function that utilizes the calculated sample unit duplication ratio, and outputting the estimated overall data unit duplication ratio to an output device.

Abstract: A non-transitory computer-readable recording medium stores therein a charge calculating program that causes a computer that manages a database of different data items to execute recording for each data item, information indicating the number of clients that receive the data item; extracting from the information recorded at the recording and for each data item to be received by a given client, information indicating the number of clients receiving the data item; calculating charges for the given client, based on the extracted information; and outputting the calculated charges.

Abstract: A storage apparatus includes a storing unit that stores a Bloom filter in which data characteristic values are registered, the data characteristic values extracting properties of data that are stored in areas into which a storage area is divided; and a processor that is configured to judge whether a first data characteristic value extracting a property of a first data that is to be written into the storage area is registered in the Bloom filter, and write the first data into the storage area, when the first data characteristic value is not registered in the Bloom filter.

Abstract: A first information processing apparatus transmits a message storing a replica of data stored in the first information processing apparatus. The message has an unspecified destination. A first relay apparatus detects a second information processing apparatus provided in a network to which the first relay apparatus belongs. The first relay apparatus selects, as a transfer destination of the message, the second information processing apparatus or a second relay apparatus upon receiving the message. The first relay apparatus transfers the message to the selected transfer destination. The second information processing apparatus stores the replica therein upon receiving the message.

Abstract: A storage system is disclosed that stores data across plural storage devices. The storage system includes plural modules. Each of the modules includes a storage device including a data storage section that has plural slice areas to store data elements one in each, and a control-information storage section that stores control information of the plural slice areas, a communications-function section having a function of sending and receiving the data elements stored in the slice areas in the data storage section. The modules communicate with each other to replicate the data element stored in the slice area into an unused slice area in another module so as to have data redundancy.

Abstract: The disclosed method includes obtaining a result concerning a busy rate and the number of accesses per unit time for a storage device including first and second storage areas; determining, from the result, whether an event that a first indicator value for the busy rate is reset occurs; when the event occurred, notifying a controller that makes the number of accesses for the second storage area not greater than the notified number of accesses of the first number of accesses less than the second number of accesses, which was notified immediately before; obtaining another result; updating the first indicator value based on another result; calculating the third number of accesses so that a sum of busy rates corresponding to the third number of accesses and corresponding to the designated number of accesses becomes equal to the updated first indicator value; and notifying the controller of the third number of accesses.

Abstract: A deduplicate device includes: a first through N-th (N?3) bloom filters; a counting unit that performs a process of judging whether information indicating that a duplicate data of a storing-target data exists in a storage device is registered in each bloom filter sequentially until an unregistered bloom filter in which the information is not registered is found or that the information is registered in the N-th bloom filter is found, and registers, when the unregistered bloom filter is found, the information indicating that the duplicate data exists into the unregistered bloom filter; and a deduplicating unit that stores the storing-target data in the storage device when the counting unit finds the unregistered bloom filter, and stores index information relating the duplicate data in the storage device with the storing-target data when the counting unit finds that the information is registered in the N-th bloom filter.

Abstract: A computer includes a memory that stores a program and received data; and a processor that executes an operation by executing the program stored in the memory, the operation including storing the received data into a first database having a first data structure in which reading is performed in a random access manner and writing is performed in a sequential access manner, when the received data is received from a second apparatus is as same as data stored in a first apparatus which has a failure, and copying the received data stored in the first database to a second database having a second data structure in which reading is performed in a sequential access manner and writing is performed in a random access manner.