Abstract: A storage system is capable of sharing files between a plurality of sites each having a storage which provides a file system without having to mutually hold the associated files of all files between such sites. The storage has a storage apparatus storing data of a file and a controller connected to the storage apparatus; the storage system includes an associated file which is associated with the file and refers to the file; when the file is to be updated, the controller updates the file and the associated file based on a reference status from the associated file; and when an access request for accessing a file stored in another site is received, the controller makes an inquiry to the other site, and creates an associated file for accessing the file corresponding to the access request in a site of a controller that received the access request.

Abstract: An information processing system including Application Platform capable of communicating with Edge1 connected to each other to be able to communicate each other, in which Application Platform includes a second processor, information on microservices and data possessed by Edge1, and performance information describing the performance of Edge1, and the second processor uses predetermined data to combine a plurality of predetermined microservices and causes Edge1 to execute them in a predetermined order. When executing the application, microservices and data are moved between Edge1 based on the information of the microservices and the data possessed by Edge1, and the performance information.

Abstract: Provided is an edge storage having a central processing unit (CPU). The edge storage is connected to another storage device capable of deduplicating and managing a data of a file in units of a predetermined chunk via a network, in which, when a data of a newly created file or an updated file is transferred to the other storage device, the CPU determines whether to transmit a difference portion to a core storage or to transmit a finger print of a difference chunk to the core storage, based on a size of the difference portion and a size of the finger print of the difference chunk which is a chunk including the difference portion and transmits the difference portion or the finger print to the core storage according to a determination result.

Abstract: To attempt to reduce a processing load by making it unnecessary to perform a task of searching for similar data when a delta compression process is performed. A storage system has a deduplication function of performing deduplication on a plurality of duplicate pieces of the data and a delta compression function of storing differences between a plurality of similar pieces of the data. When a write request to update the stored data is received, in a case where the deduplication has been performed on the data before being updated according to the write request, and the data after being updated does not share duplicate data with second data, a processor of the storage system performs the delta compression of generating and storing a difference between the data before being updated and the data after being updated.

Abstract: Provided is a storage system capable of properly deleting derivative data stored at a plurality of sites. A CPU executes a creation process of creating data based on data stored in a storage device at a local site and storing the created data in the storage device of a node at one of the plurality of sites. Further, the CPU collects, from each of the plurality of sites, history information created at each of the plurality of sites to indicate the history of each creation process. When deleting deletion-specified data, the CPU identifies deletion derivative data according to the history information created at each of the plurality of sites, and deletes the deletion-specified data and the deletion derivative data from the storage device at each of the plurality of sites. The deletion derivative data is derivative data derived from the deletion-specified data.

Abstract: In a management node that controls the amount of hardware resources of storage nodes to be allocated to the software of distributed data stores executed by storage nodes, the management node includes a disk device that stores a performance model indicating the correspondence relationship between the amount of hardware resources and the performance that can be implemented by the hardware of the resource amount, and a central processing unit (CPU) connected to the disk device, in which the CPU receives the target performance by distributed data stores, determines the hardware resource amount required to achieve the target performance based on the performance model, and sets to allocate hardware of the determined resource amount to the programs of the distributed data stores.

Abstract: A distributed storage system, which receives a write request from a client, includes a plurality of computers which receive power supply from a plurality of power supply units. A first computer, among the plurality of computers, which is a computer that receives the write request from the client, is configured to: cache updated data which is at least apart of data accompanying the write request; select n second computers which are n computers (n is a natural number) among computers each receiving power from a power supply unit different from a power supply unit of the first computer as transfer destinations of the updated data; and transfer the updated data to the selected n second computers, respectively. At least one of the n second computers, when caching the updated data from the first computer, is configured to return a result to the first computer.

Abstract: A processor of a NAS performs a calling process of a local file system based on an operation request of a file from an application, the local file system processes the operation request of the file, an IO Hook program performs an update process of state management information of the file based on input information with respect to the local file system related to the operation request or an operation content, and a file virtualization program performs a management process of the file between the NAS and a CAS based on the state management information.

Abstract: In a management node that controls the amount of hardware resources of storage nodes to be allocated to the software of distributed data stores executed by storage nodes, the management node includes a disk device that stores a performance model indicating the correspondence relationship between the amount of hardware resources and the performance that can be implemented by the hardware of the resource amount, and a central processing unit (CPU) connected to the disk device, in which the CPU receives the target performance by distributed data stores, determines the hardware resource amount required to achieve the target performance based on the performance model, and sets to allocate hardware of the determined resource amount to the programs of the distributed data stores.

Abstract: A distributed storage system comprises a plurality of storage nodes which includes multiple resources including multiple kinds of resources. Each of the multiple storage nodes among the plurality of storage nodes is configured to execute an aggregation task which has been assigned to the storage node among aggregation tasks, Each of the aggregation tasks is a task for aggregating statistics relating to a resource among the multiple resources which corresponds to the task, to the storage node to which the task has been assigned.

