Abstract: A graphical representation of a service model provides a full view of a portion of the graphical representation. A sub graph view may be displayed for nodes of the graphical representation of the service model that are associated with a selected node, including nodes that may not be visible in the full view. The sub graph view may be interactive, providing additional information regarding the nodes displayed in the sub graph view, and allowing making nodes in the sub graph view visible or invisible in the full view. Information may be displayed in the sub graph view about the status of the components being modeled by the service model corresponding to nodes displayed in the sub graph view.

Abstract: A method using statistical parameters (e.g. mean, standard deviation, exceptional values) of performance monitoring metrics to substantially reduce the quantity of performance monitoring data collected and reported, make system performance monitoring scalable and enhance the readability of the system performance display. The number of metrics monitored may be reduced by monitoring only one of any two metrics that are closely correlated.

Abstract: Systems and methods for extensible distributed configuration management of computer resources are described. Examples include a computer system including a processing unit and a storage device that stores a model definition and one or more asset plug-ins (each of the one or more asset plug-ins configured to expose at least one asset object that represents a computer resource). The computer system further includes memory that stores an asset model created based at least in part on the model definition, and a network interface configured to deploy to at least one managed system a compatible asset plug-in (the model definition including at least one conditional reference to the compatible asset plug-in). If a condition specified within the asset model is satisfied the processing unit selects the compatible asset plug-in for deployment, the condition being defined within the model definition and designated as applicable to the at least one conditional reference.

Abstract: Disclosed herein is a computer implemented technique for discovering the information technology resources that are involved in a particular networked business transaction. The system comprises three basic components. A robotic transaction playback client records the various steps in a particular transaction and can repetitively execute these steps to analyze the results. A network record collector observes the traffic throughout the network in response to the repeated instances of the transaction executed by the robotic transaction playback client. A backend processor analyzes the observations of network traffic to determine which ones are possibly tied to the transaction, and from this information determine which network components are part of the transaction being analyzed. Event timing information from a plurality of executions of a particular transaction are used to determine resource usage and paths.

Abstract: A system and method updates a device by storing into nondisk nonvolatile storage such as flash memory, the files used to update the device, using data structures that are swapped, a portion at a time, into available RAM of the device.

Abstract: Systems and methods implementing utility-maximized scheduling of time-sensitive tasks in a resource constrained-environment are described herein. Some embodiments include a method for utility-optimized scheduling of computer system tasks performed by a processor of a first computer system that includes determining a time window including a candidate schedule of a new task to be executed on a second computer system, identifying other tasks scheduled to be executed on the second computer system within said time window, and identifying candidate schedules that each specifies the execution times for at least one of the tasks (which include the new task and the other tasks). The method further includes calculating an overall utility for each candidate schedule based upon a task utility calculated for each of the tasks when scheduled according to each corresponding candidate schedule and queuing the new task for execution according to a preferred schedule with the highest overall utility.

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: Systems and methods for recording and replaying client-server transactions on selected clients in order to gauge the performance of the client-server system from the perspective of the client. In one embodiment, a method comprises playing back a set of recorded transactions on a client, monitoring selected performance-related parameters at the client, and transmitting monitored data to the server for analysis or for viewing by a system administrator. The set of transactions is recorded on a first client by replacing a standard Internet transaction driver (e.g., WinInet.DLL) with a modified driver that is configured to intercept function calls. The function calls and corresponding parameters are recorded in a file which is later transmitted to a client, where the recorded transaction information is used to reproduce the transactions on the client. As the transactions are played back, performance data may be monitored and forwarded to a management server for analysis, display, etc.

Abstract: A balancing technique allows a database administrator to perform a mass data load into a relational database employing partitioned tablespaces. The technique automatically balances the usage of the partitions in a tablespace as the data is loaded. Previous definitions of the partitions are modified after the loading of the data into the tablespace to conform with the data loaded into the tablespace.

Abstract: Methods, apparatus, systems and computer program products to capture discovery task information are described. More specifically, a graphical user interface is described that simplifies the task of defining what types of components (hardware and software), domains and methods are to be used during an IT infrastructure discovery operation. One benefit of using the described user interface is that the user is relieved of the burden of determining what aspects of the discovery action need be defined. Another benefit is that a user may be asked for input for only those elements necessary to the discovery—based on the user's prior input. For example, if the only type of component identified for discovery are JAVA® platforms, only those discovery methods (e.g., JMX) related to JAVA® platforms will be proffered to the user during that phase of specifying the discovery operation.

