CN103124279B - The output intent of resource information and system - Google Patents

Abstract

The invention provides a kind of output intent and system of resource information.Described method, comprising: obtain the dependence of other resource nodes in resource in each resource node and system; For described each resource node is distributed in the position of resource hierarchy, the Resource Dependence being wherein positioned at the resource node of the i-th+1 level is positioned at the resource that level is the resource node being less than or equal to i-th, and wherein i=1,2......, N, N are positive integer; If the gap between the level residing for two resource nodes of Existence dependency relationship is 1, connects two resource nodes in each dependence, obtain the directed graph of dependence; Initiate the flow process of the directed graph exporting described dependence.

Description

Method and system for outputting resource information

technical field

The present invention relates to the field of information processing, in particular to a resource information output method and system

Background technique

In the field of high-availability cluster management, resources are the smallest and important unit of cluster management. All operations of the cluster will eventually be reflected on resources, and the status of resources can also most directly reflect the running status of the cluster. At the same time, the relationship between resources is also complex. The same resource may depend on other resources, or be depended on by other resources. When understanding cluster resources, it is crucial to clarify the dependencies between resources.

The traditional representation of resource information is to list resource information in tabular form. Although this method displays resources more comprehensively, the relationship between resources is not intuitive enough. Users often cannot directly see the dependencies and dependent relationships between resources, and thus have an insufficient understanding of the overall situation of the cluster.

Contents of the invention

The present invention provides a resource information output method and system, and the technical problem to be solved is how to process resource information between nodes to make the dependency between resources more intuitive.

In order to solve the problems of the technologies described above, the present invention provides the following technical solutions:

(here to be supplemented after the approval of the claims)

Compared with the prior art, it is simple and intuitive by outputting the dependency relationship of resources between nodes in the form of a directed graph.

Description of drawings

FIG. 1 is a schematic flowchart of an embodiment of a method for outputting resource information provided by the present invention;

FIG. 2 is a schematic diagram of a directed graph of dependencies provided by an embodiment of the present invention;

Fig. 3 is a schematic diagram of the directed graph obtained after rearranging the center of gravity of the directed graph shown in Fig. 2;

Fig. 4 is a schematic structural diagram of an embodiment of a system for outputting resource information provided by the present invention.

detailed description

In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be noted that, in the case of no conflict, the embodiments in the present application and the features in the embodiments can be combined arbitrarily with each other.

FIG. 1 is a schematic flowchart of an embodiment of a method for outputting resource information provided by the present invention. The method embodiment shown in Figure 1 includes:

Step 101. Obtain resource dependency between each resource node and other resource nodes in the system;

Wherein, the dependency relationship can be obtained by user input.

Step 102. Allocate a position at the resource level for each resource node, wherein the resources of the resource nodes at the i+1th level depend on the resources of the resource nodes at the level less than or equal to the i-th level, where i= 1, 2..., N, N is a positive integer;

Specifically, if the resources of resource node 1 depend on the resources of resource node 2, resource node 1 can be called a dependent resource node, and resource node 2 is a dependent resource node. The level below the dependent resource node. Of course, a dependent resource node in a dependency relationship may also be a dependent resource node in another dependency relationship. Similarly, a dependent resource node in a dependency relationship may also be a dependent resource node in another dependency relationship , however, no interdependence occurs.

For example, the relationship between a resource node and other resource nodes determines the hierarchical position of the resource node in the graph. The principle to be followed is that the layer where the resource node is located is at least the next layer of all resources that depend on it.

Step 103. Obtain a group of resource nodes whose levels of two resource nodes with dependencies are 1;

If the gap between the layers of two resource nodes that have a dependency relationship is not 1, a virtual node is added on each layer between the layers where the two resources are located, so that the two resource nodes are connected through the virtual node.

For example, if there is a dependency relationship between resource nodes A and B, if resource node A is on layer 1 and resource node B is on layer 4, the layers between the two resource nodes are layer 2 and layer 3, Then a virtual node can be added on both the second layer and the third layer, and resource node A and resource node B are connected through the added virtual node, so that under the premise of reflecting the dependency between resource nodes A and B , which also ensures that the gap between the levels of two resource nodes with dependencies is 1.

