Abstract: A computer system is constituted by a plurality of physical computers including a first physical computer and a second physical computer. One or more application instances that perform an application service and a storage service instance that provides a storage service including a volume used by the application instance operate on the first physical computer. The computer system predicts a future resource usage status of the first physical computer, creates a plan to move the one or more application instances operating on the first physical computer to the second physical computer based on the predicted future resource usage status, and executes the created plan.

Abstract: In a distributed storage system, a volume classifier classifies a plurality of volumes into a plurality of groups on the basis of a fluctuation cycle of a load in each volume, a processor (a resource classifier) calculates a total load obtained by summing the loads of the plurality of volumes on the same node within a group at each time and calculates a group load on the basis of a peak of the total load, and the processor of one node (a rebalancer) calculates the group load on a movement destination node in a case where a volume as a movement candidate in rebalancing that moves the volume between nodes is moved from a movement source node to the movement destination node, determines a volume to be moved in the rebalancing and a movement destination volume on the basis of the calculated group load on the movement destination node, and performs the rebalancing.

Abstract: A computer system is constituted by a plurality of physical computers including a first physical computer and a second physical computer. One or more application instances that perform an application service and a storage service instance that provides a storage service including a volume used by the application instance operate on the first physical computer. The computer system predicts a future resource usage status of the first physical computer, creates a plan to move the one or more application instances operating on the first physical computer to the second physical computer based on the predicted future resource usage status, and executes the created plan.

Abstract: Each file storage apparatus of a plurality of file storage apparatuses stores a file system, and associates and stores paths of elements in the file system and archive destinations of the elements in an archive storage apparatus. When the file system is operated, each file storage apparatus transmits archive data of an element as an operation target, and operation information including operation details to the archive storage apparatus. The archive storage apparatus receives the archive data and the operation information, stores the archive data, and stores consistency information including the operation information and archive versions indicating a reception order of the operation information.

Abstract: A file server apparatus includes a second file system volume including cache data of a first file system volume stored in a shared file storage apparatus. The file server apparatus determines the operation type indicated by an access request to the first file system volume from a client. When the operation type is directory operation, the file server sends an instruction of directory operation to the shared file storage apparatus, and then transmits a completion response to the client. When the operation type is file operation, the file server apparatus executes a file operation in the second file system volume, transmits a completion response to the client, and then transmits a file operation instruction to the shared file storage apparatus.

Abstract: A computer system for sharing objects comprises multiple front-end nodes and a back-end node for providing a namespace shared by the front-end nodes. A first front-end node that is any one of the front-end nodes manages local-lock counts for each of objects managed by the first front-end node. The local-lock count is the number of locks taken by operations to the objects including the directory and sub-objects thereof. Every time receiving a request for processing a target object from a client, the front-end node requests the back-end node to lock a parent directory of the target object if the parent directory has not been locked by the back-end node. The front-end node sends a response of the received request to the client regardless of whether or not the parent directory has been unlocked by the back-end node. If the local-lock count of the parent directory is zero, the first front-end node requests the back-end node to unlock the parent directory.

Abstract: An example of storage system obtains a reference request of a reference request data block that is included in the content and is stored in the medium area. The storage system determines a number of gaps among addresses, in the medium area, of a plurality of data blocks continuous in the content including the reference request data block. The storage system determines, based on the number of gaps, whether or not defrag based on the plurality of data blocks is valid. The storage system writes, when the defrag is determined to be valid, the plurality of data blocks read from the medium area to the memory area, into continuous address areas of the medium area.

Abstract: The purpose of the present invention is, in a file storage, to shorten an access response time to shared data. When a file storage apparatus receives a command for a specific manipulation of a file system, a specific apparatus determines, based on a state of the file system and a manipulation history, whether or not an unapplied manipulation affects a target of the specific manipulation, the unapplied manipulation being a manipulation which has been previously executed by another file storage apparatus among a plurality of file storage apparatuses and which has not been applied to the file system. When it is determined that the unapplied manipulation affects the target of the specific manipulation, the file storage apparatus applies the unapplied manipulation to the file system, executes the specific manipulation on the file system, and transmits, to a cloud storage apparatus, manipulation information which represents the specific manipulation.

Abstract: (A) and (B), described hereinafter, are carried out for objects which differ between an reflection source namespace and a reflection destination namespace, with respect to either: a center node in a migration, which applies an update of a first local namespace which a first edge node (any edge node) provides to a center namespace; or a second edge node (any edge node other than the first edge node) in a synchronization, which applies an update of the center namespace to a second local namespace which the second edge node provides. Specifically, either the center node or the second edge node: (A) determines whether the situation with respect to the differing objects corresponds to a conflict case among defined conflict cases; and (B) if the result of the determination in (A) is affirmative, executes a process according to a confliction resolution policy which is associated with the corresponding conflict case.

Abstract: An allocation request for requesting allocation of a target virtual area with respect to target data issued to a system program includes a target ID corresponding to the target data. In response to the allocation request, whether or not the target ID is included in data map information is determined. When it is included in the data map information, the system program determines whether or not a target physical area is included in a storage apparatus. When the target physical area is included in the storage apparatus, the system program reserves a free area in a non-volatile memory as a target memory area, copies target data stored in the storage apparatus to the target memory area, changes the target physical area in the data map information to the target memory area, and writes an association between the target virtual area and the target memory area into the volatile memory.

