Abstract: A method and system to convert an existing web service from a first web services implantation type to a second web services implementation type. Example implementation types include SOAP and Representational State Transfer (REST). This conversion is achieved by recognizing and classifying available information from each of the distinct implementation types. After proper recognition and classification as disclosed herein, a deterministic process may be utilized to assist in converting or translating the exposed interface; thereby assisting in developing an interface, based on a different interface type than the one already exposed, may be provided.

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: A baseline technique allows reducing the number of threshold violation predictions that need to be generated in a performance monitoring system. One or more baselines may be calculated based on long-term trends in a monitored metric. If the metric is within the baseline, then predictions regarding short-term trends in the metric may be omitted. If the metric is outside the baseline, then short-term trends may be analyzed to predict possible threshold violations.

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 improved batch flow management are described. At least some embodiments include a computer system for managing a job flow including a memory storing a plurality of batch queue jobs grouped into Services each including a job and a predecessor job. A time difference is the difference between a scheduled job start time and an estimated predecessor job end time. Jobs with a preceding time gap include jobs immediately preceded only by non-zero time differences. The job start depends upon the predecessor job completion. The computer system further includes a processing unit that identifies jobs preceded by a time gap, selects one of the Services, and traverses in reverse chronological order a critical path of dependent jobs within the Service until a latest job with a preceding time gap is identified or at least those jobs along the critical path preceded by another job are traversed.

Abstract: Techniques are described to allow the deprecation of classes in an object-oriented data model, such as a CDM for a CMDB. When a class is deprecated and replaced by another existing or new class, data associated with instances of the deprecated class may be migrated to the replacement class. A mapping between the deprecated class and its replacement class may be provided to allow existing applications to continue to access data using the deprecated class without change until the deprecated class is finally deleted or the application is updated to use the replacement class. New applications written to use the object-oriented data model after the deprecation may use the replacement class to access data instances created using the original data model.

Abstract: A technique is disclosed that avoids index page splits when inserting large numbers of rows into a table of a relational database. Keys in index pages are moved to successive index pages to make room to insert keys on the original index page. Where no room is available on successive pages, a new index page is created to hold moved keys. The result is typically a smaller chain of index pages with better locality than using the conventional insertion technique of splitting index pages.

Abstract: Systems and methods for automated computer systems event processing are described herein. At least some example embodiments include a communication interface that receives an event message and a processing unit (coupled to the communication interface) that processes the event message and that further obtains, parses and tokenizes an character string that includes one or more delimited elements selected from the group consisting of a constant, a variable and a function, wherein each function accepts as input the one or more delimited elements. The processing unit further evaluates the parsed and tokenized character string in response to receiving the event message and initiates an action based upon the result of the evaluation. The processing unit also creates a common execution environment for performing the processing, obtaining, parsing, tokenizing and evaluation.

Abstract: Systems and methods implementing a demand-driven workload scheduling optimization of shared resources used to execute tasks submitted to a computer system are disclosed. Some embodiments include a method for demand-driven computer system resource optimization that includes receiving a request to execute a task (said request including the task's required execution time and resource requirements), selecting a prospective execution schedule meeting the required execution time and a computer system resource meeting the resource requirement, determining (in response to the request) a task execution price for using the computer system resource according to the prospective execution schedule, and scheduling the task to execute using the computer system resource according to the prospective execution schedule if the price is accepted.

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: 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 DBA may pre-generate database recovery jobs on a convenient schedule at a local site, then recover a database at a disaster recovery site. Archive log files for the database that are generated in the interim between recovery job generation and recovery job execution are automatically incorporated into the recovery job when it executes, extending the recovery point closer to the time of the disruption that triggered the need or desire for recovery.

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: A transaction processing system that includes a communications bridge between clients and a transaction processing engine provides a way to correlate events associated with the communications bridge and events associated with the transaction processing engine. By passing a unique identification information with the transaction requests and response between the communications bridge and transaction processing engine and including the unique identification information in logging information created by each, a correlation utility may correlate logging information to create a more complete view of the events associated with a transaction, including end-to-end response times.

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: 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: 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 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.