In fact, a virtual node divides a relationship into two parts, and it will play a connecting role in the middle level of the cross-level relationship. A virtual node can be considered as a virtual resource node. As a part of the graph, it connects resource nodes with cross-layer relationships. Of course, if there is a level difference between two relationship resources greater than 2, virtual nodes can be recursively inserted until there is no cross-level relationship. This process is called the hierarchical process of the graph. After this step, a hierarchical directed graph can be obtained.

Step 104: Based on the level gap of 1 in the same dependency relationship, connect the two resource nodes in the dependency relationship to obtain a directed graph of the dependency relationship;

Step 105, outputting the directed graph of the dependency relationship.

To illustrate with the above example, the resource node A at level 1 is connected to the virtual node at level 2 corresponding to the dependency relationship, and the virtual node at level 2 is connected to the virtual node at level 3 corresponding to the dependency relationship. A virtual node at level 3 is connected to resource node B at level 4.

It should be noted that, in this embodiment, icons represent resource nodes and virtual nodes, and straight lines represent relationships. After the layering process of the graph, it can be determined that there are no cross-layer straight lines in the graph. Then, the next problem is how to reduce the number of straight line intersections in the graph caused by the different directions of the straight lines between layers. Since the relationship between nodes is fixed, the position of nodes in each layer determines the number of intersections in the graph when visually represented. To reduce the number of intersections as the goal, the positions of nodes in the hierarchy are sorted. This embodiment adopts a layout algorithm based on center-of-gravity sorting to ensure that the number of finally displayed graphic intersections is the least.

First of all, it needs to be clarified that the vertical index of resource nodes and virtual nodes in the graph is the layer they are in, and the top is the first layer. The horizontal index is its horizontal position in the hierarchy, and the leftmost position is 1, increasing to the right. The center of gravity of a node relative to the adjacent layer is defined as the quotient of the sum of the horizontal indexes of all nodes related to the node in the adjacent layer and the number of nodes in the adjacent layer.

Explain the reordering process:

Step A. Calculate the first center of gravity of the nodes on the i-th layer relative to the nodes on the i-1 layer and the second center of gravity relative to the nodes on the i+1 layer, and set the maximum number of sorting times, where:

The first center of gravity of a single node in the i-th layer is the quotient of the sum of the horizontal indexes of the nodes connected to the node in the i-1 layer and the total number of nodes on the i-1 layer that have a dependency relationship with the node;

The second center of gravity of a single node in the i-th layer is the quotient of the sum of the horizontal indexes of the nodes connected to the node on the i+1 layer and the total number of nodes that have dependencies on the node on the i+1 layer;

Preferably, the maximum number of sorting times is generally set to the total number of layers of resources;

Step B, according to the order of level i from 2 to N, fix the nodes of the i-1th layer, sort according to the first center of gravity on the i-th layer from small to large, and calculate the number of cross points after sorting;

Step C, according to the order of level i from 2 to N, exchange the positions of the nodes on the i-th layer with the same first center of gravity value on the i-1th layer, and calculate the number of cross points after sorting;

Step D, according to the order of levels from N-1 to 1, fix the nodes of the i+1th layer, sort according to the second center of gravity on the i-th layer from small to large, and calculate the number of cross points after sorting;

Step E. If the number of intersection points calculated in B, C, and D is 0, the sorting result is saved, and the rearrangement process ends.

Step F. If the number of cycles of B, C, and D reaches the set maximum number of sorting times, save the result of the minimum number of intersection points calculated in steps B, C, and D, and the rearrangement process ends.

In the embodiment of the present invention, the dependent resource node is at a lower level, while the dependent resource node is at a higher level. According to the principle of resource allocation, in terms of number, the number of nodes in each level at the lower level is less than that at the higher level. Rearrange the positions above to get the number of intersections. On this basis, perform step C to try to see if changing the positions of nodes with the same center of gravity can reduce the number of intersections, and then perform step E to further try whether to change the rearrangement order The arrangement with the least number of intersections.

