Abstract: Service impact data is efficiently propagated in a directed acyclic graph with restricted views. One or more service components, impact rules and business rules are grouped together into a directed acyclic graph and a related metadata array. Impact propagation uses related metadata array to minimize traversal of the graph. As nodes of the graph are updated to propagate impact data, a determination is made as to when no further impact propagation is required. Subsequently, calculations are terminated without having to traverse the entire graph. This method allows a system or business administrator to view and receive real-time notification of the impacted state of all nodes in the graph that are available to their permitted view. Restricted views ensure that available service impact data is only displayed to end users having the proper authorization to view the underlying impact model data.

Abstract: Systems, methods and computer readable media for centrally managed impersonation are described. Examples include a system having a central server and a remote shell daemon running on a remote machine, wherein a trust relationship is established between the central server and the remote shell daemon. Examples also include a method wherein a user sends the management system a request to act upon a remote machine. The management system determines whether the user is authenticated for the requested action. Upon authentication, the management system identifies an impersonation policy based on user profile and the remote machine. The management system connects to the remote machine, impersonates an elevated privilege account if required, and executes the user action on the remote machine.

Abstract: Systems and methods are disclosed that implement a data collection infrastructure that supports both agent-based and agentless data collection. Existing data collection scripts may be used, whether agent-based or agentless, and new scripts may be created that include commands that may execute either locally or remotely, as desired. These scripts, while executed locally, may interact with either the local machine or another remote machine for performing data collection, corrective actions, or other desired functionality. An execution context defines whether commands executed by the script are to execute locally or remotely, and a context handler allows processing those commands either locally or remotely depending on the execution context, transparently to the script. Data generated by remote execution may be transported back to the local machine for manipulation locally, transparently to the script.

Abstract: A technique for allowing collapse or expansion of a multi-node subgraph of a directed acyclic graph is disclosed. The subgraph may be collapsed or expanded with a single user interaction, retaining the important service context information and relations, while minimizing information of lesser importance in the service model.

Abstract: A method, system, and medium for compressing systems management information in a historical data store. Dynamically determining the appropriate compression algorithm to apply based on the type of data being compressed and stored. As further input is received for any particular measurement, the appropriate compression algorithm will be automatically selected from the set of available compression algorithms or be defined by a user configuration parameter. The amount of historical data stored with the minimal amount of data loss is optimized by the system dynamically changing the compression algorithm used for the given input data over a particular time span. The system engineer is therefore presented with the pertinent information for monitoring, administrating and diagnosing system activities.

Abstract: A method, system, and medium for compressing systems management information in a historical data store. Dynamically determining the appropriate compression algorithm to apply based on the type of data being compressed and stored. As further input is received for any particular measurement, the appropriate compression algorithm will be automatically selected from the set of available compression algorithms or be defined by a user configuration parameter. The amount of historical data stored with the minimal amount of data loss is optimized by the system dynamically changing the compression algorithm used for the given input data over a particular time span. The system engineer is therefore presented with the pertinent information for monitoring, administrating and diagnosing system activities.

Abstract: A method, system and medium for recording events in a system management environment is described. As system events are detected in an enterprise computing environment they are stored in a manner allowing them to be “replayed” either forward or reverse to assist a system administrator or other user to determine the chain of events that affected the enterprise. The system engineer and business process owner are therefore presented with pertinent information for monitoring, administrating and diagnosing system activities and their correlation to business services.

Abstract: Service impact data is efficiently propagated in a directed acyclic graph with restricted views. One or more service components, impact rules and business rules are grouped together into a directed acyclic graph and a related metadata array. Impact propagation uses related metadata array to minimize traversal of the graph. As nodes of the graph are updated to propagate impact data, a determination is made as to when no further impact propagation is required. Subsequently, calculations are terminated without having to traverse the entire graph. This method allows a system or business administrator to view and receive real-time notification of the impacted state of all nodes in the graph that are available to their permitted view. Restricted views ensure that available service impact data is only displayed to end users having the proper authorization to view the underlying impact model data.

Abstract: A method, system, and medium for compressing systems management information in a historical data store. Dynamically determining the appropriate compression algorithm to apply based on the type of data being compressed and stored. As further input is received for any particular measurement, the appropriate compression algorithm will be automatically selected from the set of available compression algorithms or be defined by a user configuration parameter. The amount of historical data stored with the minimal amount of data loss is optimized by the system dynamically changing the compression algorithm used for the given input data over a particular time span. The system engineer is therefore presented with the pertinent information for monitoring, administrating and diagnosing system activities.

Abstract: A list folding process dynamically groups items of a list into logically related visual folds to reduce the number of items to be displayed in a window of a computer screen. The process determines attributes of the items to be displayed and dynamically groups items together into a special group called a visual fold based on the attributes. The rules for folding items based on attributes can be defined by a particular user so that each view of the items may be different among users. As the attributes of each item change, the display of the items and visual folds may be automatically adjusted to reflect the current proper grouping. The folding process therefore allows a user to view the maximum amount of information in available display area of a computer screen window.

Abstract: A method, system and medium for efficiently propagating service impact data in a directed acyclic graph. One or more service components, impact rules and business rules will be grouped together into a directed acyclic graph and a related metadata array. Impact propagation uses related metadata array to minimize traversal of the graph. As nodes of the graph are updated to propagate impact data a determination is made as to when no further impact propagation is required and calculations are terminated without having to traverse the entire graph. This method will allow a system or business administrator to maintain real-time notification and visualization of, the impacted state of all objects in the graph.