Abstract: A computing device includes a storage unit storing a job list, and a computing unit that performs a computation related to an instance capable of executing burst processing by consuming credits. The job list is a list of batch jobs. The batch jobs include a plurality of combinations of a time frame and data regarding a size of a job, the time frame being set as a combination of a time point at which execution of the job can be started and a time point at which the job should have been completed. The burst processing of the job is at a speed exceeding a baseline but not exceeding a maximum speed, the baseline being a processing speed of the job that can always be attained. The computing unit determines whether or not the job can be completed within the time frame, for the batch jobs in the job list.

Abstract: A management method includes accessing API interfaces and collecting data related to primary volumes, remote copy volumes, and shared upload volumes, generating order topology related to the primary, remote copy, and shared upload volumes, calculating a set P of the primary volumes storing data to be deleted and specifying a set Vd of the remote copy volumes directly related to the set P in the order topology, calculating, as a set C, all of the shared upload volumes related to the set P in the order topology and specifying a set Vi of all of the remote copy volumes related to the set C in the order topology, calculating a set Vid as the complementary set of the set Vd in the set Vi, and specifying a set Pid of the primary volumes one level higher than the set Vid in the order topology.

Abstract: A management method includes accessing API interfaces and collecting data related to primary volumes, remote copy volumes, and shared upload volumes, generating order topology related to the primary, remote copy, and shared upload volumes, calculating a set P of the primary volumes storing data to be deleted and specifying a set Vd of the remote copy volumes directly related to the set P in the order topology, calculating, as a set C, all of the shared upload volumes related to the set P in the order topology and specifying a set Vi of all of the remote copy volumes related to the set C in the order topology, calculating a set Vid as the complementary set of the set Vd in the set Vi, and specifying a set Pid of the primary volumes one level higher than the set Vid in the order topology.

Abstract: Provided is a management system for managing a relation between a database and a volume without installing an agent. A management system manages a relation between a data catalog and a volume of a storage system storing data to be used by the data catalog. A processor of the management system accesses data that is included in the data catalog and that includes authentication information of the volume; detects the number of accesses to the volume in a time range including a timing of the access to the data; and manages the relation between the data catalog and the volume on the basis of the number of accesses.

Abstract: Provided is a management system for managing a relation between a database and a volume without installing an agent. A management system manages a relation between a data catalog and a volume of a storage system storing data to be used by the data catalog. A processor of the management system accesses data that is included in the data catalog and that includes authentication information of the volume; detects the number of accesses to the volume in a time range including a timing of the access to the data; and manages the relation between the data catalog and the volume on the basis of the number of accesses.