The order of the above-mentioned steps B and D can be reversed. If D is performed first and then B is performed, then after D or B, an operation of exchanging the position of the same center of gravity in the same direction is required. B and D are to adjust the relationship on the directed graph level from two directions respectively. After these two steps, only one step needs to be added to adjust the order of the nodes with the same center of gravity. This is to ensure that the adjustment of the nodes with the same center of gravity is not ignored. In the case where better results can be obtained, it is also avoided to adjust the order of nodes with the same center of gravity every time the order is adjusted.

To put it simply, the above-mentioned sorting process can also be replaced by the following steps, specifically:

Step 1. According to the order of level i from N-1 to 1, fix the nodes of the i+1th layer, sort according to the center of gravity on the i-th layer relative to the lower layer nodes, that is, the second center of gravity, from small to large, and calculate the sorted number of intersections;

Step 2. According to the order of level i from N-1 to 1, exchange the position of the node on the i-th layer with the same center of gravity value for the lower node, that is, the position of the node with the same second center of gravity value, and calculate the number of intersections after sorting;

Step 3. According to the order of level i from 2 to N, fix the nodes of level i-1, sort according to the first center of gravity on level i from small to large, and calculate the number of intersections after sorting.

The following is an application example to illustrate:

FIG. 2 is a schematic diagram of a directed graph of dependencies provided by an embodiment of the present invention. In the graph shown in Figure 1, there is a two-layer directed graph. Node A depends on nodes C and D, and node B depends on node C. In this way, there is an intersection point in the graph. The center of gravity of a node is relative. The center of gravity of a node with respect to the adjacent layer is defined as the average index value of all nodes related to it in all adjacent layers. Among them, node A depends on node C and node D, and the horizontal indexes of these two nodes are 1 and 2 respectively, so the center of gravity value of node A relative to the lower layer is (1+2)/2=1.5. Similarly, node B is C relative to the lower node, that is, the number of nodes that have a dependency relationship with B is 2, and the horizontal index value of C is 1, then the barycenter value of B relative to the lower node is 1, and node C The center of gravity relative to the upper node is 1.5, and the center of gravity of node D relative to the upper node is 1.

The sorting based on the center of gravity refers to fixing a layer of nodes, and sorting the nodes of its adjacent layers by the center of gravity. In Figure 2, the first layer is fixed, and the second layer nodes are sorted. Since the center of gravity of D is 1 less than the center of gravity of C 1.5, C and D are exchanged to obtain a new directed graph, that is, Figure 3, that is FIG. 3 is a schematic diagram of a directed graph obtained by rearranging the center of gravity of the directed graph shown in FIG. 2 .

It can be seen from Figure 3 that the number of intersections in Figure 3 becomes 0. Similarly, it is also possible to fix the nodes of the second layer and sort the nodes of the first layer. The center of gravity of A is 1.5 greater than the center of gravity of B. If A and B are swapped, a node with an intersection point of 0 can also be obtained.

Of course, for multi-layer graphics, they are sorted sequentially from top to bottom or bottom to top. It should be pointed out that for the nodes with the same center of gravity calculated, their relative order may affect the final result, so after completing a round of sorting from top to bottom, the nodes with the same center of gravity should be replaced in the same direction position to determine the least impact on the intersection.

After the layout based on the center of gravity sorting is completed, the horizontal and vertical indexes of the finalized nodes are obtained, and are drawn and displayed according to the size of the canvas to be displayed. Visually display the icons corresponding to the nodes and the corresponding relationships. On fixed and variable-sized canvases, describe the relationship between resource nodes and resources. If resource monitoring needs to be displayed, describe the resource status.

Of course, in practical applications, if there is a dependency of adding a resource, the hierarchical position of the resource and its related resources will be updated according to the newly added dependency. If the dependency of the resource is deleted, the resource and The hierarchical location of its associated resource.

It can be seen from this that the present invention intuitively expresses the relationship between resources by outputting the directed graph of the dependency relationship between resource information.

Fig. 4 is a schematic structural diagram of an embodiment of a system for outputting resource information provided by the present invention. In combination with the method embodiment shown in Figure 1, the system embodiment shown in Figure 4 includes:

Obtaining means 401, configured to obtain resource dependencies between each resource node and other resource nodes in the system;

