Abstract: Methods, computer program products, computer systems, and the like providing for executing orchestration operations across data center infrastructures are disclosed. In one embodiment, the method includes analyzing a property graph to determine whether a node representing at least one entity in a first data center infrastructure has a contact point with a node representing one or more entities representing one or more core physical or hardware-based resources in a second data center infrastructure. If a contact point exist between nodes of associated with the first and second data centers, the orchestration operation is executed on the at least one entity in the first data center and a corresponding orchestration operation is executed on at least another entity in the second data center infrastructure represented at a contact point in the dependency relationships of the property graph.

Abstract: Various systems and methods are provided for propagating information throughout a data center or other network environment. For instance, in certain embodiments, the functionality disclosed herein includes determines propagation rules, and then either stores and/or propagates those rules throughout the datacenter or other network environment. Propagation rules define various conditions or other variables that govern propagation of information throughout a system, such as those systems described herein. The propagation rules can then be used to perform various other functionality. For instance, the functionality described herein can be used to process updates to entities. The functionality described herein can also be used to process updates to propagation metadata. Additionally, the functionality described herein can be used to process the creation of new relationships. The functionality described herein can also be used to process the deletion of objects and/or relationships.

Abstract: Methods, computer program products, computer systems, and the like providing for executing orchestration operations across data center infrastructures are disclosed. In one embodiment, the method includes analyzing a property graph to determine whether a node representing at least one entity in a first data center infrastructure has a contact point with a node representing one or more entities representing one or more core physical or hardware-based resources in a second data center infrastructure. If a contact point exist between nodes of associated with the first and second data centers, the orchestration operation is executed on the at least one entity in the first data center and a corresponding orchestration operation is executed on at least another entity in the second data center infrastructure represented at a contact point in the dependency relationships of the property graph.

Abstract: Methods, computer program products, computer systems, and the like providing for representation and analysis of entities and their relationships are disclosed. The method, for example, includes selecting a node of a plurality of nodes in a property graph, analyzing entity information associated with the node, and, in response to the analyzing, storing the entity information in dependency information. Each node of the plurality of nodes represents an entity of a plurality of entities, and is coupled to at least one other node of the plurality of nodes by one or more links of a plurality of links of the property graph. Each of the one or more links represents a relationship between the each node and the at least one other node. The entity information is information regarding the entity. The dependency information is configured to facilitate orchestration of one or more of the plurality of entities.

Abstract: Methods, computer program products, computer systems, and the like providing for representation and analysis of entities and their relationships are disclosed. The method, for example, includes selecting a node of a plurality of nodes in a property graph, analyzing entity information associated with the node, and, in response to the analyzing, storing the entity information in dependency information. Each node of the plurality of nodes represents an entity of a plurality of entities, and is coupled to at least one other node of the plurality of nodes by one or more links of a plurality of links of the property graph. Each of the one or more links represents a relationship between the each node and the at least one other node. The entity information is information regarding the entity. The dependency information is configured to facilitate orchestration of one or more of the plurality of entities.

Abstract: Various systems and methods are provided for propagating information throughout a data center or other network environment. For instance, in certain embodiments, the functionality disclosed herein includes determines propagation rules, and then either stores and/or propagates those rules throughout the datacenter or other network environment. Propagation rules define various conditions or other variables that govern propagation of information throughout a system, such as those systems described herein. The propagation rules can then be used to perform various other functionality. For instance, the functionality described herein can be used to process updates to entities. The functionality described herein can also be used to process updates to propagation metadata. Additionally, the functionality described herein can be used to process the creation of new relationships. The functionality described herein can also be used to process the deletion of objects and/or relationships.

Abstract: Disclosed are methods and systems for optimizing business continuity in IT environments. One such method involves comparing a representation and a template. The representation represents units of computing entities, and relationships between the units of computing entities. The method determines whether a system represented by the representation meets a threshold represented by the template based on a result of the comparing, and provides a result of the determining. The threshold can established by a disaster recovery site, a service level agreement, or a configuration drift, and the result of the determining can be used to evaluate the disaster recovery site, the service level agreement, or the configuration drift.

Abstract: Various systems and methods for detecting a deviation of an existing connectivity of a data center from a pre-determined connectivity are presented. One method involves detecting a deviation of an existing connectivity of a data center from a pre-determined connectivity by defining a start node. The start node is defined based on a condition of a component of the data center. The condition is determined based on an explicit relationship between a node and another node of the data center. The method involves conditionally matching a sub-graph and a portion of a main graph by identifying the deviation. The conditional matching is begun at the start node. A failure to conditionally match a portion of the sub-graph and a portion of the main-graph indicates that the deviation exists.

Abstract: Service level representations of applications being made highly available are automatically created and published, based on their operational representations. A repository containing multiple application service templates is maintained. Each application service template defines the attributes of an application type to include in corresponding service level representations. To create a service level representation for a specific application instance, an appropriate application service template is selected from the repository. The attributes of a copy of the selected template are populated with values describing the application instance and its associated resources (including a service identifier), thereby automatically creating a service level representation of the application instance. The attributes can be populated with data read from resources of the operational representation of the application instance.

