Abstract:
The current document is directed to aggregation of computers into distributed computing systems and, in particular, to methods and systems that simulate computer-system aggregations to test computer-system-aggregation management subsystems. In a described implementation, a host-gateway appliance is modified to simulate host-server-computer responses to management commands and requests. In this implementation, a replicated and modified management-server database is used both by a management server under test as well as by the modified host-gateway appliance.
Abstract:
The current document is directed to methods and systems that determine whether or not two graph-like representations of two physically or temporally distinct computer systems or computer-system configurations are equivalent. The currently described methods and systems extract a first and second ordered set of subgraphs from each of a first and second graph-like representation of a first and a second computer system. The ordered sets of subgraphs are logically aligned, forming a set of subgraph pairs. The currently described methods and systems transform the first and second subgraph of each subgraph pair into a corresponding first and second set of trees, label the trees, and then compare labels at each level of the trees to determine whether or not an isomorphic tree can be found in the second set of trees for each tree in the first set of trees.
Abstract:
The current document is directed to methods and systems that determine whether or not two graph-like representations of two physically or temporally distinct computer systems or computer-system configurations are equivalent. The currently described methods and systems extract a first and second ordered set of subgraphs from each of a first and second graph-like representation of a first and a second computer system. The ordered sets of subgraphs are logically aligned, forming a set of subgraph pairs. The currently described methods and systems transform the first and second subgraph of each subgraph pair into a corresponding first and second set of trees, label the trees, and then compare labels at each level of the trees to determine whether or not an isomorphic tree can be found in the second set of trees for each tree in the first set of trees.