The first allocating means 402 is connected with the obtaining means 401, and is used to allocate a resource level position for each resource node, wherein the resources of the resource nodes at the (i+1)th level depend on the level being less than or equal to The resources of the i-th resource node, where i=1, 2..., N, N is a positive integer;

The connecting means 403 is connected to the first allocating means 402, and is used to connect the two resource nodes in each dependency relationship when the gap between the levels of the two resource nodes in which there is a dependency relationship is 1, to obtain the dependency relationship. directed graph;

The output device 404 is connected to the connection device 403 and configured to initiate a process of outputting the directed graph of the dependency relationship.

Optionally, the system also includes:

The second allocating means is connected with the first allocating means 402 and the connecting means 403, and is used for when the difference between the levels of two resource nodes in the dependency relationship is greater than 1, the two resource nodes in the dependency relationship Allocate a virtual node in a one-to-one correspondence between the layers, and then trigger the acquisition process of the directed graph of dependencies.

Specifically, the output device includes:

The first calculation module is used to calculate the first center of gravity of the nodes on the i-th layer relative to the nodes on the i-1 layer and the second center of gravity relative to the nodes on the i+1 layer, and set the maximum number of sorting times, wherein: the i-th layer The first center of gravity of each node in the layer is the quotient of the sum of the indexes of all nodes that have a dependency relationship with this node on the i-1th layer and the total number of nodes that have a dependency relationship with this node on the i-1th layer; The second center of gravity of each node in the i-th layer is the sum of the horizontal indexes of all nodes that are dependent on the node on the i+1 layer and the total number of nodes that are dependent on the node on the i+1 layer number of quotient;

The first sorting module is used to execute the sorting process, and the sorting process includes:

Step 1. According to the order of level i from 2 to N, fix the nodes of the i-1th layer, sort according to the first center of gravity on the i-th layer from small to large, and calculate the number of cross points after sorting;

Step 2. According to the order of level i from 2 to N, exchange the position of the node on the i-th level with the same first barycenter value on the i-1th level, and calculate the number of intersections after sorting;

Step 3. According to the order of level i from N-1 to 1, fix the nodes of level i+1, sort according to the second center of gravity on level i from small to large, and calculate the number of cross points after sorting;

The first output module is used to save and output the sorting results when the number of cross points calculated in steps 1, 2, and 3 is 0, or, when the number of cycles in steps 1, 2, and 3 reaches the set maximum number of sorting times, Save the result with the smallest number of intersections calculated in steps 1, 2, and 3 and output it.

Specifically, the output device includes:

The second calculation module is used to calculate the first center of gravity of the nodes on the i-th layer relative to the nodes on the i-1 layer and the second center of gravity relative to the nodes on the i+1 layer, and set the maximum number of sorting times, wherein: the i-th layer The first center of gravity of each node in the layer is the quotient of the sum of the horizontal indexes of all nodes that have a dependency relationship with this node on the i-1th layer and the total number of nodes that have a dependency relationship with this node on the i-1th layer ; The second center of gravity of each node in the i-th layer is the sum of the horizontal indexes of all the nodes on the i+1 layer that have a dependency relationship with this node and the sum of the nodes that have a dependency relationship with this node on the i+1 layer number of quotient;

The second sorting module is used to execute the sorting process, and the sorting process includes:

Step 1. According to the order of levels from N-1 to 1, fix the nodes of the i+1th layer, sort according to the second center of gravity on the i-th layer from small to large, and calculate the number of cross points after sorting;

Step 2. According to the order of level i from 2 to N, exchange the position of the node on the i-th layer with the same second center of gravity value on the i-1th layer, and calculate the number of cross points after sorting;

Step 3. According to the order of level i from 2 to N, fix the nodes of the i-1th layer, sort according to the first center of gravity on the i-th layer from small to large, and calculate the number of cross points after sorting;

The second output module is used to store and output the sorting results when the number of cross points calculated in steps 1, 2, and 3 is 0, or, when the number of cycles in steps 1, 2, and 3 reaches the set maximum number of sorting times, Save the result with the smallest number of intersections calculated in steps 1, 2, and 3 and output it.

Compared with the prior art, it is simple and intuitive to output resource dependencies between nodes through a directed graph.