Abstract: Various systems and methods for detecting a deviation of an existing connectivity of a data center from a pre-determined connectivity are presented. One method involves detecting a deviation of an existing connectivity of a data center from a pre-determined connectivity by defining a start node. The start node is defined based on a condition of a component of the data center. The condition is determined based on an explicit relationship between a node and another node of the data center. The method involves conditionally matching a sub-graph and a portion of a main graph by identifying the deviation. The conditional matching is begun at the start node. A failure to conditionally match a portion of the sub-graph and a portion of the main-graph indicates that the deviation exists.

Abstract: A computer-implemented method for deduplicating file data in tiered file systems may include identifying a tiered file system that includes a primary storage tier and a deduplicated storage tier. The method may also include detecting at least a portion of file data that has not been accessed in the primary storage tier within a predetermined period of time. The method may further include determining whether the portion of data stored in the primary storage tier is also stored in the deduplicated storage tier. In addition, the method may include ensuring that the deduplicated storage tier is currently storing a unique instance of the portion of file data stored in the primary storage tier and then removing the portion of file data from the primary storage tier. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Embodiments of the present invention are directed to a method and system for filesystem deduplication that uses both small fingerprint granularity and variable length sharing techniques. The method includes accessing, within an electronic system, a plurality of files in a primary storage filesystem and determining a plurality of fingerprints for the plurality of files. Each respective fingerprint may correspond to a respective portion of a respective file of the plurality of files. The method further includes determining a plurality of portions of the plurality of files where each of the plurality of portions has the same corresponding fingerprint and accessing a list comprising a plurality of portions of files previously deduplicated. A portion of a file of the plurality of files not present in the list may then be deduplicated. Consecutive portions of variables lengths having the same corresponding fingerprints may also be deduplicated.

Abstract: Embodiments of the present invention are directed to a method and system for filesystem deduplication that uses both small fingerprint granularity and variable length sharing techniques. The method includes accessing, within an electronic system, a plurality of files in a primary storage filesystem and determining a plurality of fingerprints for the plurality of files. Each respective fingerprint may correspond to a respective portion of a respective file of the plurality of files. The method further includes determining a plurality of portions of the plurality of files where each of the plurality of portions has the same corresponding fingerprint and accessing a list comprising a plurality of portions of files previously deduplicated. A portion of a file of the plurality of files not present in the list may then be deduplicated. Consecutive portions of variables lengths having the same corresponding fingerprints may also be deduplicated.

Abstract: A method for efficiently synchronizing configuration data within distributed computing systems may include: 1) maintaining a hash tree that is based on the hierarchical relationship of each object within a distributed computing system that is relevant to the computing device, 2) determining, during a reconciliation process with an additional computing device, that a hash of a top-level node of the hash tree differs from a hash of a corresponding node of the additional computing device's hash tree, 3) identifying, by iterating through the hash levels of the computing device's hash tree, at least one leaf node within the computing device's hash tree whose hash differs from a hash of a corresponding leaf node within the additional computing device's hash tree, 4) receiving the changed leaf node's value from the additional computing device, and then 5) updating the identified leaf node's value to match the changed leaf node's value.

Abstract: Techniques for optimizing configuration partitioning are disclosed. In one particular exemplary embodiment, the techniques may be realized as a system for configuration partitioning comprising a module for providing one or more policy managers, a module for providing one or more applications, the one or more applications assigned to one or more application groups, a module for associating related application groups with one or more blocks, and a module for assigning each of the one or more blocks to one of the one or more policy managers, wherein if one or more of the one or more blocks cannot be assigned to a policy manager, breaking the one or more blocks into the one or more application groups and assigning the one or more application groups to one of the one or more policy managers.

Abstract: Techniques for optimizing configuration partitioning are disclosed. In one particular exemplary embodiment, the techniques may be realized as a system for configuration partitioning comprising a module for providing one or more policy managers, a module for providing one or more applications, the one or more applications assigned to one or more application groups, a module for associating related application groups with one or more blocks, and a module for assigning each of the one or more blocks to one of the one or more policy managers, wherein if one or more of the one or more blocks cannot be assigned to a policy manager, breaking the one or more blocks into the one or more application groups and assigning the one or more application groups to one of the one or more policy managers.

Abstract: A system and method for providing highly-available volume mount points is disclosed. According to one embodiment, in a system including a shared storage resource coupled to a server cluster and accessible by a node of said server cluster, a volume mount point is provided within the shared storage resource. According to another embodiment, the shared storage resource includes a base volume and a target volume and a volume mount point corresponding to the target volume is provided within the base volume. A first mount is configured corresponding to the target volume and a mount order dependency relationship is defined between the first mount and a second mount corresponding to the base volume. Embodiments of the present invention may be used to ensure that a new (secondary) node accesses a shared disk or volume in the same way it was accessed before a transition event (e.g., failover or switchover).

Abstract: A system and method for providing highly-available volume mount points is disclosed. According to one embodiment, in a system including a shared storage resource coupled to a server cluster and accessible by a node of said server cluster, a volume mount point is provided within the shared storage resource. According to another embodiment, the shared storage resource includes a base volume and a target volume and a volume mount point corresponding to the target volume is provided within the base volume. A first mount is configured corresponding to the target volume and a mount order dependency relationship is defined between the first mount and a second mount corresponding to the base volume. Embodiments of the present invention may be used to ensure that a new (secondary) node accesses a shared disk or volume in the same way it was accessed before a transition event (e.g., failover or switchover).