Abstract: When an operation request of a file is made, a first storage system performs an operation of the file stored in the first storage system on the basis of the operation request, describes, in an operation log, a counter value of a management information file, associated with the file on which the operation is to be performed, together with operation content with respect to the file, replies to the operation request, and updates the counter value of the management information file when the file stored in the first storage system is transferred to a second storage system.

Abstract: Efficient pre-reading is performed in data transmission and reception between an Edge node and a Core node. An information processing device includes a storage device, outputs client request data based on a request of a client, and stores predetermined pre-read data in the storage device before the request of the client. The device includes: a relevance calculation module configured to calculate relevance between data based on an access history of the data; and a pre-reading and deletion module configured to determine data to be deleted from the storage device using the relevance when data having predetermined relevance with the client request data is to be stored to the storage device as the pre-read data and a storage capacity of the storage device is insufficient if at least one of the client request data and the pre-read data is to be stored to the storage device.

Abstract: In a distributed file system, a distributed FS server manages and stores main body data of a file in the distributed FS server or a cloud storage, and stores management information of the main body data, the distributed FS server that received an I/O request from a client specifies the distributed FS server that manages the management information of a target file, and transmits a transfer I/O request for executing I/O processing of the target file, the specified distributed FS server executes processing for the main body data of the target file with respect to the main body data based on the management information corresponding to a target file of the transfer I/O request, and returns a result of the I/O processing to the distributed FS server which is a request source, and the distributed FS server which is the request source returns the returned result to the client.

Abstract: The number of inter-node communications in inter-node deduplication can be reduced and both performance stability and high capacity efficiency can be achieved. A storage drive of storage nodes stores files that are not deduplicated in the plurality of storage nodes, duplicate data storage files in which deduplicated duplicate data is stored, and cache data storage files in which cache data of duplicate data stored in another storage node is stored, in which when a read access request for the cache data is received, the processors of the storage nodes read the cache data if the cache data is stored in the cache data storage file, and request another storage node to read the duplicate data related to the cache data if the cache data is discarded.

Abstract: A distributed storage system includes a first node group consisting of a plurality of nodes and a second node group consisting of a plurality of nodes. Each of the first node group and the second node group distributes and stores data of an assigned object to a plurality of constituent nodes. The first node group includes at least one first node shared with the second node group and at least one second node not shared with the second node group. The second node group includes the at least one first node and at least one third node not shared with the first node group.

Abstract: When the hash of the divided data is not duplicate with the hash registered in an in-memory hash table, the hash of the divided data is registered in the in-memory non-duplication data list. When the hash registered in the in-memory non-duplication data list is duplicated with the hash registered in an on-disk hash table, a duplicate count of the duplicate hash registered in the on-disk hash table is increased by 1 and an update time of the hash is updated to the latest value. When the duplication count of the hash registered in the on-disk hash table exceeds a threshold, the hash which is registered in the on-disk hash table and in which the duplication count has exceeded the threshold is moved from the on-disk hash table to the in-memory hash table.

Abstract: A processor of a NAS performs a calling process of a local file system based on an operation request of a file from an application, the local file system processes the operation request of the file, an IO Hook program performs an update process of state management information of the file based on input information with respect to the local file system related to the operation request or an operation content, and a file virtualization program performs a management process of the file between the NAS and a CAS based on the state management information.

Abstract: To reduce the data transfer amount required for a byte-level transfer of difference data, and avoid increases of management data and in the number of sessions at the time of a byte-level transfer of differences. In a computer system including: a first file storage that has a file system; a second file storage that receives an object request from the first file storage; and an object storage that stores a file or a directory that has been transferred to the object storage as an object, the first file storage detects an updated file or a directory of the file system from a client when the file system is updated; aggregates, collectively into a difference aggregation object, a plurality of pieces of difference data and difference data update information of detected files or directories; and transfers the difference aggregation object to the second file storage.

Abstract: A distributed storage system comprises a plurality of storage nodes which includes multiple resources including multiple kinds of resources. Each of the multiple storage nodes among the plurality of storage nodes is configured to execute an aggregation task which has been assigned to the storage node among aggregation tasks, Each of the aggregation tasks is a task for aggregating statistics relating to a resource among the multiple resources which corresponds to the task, to the storage node to which the task has been assigned.

Abstract: When the hash of the divided data is not duplicate with the hash registered in an in-memory hash table, the hash of the divided data is registered in the in-memory non-duplication data list. When the hash registered in the in-memory non-duplication data list is duplicated with the hash registered in an on-disk hash table, a duplicate count of the duplicate hash registered in the on-disk hash table is increased by 1 and an update time of the hash is updated to the latest value. When the duplication count of the hash registered in the on-disk hash table exceeds a threshold, the hash which is registered in the on-disk hash table and in which the duplication count has exceeded the threshold is moved from the on-disk hash table to the in-memory hash table.