Those of ordinary skill in the art can understand that all or part of the steps of the above-mentioned embodiments can be implemented using a computer program flow, the computer program can be stored in a computer-readable storage medium, and the computer program can be run on a corresponding hardware platform (such as system, device, device, device, etc.), and when executed, includes one or a combination of the steps of the method embodiment.

Optionally, all or part of the steps in the above embodiments can also be implemented using integrated circuits, and these steps can be fabricated into individual integrated circuit modules, or multiple modules or steps among them can be fabricated into a single integrated circuit module accomplish. As such, the present invention is not limited to any specific combination of hardware and software.

The devices/functional modules/functional units in the above embodiments can be realized by general-purpose computing devices, and they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices.

When each device/functional module/functional unit in the above-mentioned embodiments is realized in the form of a software function module and sold or used as an independent product, it can be stored in a computer-readable storage medium. The computer-readable storage medium mentioned above may be a read-only memory, a magnetic disk or an optical disk, and the like.

The above is only a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Anyone skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present invention. Should be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope described in the claims.

Claims (4)

1. an output intent for resource information, is characterized in that, comprising:

Obtain the dependence of other resource nodes in resource in each resource node and system;

For described each resource node is distributed in the position of resource hierarchy, the Resource Dependence being wherein positioned at the resource node of the i-th+1 level is positioned at the resource that level is the resource node being less than or equal to i-th, wherein i=1,2 ..., N, N are positive integer;

If the gap between the level residing for two resource nodes of Existence dependency relationship is 1, connects two resource nodes in each dependence, obtain the directed graph of dependence;

Initiate the flow process of the directed graph exporting described dependence;

Wherein, the described flow process initiating the directed graph exporting described dependence comprises:

Calculate the i-th node layer go up the first center of gravity of node relative to the i-th-1 layer and go up the second center of gravity of node relative to the i-th+1 layer, set maximum sequence number of times, wherein: the first center of gravity of i-th layer of each node is the i-th-1 layer above has with this node the horizontal index sum of all nodes of dependence and the i-th-1 layer to go up and this node has the business of total number of the node of dependence; Second center of gravity of i-th layer of each node to be the i-th+1 layer upper node with this node the have horizontal index sum of all nodes of dependence and the i-th+1 layer are gone up and this node has the business of total number of the node of dependence;

Perform sequence flow process, described sequence flow process comprises:

Step 1, according to level i from the order of 2 to N, fix the node of the i-th-1 layer, sort from small to large according to the first center of gravity on i-th layer, calculate sequence after intersection count;

Step 2, according to the order of level i from 2 to N, exchange the position of the identical node of i-th layer of upper first center-of-gravity value, the intersection calculated after sequence is counted;

Step 3, according to level i from N-1 to the order of 1, fix the node of the i-th+1 layer, sort from small to large according to the second center of gravity on i-th layer, calculate sequence after intersection count;

Or described sequence flow process comprises:

Step 1, according to level i from N-1 to the order of 1, fix the node of the i-th+1 layer, sort from small to large according to the center of gravity relative to lower level node on i-th layer i.e. the second center of gravity, calculate sequence after intersection count;

Step 2, according to level i from N-1 to the order of 1, be directed to the position of the identical node of lower level node center-of-gravity value on exchanging i-th layer, i.e. the position of the node that the second center-of-gravity value is identical, calculate sequence after intersection count;

Step 3, according to level i from the order of 2 to N, fix the node of the i-th-1 layer, sort from small to large according to the first center of gravity on i-th layer, calculate sequence after intersection count;

If it is 0 that the intersection calculated in step 1,2,3 is counted, then preserve ranking results and export, or, if step 1,2,3 cycle-indexes reach the maximum sequence number of times of setting, then preserve the intersection calculated in step 1,2,3 and to count minimum result exporting;

Wherein, described horizontal index is the position of its transverse direction residing in level, is set to 1, turns right and increase progressively from leftmost bit.

2. method according to claim 1, is characterized in that, described method also comprises:

If the gap between the level residing for two resource nodes of Existence dependency relationship is greater than 1, in described dependence, distribute a dummy node one to one between two resource node place levels, then trigger the acquisition flow process of directed graph of dependence.