Abstract: A method for measuring and determining the duplex modes of a network interface. The method assumes the network interface to be operating in a half-duplex mode until the bandwidth utilization reaches a threshold. When the threshold is reached, the method checks the traffic collision in the interface. If there is no collision, then the duplex mode is determined to be full-duplex. If there is collision, then the duplex mode is determined to be half-duplex and an alarm is set off. In another embodiment, the interface type is determined through SNMP. If the interface is a WAN interface, then the interface is determined to be full-duplex.

Abstract: An online index building operation is disclosed for building an index from source data with minimal loss of availability to the source data. The source data can be maintained in a relational database system, such as in a tablespace of a DB2® environment. The disclosed operation creates a consistent image of the source data as of a point-in-time and creates an index from the consistent image. Then, the disclosed operation repeats the acts of making the image consistent as of a subsequent point-in-time and updating the index to reflect the subsequent consistent image until substantially caught up with the current changes to the source data. If not caught up, the disclosed operation continues unless it is falling behind at which point the operation terminates. If it is caught up, the disclosed operation locks access to the source data, updates the image to reflect any final changes, updates the index, and allows access to the index.

Abstract: Constraint processing for a relational database generates primary (e.g., based on primary key values) and constraint index records (e.g., based on foreign key values) during table load operations that are then sorted in a manner that rapidly and unambiguously identifies rows that fail the specified constraint test. Rows so identified may be deleted to maintain the constraint (e.g., referential) integrity of a child table. In one case, child table row data may be processed in constraint key order, eliminating the need first load the child table with row data and then delete those rows that subsequently fail the integrity test.

Abstract: A system architecture and a method for managing using a cellular architecture to allow multi-tier management of events such as the managing of the actual impact or the potential impact of IT infrastructure situations on business services. A preferred embodiment includes a high availability management backbone to frame monitoring operations using a cross-domain model where IT component events are abstracted into IT Aggregate events. By combining IT Aggregate events with transaction events, an operational representation of the business services is possible. Another feature is the ability to connect this information to dependent business user groups such as internal end-users or external customers for direct impact measurement.

Abstract: A system and method identifies the times that certain applications are started and stopped on a computer system and such information about several computer systems is collected using a central computer system to allow decisions regarding software may be made based on usage of those certain applications.

Abstract: A technique to quiesce a database without causing after-arriving access requests to abnormally terminate interrogates database management system control structures associated with the database. Specified modifications to these control structures can be made so that subsequent access requests to the database (i.e., during quiesce operations) are not abnormally terminated. Once quiesced, regular or special purpose maintenance or testing operations, the starting or stopping of log keeping operations or similar operations may be made to the database. Once these are complete, the database control structures may be updated again to permit pending/scheduled access requests to proceed.

Abstract: A network management system in which an administrator may specify attributes of interest, and the specified attributes are monitored. Graphs/reports corresponding to the specified reports may be generated in a single place (e.g., on a web page) such that the data points for the various attributes may be correlated easily. The specified attributes may contain attributes which are dynamically created (e.g., counters measuring various aspects related to instances of objects). The network management system provides the ability to discover such attributes using a suitable interface, and selection of such attributes as well.

Abstract: In one embodiment of the present invention, a messaging program at a remote computer can send a first message to a portal computer according to a one-way protocol such as HTTP. A portal program at the portal computer can receive the first message and determine if information should be sent to the portal computer. If so, the portal computer can generate a reply message that includes the information and send the reply message to remote computer on the same connection over which the first message was received. In this manner, the portal computer can send configuration control information and other information to the messaging program without requiring leased lines, dial-up connections or a VPN. Moreover, since the communication according to the one-way protocol was initiated at the remote computer, a firewall will allow the remote computer to receive the reply message.

Abstract: Unobtrusive Copies of Actively Used Compressed Indices Methods, devices and systems to make compressed backup copies of in-use compressed database indices are described. In general, an “oldest” time at which index pages in working memory had been updated is identified. Compressed index pages may be directly copied without the need to bring them into working memory or uncompressing them. The identified “oldest” time is then associated with the compressed backup copy. In some embodiments, an entire compressed backup copy may be associated with a single point in time (e.g., the identified “oldest” time). In other embodiments, a compressed backup copy may be associated with multiple points in time (e.g., one time for each portion of the compressed index that is being backed-up). Compressed indices copied in accordance with the invention may be used during restore operations to reconstruct database indices using the identified “oldest” time and database log files.

Abstract: A system and method for replaying a predefined path through a set of web pages. The system and method comprises selecting in chronological order a saved request in a request history. The saved requests correspond to a set of user requests made at a web page from the set of web pages. Furthermore, the present invention comprises determining whether the saved request is a form request, and if so finding a best fit form on the web page from the set of web pages and sending a replay request to the best-fit form. If the saved request is not a form request, making the replay request to a best-fit URL.