Abstract: A management node that manages performance resource amount information indicating a relationship between a resource amount of hardware allocated to software executed in a predetermined node and performance of the software includes a storage unit and a processor connected to the storage unit. The management node is configured to store a performance model management table in which a performance model is associated with an execution environment in which an application of a computing node is executed, in the storage unit, acquire operation information capable of specifying performance of the application executed in the execution environment, and modify the performance model corresponding to the execution environment based on the operation information.

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: 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: 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: 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: 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 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: 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: 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: 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 computer system includes a plurality of task processing nodes capable of executing tasks and a task management node which determines which a task processing node to allocate a new task and each task processing nodes includes a memory capable of caching data to be used by an allocation task which is a task allocated to the task processing node. The task management node stores task allocation history information including a correspondence relationship between the allocation task and the respective task processing node A CPU of the task management node determines a degree of similarity between the new task and the allocated task, determines the task processing node to which the new task should be allocated from the task processing nodes included in the task allocation history information based on the degree of similarity, and allocates the new task.

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: A storage system has a cluster structure in which a node is connected with a different node, the node having a volatile memory for storing first update data from a host and a first non-volatile memory for storing second copy data of second update data from the host to the different node, and having a copy management processing unit for storing first copy data of the first update data into a second non-volatile memory of the different node, and a storage service processing unit for transmitting, to the host, a response with respect to an update request of the first update data in response to the storage of the first copy data of the first update data by the copy management processing unit into the second non-volatile memory of the different node.

Abstract: A first storage node generates a plurality of distributedly arranged write data blocks from write data and generates a first redundant data block from the plurality of distributedly arranged write data blocks. One distributedly arranged write data block is arranged in a second data block and the first redundant data block is arranged in a third storage node. A second storage node generates a second redundant data block from the plurality of distributedly arranged write data blocks selected from the distributedly arranged write data block held therein. The second storage node rearranges each of the plurality of selected distributedly arranged write data blocks in a rearrangement destination storage node and arranges the second redundant data block in a storage node other than the rearrangement destination storage node.

Abstract: A computer system includes a plurality of task processing nodes capable of executing tasks and a task management node which determines which a task processing node to allocate a new task and each task processing nodes includes a memory capable of caching data to be used by an allocation task which is a task allocated to the task processing node. The task management node stores task allocation history information including a correspondence relationship between the allocation task and the respective task processing node A CPU of the task management node determines a degree of similarity between the new task and the allocated task, determines the task processing node to which the new task should be allocated from the task processing nodes included in the task allocation history information based on the degree of similarity, and allocates the new task.

Abstract: A first storage node generates a plurality of distributedly arranged write data blocks from write data and generates a first redundant data block from the plurality of distributedly arranged write data blocks. One distributedly arranged write data block is arranged in a second data block and the first redundant data block is arranged in a third storage node. A second storage node generates a second redundant data block from the plurality of distributedly arranged write data blocks selected from the distributedly arranged write data block held therein. The second storage node rearranges each of the plurality of selected distributedly arranged write data blocks in a rearrangement destination storage node and arranges the second redundant data block in a storage node other than the rearrangement destination storage node.

Abstract: A computer system comprising computers, having a database built on storage areas included in computers, the processor of at least one computer being configured to: identify data to be used in first processing in a case of receiving a request to execute the first processing; perform data inquiry for inquiring about presence of the data to be used in the first processing to computers providing the database; identify computers holding the data to be used in the first processing, based on responses to the data inquiry; and assign the first processing to at least one of computers holding the data to be used in first processing.

Abstract: A storage system has a cluster structure in which a node is connected with a different node, the node having a volatile memory for storing first update data from a host and a first non-volatile memory for storing second copy data of second update data from the host to the different node, and having a copy management processing unit for storing first copy data of the first update data into a second non-volatile memory of the different node, and a storage service processing unit for transmitting, to the host, a response with respect to an update request of the first update data in response to the storage of the first copy data of the first update data by the copy management processing unit into the second non-volatile memory of the different node.

Abstract: A storage apparatus includes a controller configured to carry out data processing for content that is received, and a media area configured to store the content for which the data processing has been carried out. The controller is configured to classify segments in the content and carry out data rearrangement processing of assembling segments of the same type in the classified segments. The controller is configured to carry out data amount reduction processing for the content for which the data rearrangement processing has been carried out, and store in the media area the content for which the data amount reduction processing has been carried out.

Abstract: A storage apparatus is connected to a host apparatus and a secondary storage apparatus and includes a memory, a storage device, and a processor. The memory includes a save memory area and a cache memory area that temporarily stores data received from the host apparatus. The storage device stores data that is received from the host apparatus. The processor controls a duplication process for specified data to another storage apparatus at a point in time of a start of duplication, saves a first data block into the save memory area when receiving an update request of the first data block in the cache memory area after the start of duplication, and updates the first data block in the cache memory area to an updated data block.