3. an output system for resource information, is characterized in that, comprising:

Acquisition device, for obtaining the dependence of other resource nodes in resource in each resource node and system;

First distributor, for being distributed in the position of resource hierarchy for described each resource node, the Resource Dependence being wherein positioned at the resource node of the i-th+1 level is positioned at the resource that level is the resource node being less than or equal to i-th, wherein i=1,2 ..., N, N are positive integer;

Jockey, when being 1 for the gap between the level residing for two resource nodes of Existence dependency relationship, connecting two resource nodes in each dependence, obtains the directed graph of dependence;

Output device, for initiating the flow process of the directed graph exporting described dependence;

Wherein, described output device comprises:

First computing module, for calculating the first center of gravity of the i-th node layer upper node relative to the i-th-1 layer and going up the second center of gravity of node relative to the i-th+1 layer, sets maximum sequence number of times, wherein:

First center of gravity of i-th layer of each node is the i-th-1 layer above has with this node the horizontal index sum of all nodes of dependence and the i-th-1 layer to go up and this node has the business of total number of the node of dependence; Second center of gravity of i-th layer of each node to be the i-th+1 layer upper node with this node the have horizontal index sum of all nodes of dependence and the i-th+1 layer are gone up and this node has the business of total number of the node of dependence;

First order module, for performing sequence flow process, described sequence flow process comprises:

Step 1, according to level i from the order of 2 to N, fix the node of the i-th-1 layer, sort from small to large according to the first center of gravity on i-th layer, calculate sequence after intersection count;

Step 2, according to the order of level i from 2 to N, be directed to the position of the identical node of the i-th-1 layer upper first center-of-gravity value on exchanging i-th layer, the intersection calculated after sequence is counted;

Step 3, according to level i from N-1 to the order of 1, fix the node of the i-th+1 layer, sort from small to large according to the second center of gravity on i-th layer, calculate sequence after intersection count;

First output module, intersection for calculating in step 1,2,3 is counted when being 0, preserves ranking results and also exports, or, step 1,2,3 cycle-indexes reach the maximum sequence number of times of setting time, preserve the intersection calculated in step 1,2,3 and to count minimum result exporting;

Or described output device comprises:

Second computing module, for calculating the first center of gravity of the i-th node layer upper node relative to the i-th-1 layer and going up the second center of gravity of node relative to the i-th+1 layer, set maximum sequence number of times, wherein: the first center of gravity of i-th layer of each node is the i-th-1 layer above has with this node the horizontal index sum of all nodes of dependence and the i-th-1 layer to go up and this node has the business of total number of the node of dependence; Second center of gravity of i-th layer of each node to be the i-th+1 layer upper node with this node the have horizontal index sum of all nodes of dependence and the i-th+1 layer are gone up and this node has the business of total number of the node of dependence;

Second order module, for performing sequence flow process, described sequence flow process comprises:

Step 1, according to level from N-1 to the order of 1, fix the node of the i-th+1 layer, sort from small to large according to the second center of gravity on i-th layer, calculate sequence after intersection count;

Step 2, according to the order of level i from N-1 to 1, be directed to the position of the identical node of i-th layer of second center-of-gravity value on exchanging the i-th+1 layer, the intersection calculated after sequence is counted;

Step 3, according to level i from the order of 2 to N, fix the node of the i-th-1 layer, sort from small to large according to the first center of gravity on i-th layer, calculate sequence after intersection count;

Second output module, intersection for calculating in step 1,2,3 is counted when being 0, preserves ranking results and also exports, or, step 1,2,3 cycle-indexes reach the maximum sequence number of times of setting time, preserve the intersection calculated in step 1,2,3 and to count minimum result exporting;

Wherein, described horizontal index is the position of its transverse direction residing in level, is set to 1, turns right and increase progressively from leftmost bit.

4. system according to claim 3, is characterized in that, described system also comprises:

Second distributor, when being greater than 1 for the gap between the level residing for two resource nodes of Existence dependency relationship, in described dependence, distribute a dummy node one to one between two resource node place levels, then trigger the acquisition flow process of directed graph of dependence.