Job Management Device and Method for Determining Processing Elements for Job Assignment

1. A job management device, comprising: a memory; and one or more processors coupled to the memory and configured to: acquire a ratio that indicates at least one of a first ratio of a number of vertices, that correspond to computing resources to which a job is not assigned and that are adjacent to a subgraph included in a graph including a plurality of vertices indicating computing resources of a computer system, and a plurality of edges indicating links between the computing resources to a number of vertices belonging to the subgraph for computing resources to which a certain job is assigned, a second ratio of a number of vertices that are adjacent to a plurality of vertices belonging to the subgraph and that correspond to computing resources to which a job is not assigned to the number of the vertices belonging to the subgraph, a third ratio of a number of vertices that belong to the subgraph and are adjacent to the plurality of vertices corresponding to computing resources to which a job is not assigned and that are adjacent to the subgraph to the number of the vertices belonging to the subgraph, a fourth ratio of a number of edges that are located between vertices belonging to the subgraph and vertices adjacent to the subgraph and corresponding to computing resources to which a job is not assigned to the number of the vertices belonging the subgraph, and a fifth ratio of a number of the edges that are located between the vertices belonging to the subgraph and the vertices adjacent to the subgraph and corresponding to the computing resources to which a job is not assigned to the number of edges between the vertices belonging to the subgraph; calculate, based on the ratio, an index value related to a load to be applied due to a search, to be performed, of a computing resource to which another job is to be assigned; determine, based on the index value, a number of processing elements in order to perform the search of the computing resource to which the another job is to be assigned; control the number of processing elements to perform the search of the computing resource using the subgraph as an evaluation standard for the search; and assign, based on results of the search, the another job to the computing resource.

2. The job management device according to claim 1 , wherein the one or more processors coupled to the memory are configured to calculate, based on the ratio, a probability at which the computing resource to which the another job is to be assigned is successfully searched, and calculate the index value based on the ratio and the probability.

3. The job management device according to claim 1 , wherein the one more processors coupled to the memory are configured to acquire a plurality of ratios for a plurality of subgraphs, calculate a plurality of index values based on each subgraph of the plurality of subgraphs, and determine the number of processing elements for each subgraph of the plurality of subgraphs based on the plurality of index values calculated for the plurality of subgraphs.

4. A job management method, comprising: acquiring, by a job management device including a memory and one or more processors, a ratio that indicates at least one of a first ratio of a number of vertices, that correspond to computing resources to which a job is not assigned and that are adjacent to a subgraph included in a graph including a plurality of vertices indicating computing resources of a computer system, and a plurality of edges indicating links between the computing resources to a number of vertices belonging to the subgraph for computing resources to which a certain job is assigned, a second ratio of a number of vertices that are adjacent to a plurality of vertices belonging to the subgraph and that correspond to computing resources to which a job is not assigned to the number of the vertices belonging to the subgraph, a third ratio of a number of vertices that belong to the subgraph and are adjacent to the plurality of vertices corresponding to computing resources to which a job is not assigned and that are adjacent to the subgraph to the number of the vertices belonging to the subgraph, a fourth ratio of a number of edges that are located between vertices belonging to the subgraph and vertices adjacent to the subgraph and corresponding to computing resources to which a job is not assigned to the number of the vertices belonging the subgraph, and a fifth ratio of a number of the edges that are located between the vertices belonging to the subgraph and the vertices adjacent to the subgraph and corresponding to the computing resources to which a job is not assigned to the number of edges between the vertices belonging to the subgraph; calculating, based on the ratio, an index value related to a load to be applied due to a search, to be performed, of a computing resource to which another job is to be assigned; determining, by the job management device based on the index value, a number of processing elements in order to search the computing resource to which the another job is to be assigned; controlling the number of processing elements to perform the search of the computing resource using the subgraph as an evaluation standard for the search; and assigning, based on results of the search, the another job to the computing resource.

5. A non-transitory computer readable medium storing computer executable instructions which, when executed by one or more processors of a computer, cause the computer to perform a method comprising: acquiring a ratio that indicates at least one of a first ratio of a number of vertices, that correspond to computing resources to which a job is not assigned and that are adjacent to a subgraph included in a graph including a plurality of vertices indicating computing resources of a computer system, and a plurality of edges indicating links between the computing resources to a number of vertices belonging to the subgraph for computing resources to which a certain job is assigned, a second ratio of a number of vertices that are adjacent to a plurality of vertices belonging to the subgraph and that correspond to computing resources to which a job is not assigned to the number of the vertices belonging to the subgraph, a third ratio of a number of vertices that belong to the subgraph and are adjacent to the plurality of vertices corresponding to computing resources to which a job is not assigned and that are adjacent to the subgraph to the number of the vertices belonging to the subgraph, a fourth ratio of a number of edges that are located between vertices belonging to the subgraph and vertices adjacent to the subgraph and corresponding to computing resources to which a job is not assigned to the number of the vertices belonging the subgraph, and a fifth ratio of a number of the edges that are located between the vertices belonging to the subgraph and the vertices adjacent to the subgraph and corresponding to the computing resources to which a job is not assigned to the number of edges between the vertices belonging to the subgraph; calculating, based on the ratio, an index value related to a load to be applied due to a search, to be performed, of a computing resource to which another job is to be assigned; determining, based on the index value, a number of processing elements in order to search the computing resource to which the another job is to be assigned; controlling the number of processing elements to perform the search of the computing resource using the subgraph as an evaluation standard for the search; and assigning, based on results of the search, the another job to the computing resource.