Abstract: Datacenter configuration needs to be managed. A configuration engine (CE) manages configuration data of clusters and/or datacenters. The CE allows users to check out, edit, and check in configuration components. Versioned interfaces are placed between configuration components through data contracts. The CE supports the expression of constraints that ensure global consistency across configuration components and versions, isolates changes in the datacenter from structural changes in configuration components, and enables partial configuration branching to allow for active snapshots that enable configuration rollback. The CE ensures that types are consistent and constraints are satisfied at check-in time to eliminate unsound or inconsistent configuration in the first place. When the active configuration in the datacenter changes, multiple versions of configuration may be simultaneously deployed for a window of time.

Abstract: Datacenter configuration needs to be managed. A configuration engine (CE) manages configuration data of clusters and/or datacenters. The CE allows users to check out, edit, and check in configuration components. Versioned interfaces are placed between configuration components through data contracts. The CE supports the expression of constraints that ensure global consistency across configuration components and versions, isolates changes in the datacenter from structural changes in configuration components, and enables partial configuration branching to allow for active snapshots that enable configuration rollback. The CE ensures that types are consistent and constraints are satisfied at check-in time to eliminate unsound or inconsistent configuration in the first place. When the active configuration in the datacenter changes, multiple versions of configuration may be simultaneously deployed for a window of time.

Abstract: A method and system is provided for instrumenting a program by optimizing probe insertion. The number of probe insertions into instrumented code is reduced by providing optimal probe insertion points. The control flow of the code is analyzed along with the arc and block relationships to build a post-dominator tree. An optimization map is generated from the post-dominator tree that provides the optimal probe insertion points. Once the probes are inserted and data is collected by running the binary representing the code and probes, the data may be overlaid onto the optimization map and arc and block relationships to provide code coverage data.

Abstract: In embodiments of the invention, selected aspects of a process' call stacks are hashed, and the hash is used to capture the execution state of the process in a concise form and with minimal impact on the performance of the process and with no modification to the process code. The hash allows vendors and developers to classify failures in order to associate them with their known root causes to support rapid customer feedback and to maximize efficiency of correction. Further, the hash provides a metric usable to prioritize diagnosis of failures. In an embodiment of the invention, the identities of modules on the call stack are hashed in combination with some but not all offset information to minimize the affect of patches and minor changes to the code, and improve the ability to discriminate different execution paths.