Abstract: Chunk de-duplication performance is improved. A de-duplication system has a cut-out processing unit which inputs a content from a client terminal thereinto, determines a calculation range from a predetermined maximum chunk size and a predetermined minimum chunk size, divides the calculation range into at least two small calculation ranges, sets the positions of windows for rolling hash calculation so that the rolling hash calculation is continuous between the two small calculation ranges, and subjects the at least two small calculation ranges to the rolling hash calculation with shifting of the windows based on parallel processing to cut out a chunk from the content, and a de-duplication processing unit which does not store the cut-out chunk into a storage device when the chunk having the same contents as those of the cut-out chunk is already stored in the storage device.

Abstract: In the present invention, in order to provide an effective synchronization process control method between sites in a multi-site file system sharing through a data center, a synchronization process target file group is split into sub trees of an appropriate size, in accordance with a conflict frequency of an update file between sites, and a throughput between site-data center. Then, the split sub tree is synchronized from the one having high conflict frequency.

Abstract: Provided is an application device for applying and spreading an application liquid to and on a predetermined application area of a target surface, which is capable of smearing the application liquid on the application area. The application device (D) includes a brush unit (4) having a brush bristle bundle (41a), and performs a step of causing, while moving a nozzle orifice (32a) of a dispenser (3) along at least a portion of the surface of a rivet (S1) and an area of a wall (Sp) surrounding the base of the rivet (S1), a sealing liquid to be ejected from the nozzle orifice (32a) and to adhere to the portion, and thereafter, a step of spreading the adhering sealing liquid by causing the brush bristle bundle (41a) to slide on the surface of the rivet (S1) and the area of wall (Sp) surrounding the base of the rivet (S1).

Abstract: (A) and (B), described hereinafter, are carried out for objects which differ between an reflection source namespace and a reflection destination namespace, with respect to either: a center node in a migration, which applies an update of a first local namespace which a first edge node (any edge node) provides to a center namespace; or a second edge node (any edge node other than the first edge node) in a synchronization, which applies an update of the center namespace to a second local namespace which the second edge node provides. Specifically, either the center node or the second edge node: (A) determines whether the situation with respect to the differing objects corresponds to a conflict case among defined conflict cases; and (B) if the result of the determination in (A) is affirmative, executes a process according to a confliction resolution policy which is associated with the corresponding conflict case.

Abstract: The purpose of the present invention is, in a file storage, to shorten an access response time to shared data. When a file storage apparatus receives a command for a specific manipulation of a file system, a specific apparatus determines, based on a state of the file system and a manipulation history, whether or not an unapplied manipulation affects a target of the specific manipulation, the unapplied manipulation being a manipulation which has been previously executed by another file storage apparatus among a plurality of file storage apparatuses and which has not been applied to the file system. When it is determined that the unapplied manipulation affects the target of the specific manipulation, the file storage apparatus applies the unapplied manipulation to the file system, executes the specific manipulation on the file system, and transmits, to a cloud storage apparatus, manipulation information which represents the specific manipulation.

Abstract: A file server apparatus includes a second file system volume including cache data of a first file system volume stored in a shared file storage apparatus. The file server apparatus determines the operation type indicated by an access request to the first file system volume from a client. When the operation type is directory operation, the file server sends an instruction of directory operation to the shared file storage apparatus, and then transmits a completion response to the client. When the operation type is file operation, the file server apparatus executes a file operation in the second file system volume, transmits a completion response to the client, and then transmits a file operation instruction to the shared file storage apparatus.

Abstract: Each file storage apparatus of a plurality of file storage apparatuses stores a file system, and associates and stores paths of elements in the file system and archive destinations of the elements in an archive storage apparatus. When the file system is operated, each file storage apparatus transmits archive data of an element as an operation target, and operation information including operation details to the archive storage apparatus. The archive storage apparatus receives the archive data and the operation information, stores the archive data, and stores consistency information including the operation information and archive versions indicating a reception order of the operation information.

Abstract: An allocation request for requesting allocation of a target virtual area with respect to target data issued to a system program includes a target ID corresponding to the target data. In response to the allocation request, whether or not the target ID is included in data map information is determined. When it is included in the data map information, the system program determines whether or not a target physical area is included in a storage apparatus. When the target physical area is included in the storage apparatus, the system program reserves a free area in a non-volatile memory as a target memory area, copies target data stored in the storage apparatus to the target memory area, changes the target physical area in the data map information to the target memory area, and writes an association between the target virtual area and the target memory area into the volatile memory.

Abstract: A computer system for sharing objects comprises multiple front-end nodes and a back-end node for providing a namespace shared by the front-end nodes. A first front-end node that is any one of the front-end nodes manages local-lock counts for each of objects managed by the first front-end node. The local-lock count is the number of locks taken by operations to the objects including the directory and sub-objects thereof. Every time receiving a request for processing a target object from a client, the front-end node requests the back-end node to lock a parent directory of the target object if the parent directory has not been locked by the back-end node. The front-end node sends a response of the received request to the client regardless of whether or not the parent directory has been unlocked by the back-end node. If the local-lock count of the parent directory is zero, the first front-end node requests the back-end node to unlock the parent directory.

Abstract: When computers and virtual machines operating in the computers both attempt to allocate a cache regarding the data in a secondary storage device to respective primary storage devices, identical data is prevented from being stored independently in multiple computers or virtual machines. An integrated cache management function in the computer arbitrates which computer or virtual machine should cache the data of the secondary storage device, and when the computer or the virtual machine executes input/output of data of the secondary storage device, the computer inquires the integrated cache management function, based on which the integrated cache management function retains the cache only in a single computer, and instructs the other computers to delete the cache. Thus, it is possible to prevent identical data from being cached in a duplicated manner in multiple locations of the primary storage device, and enables efficient capacity usage of the primary storage device.