International Business Machines Corporation

Steven Joseph Branda

John Joseph Stecher

Robert William Wisniewski

William Thomas Newport

Robert Vaughn Geiner

Randall Paul Baartman

Christopher D Johnson

Adam Thomas Stallman

Matthew Ryan Weaver

Christopher James Kundinger

Kristi Paula Peterson

Matthew Ara Goshgarian

Bhushan Kamlakar Lokhande

Brett Michael Yokom

In an embodiment, a first debug agent at a first computer receives a packet. The first debug agent adds a debug command and an identifier of the first debug agent to the packet and sends the packet to a receiving computer. A second debug agent at the receiving computer removes the debug command and the identifier of the first debug agent from the packet and sends the packet to a second program that executes at the receiving computer. The second debug agent further executes the debug command, which causes the second program that executes on the receiving computer to halt execution at a breakpoint or address watch memory location. The second debug agent sends the state of the second program to the first debug agent, which presents, at the first computer, the state and a listing of the second program.

Distributed debugging

A method, apparatus and program product deallocate an object from a memory heap in a virtual machine environment by, in part, determining that the object is replaceable using an object reference associated with the object. The object may additionally be automatically determined as being properly removable by using a value indicative of a number of object references associated with the object. Where these conditions are met, the object may be removed from the memory heap. Where a new object can fit into a space within the memory from which the object was removed, the new object may be automatically allocated into the space. The object may be designated as being replaceable using automated or manual processes. A garbage collector algorithm may additionally execute, as needed.

Object deallocation system and method

In an embodiment, a conditional branch is detected that selects between execution of a first alternative block and a second alternative block. A first count and a second count are saved, where the first count is a number of times the first alternative block was executed, and the second count is a number of times the second alternative block was executed. If the first count is greater than a threshold and the second count equals zero, the first alternative block is compiled into first alternative block object code and the second alternative block is not compiled. If the first count is not greater than the threshold, the first alternative block is compiled into the first alternative block object code and the second alternative block is compiled into second alternative block object code.

Controlling compiler optimizations

A method, apparatus, and program product to allocate processor resources to a plurality of logical partitions in a computing device including a plurality of processors, each processor having at least one general purpose processing element and a plurality of synergistic processing elements. General purpose processing element resources and synergistic processing element resources are separately allocated to each logical partition. The synergistic processing element resources to each logical partition are allocated such that each synergistic processing element is assigned to a logical partition exclusively. At least one virtual processor is allocated for each logical partition. The at least one virtual processor may be allocated virtual general purpose processing element resources and virtual synergistic processing element resources that correspond to the general purpose processing element resources and synergistic processing element resources allocated to the logical partition.

Localized multi-element processor resource sharing among logical partitions

A computer implemented method, apparatus and program product for analyzing performance data particular to an algorithm using a profiler algorithm, and automatically associates the performance data with a reference clock time. The performance data may be automatically associated with a tag, also associated with the reference clock time. Using the tag, the performance data may be associated with a portion of the algorithm. For instance, the tag may be associated with a corresponding tag associated with the algorithm. User input may be received that designates both the tag and an additional tag associated with the program code. Aspects may identify tags in the performance data that correspond to both the tag and additional tag of program code. The portion of the performance data bounded by the identified tags in the performance data may be retrieved and displayed to a user. In this manner, the performance data may be automatically associated with a portion of algorithm.

Method and system for associating profiler data with a reference clock

A program product, apparatuses, and methods provide for the collection of profile information for a component of a software program by generating a data structure that maps at least one method to a component. The method includes a name, and the data structure maps the method to the component using at least a portion of the name of the method. A class or pattern may also be mapped to a component. Furthermore, during profiling, a statistic associated with the execution of the method is determined; the data structure is accessed using the name of the method to determine the associated component; and the determined statistic is associated with the determined component. By doing so, method level and class level information can be aggregated to improve profiling, often leading to a clearer picture of which components are contributing to the performance and memory footprint of large scale software programs.

Mapping a class, method, package, and/or pattern to a component

A system for class verification includes a data storage device holding verification caches; and a host system in communication with the data storage device, the host system executing a virtual machine (VM), including a class verifier. The VM is configured to perform: initiating loading of a class; searching for the class in the verification caches, wherein a record from the verification caches, including a checksum, is returned upon locating the class; comparing the checksum in the record to a checksum of the class being loaded; completing the loading of the class when the checksums match; performing bytecode verification of the class upon one of: a checksum comparison mismatch, and a failure to locate the class in the verification caches; calculating new checksum of the class upon a successful bytecode verification; and storing the new checksum in the verification caches.

Methods, systems, and computer program products for class verification

A computer program communicates with a partition manager in the logical partition where the computer program is run. When resource allocation in the logical partition dynamically changes, the partition manager notifies the computer program of the configuration change. The computer program may autonomically adjust one or more configuration settings that affect performance of the computer program to dynamically tune the computer program to optimal performance each time the allocation of resources within the logical partition changes. The partition manager may notify the computer program of an impending change in resource allocation in the logical partition that runs the computer program, which allows the computer program to reconfigure its configuration setting(s) before the partition manager changes the resource allocation in the logical partition.

Autonomically adjusting one or more computer program configuration settings when resources in a logical partition change

An apparatus, program product and method associate a unique key with routines in an application to enable a profiler to ascertain whether to collect profile information for a routine during its execution. A key may be generated, for example, during deployment or installation of an application in an application server or other runtime environment, and subsequently associated with the routines in the application, e.g., by storing the key in the class and/or library files for the application. By doing so, each application in a runtime environment may be uniquely identified by a profiler during execution, such that profile information will only be collected for those applications for which profiling has been enabled.

Selective profiling of program code executing in a runtime environment

A method, apparatus, system, and signal-bearing medium that, in an embodiment, wait for expiration of a poll interval and in response to expiration of the poll interval, retrieve data regarding locks on objects and store the data in a log. In an embodiment, the stored data may include an identifier of the lock, a name of a class from which the threads were instantiated, a number of the threads, and a thread stack. The threads are waiting on the locks, and the lock wait times for the threads are calculated and stored in the log. The lock wait time is the time that the respective thread has waited on the lock. If any of the lock wait times exceeds a threshold, an identifier of the thread associated with the lock wait time that exceeds the threshold is stored in the log.

Logging lock data

The present invention a synchronous peer to peer transfer model that utilizes all available network bandwidth to deploy application code to an entire cluster as fast as it can be sent to one machine. A method in accordance with an embodiment of the present invention includes: determining a number N of simultaneous connections that should be opened to the cluster members to maximize network bandwidth; and synchronously deploying the application to the cluster members using the N simultaneous connections.

Synchronous peer to peer deployed application propagation for large clusters

The 'API Usage Tool' (AUT) comprises an Interactive Developer Environment Plug-in (IDEP) and a Web Service Component (WSC). The IDEP opens the source code file containing API method calls, identifies the API method calls in the source code, and saves the identified API method calls to an API usage log. The WSC searches API usage data sheets for usage, best practices and known bugs for each identified API method call. The WSC generates an API usage compilation based on the identified API method calls. The IDEP compares the API usage compilation to the dynamic data in the usage log, looking for conflicts between the compiled usage and the actual usage in the source code. The IDEP marks any API method calls in the source code that do not comport with the compiled usage guidelines.

Multiplatform API usage tool

A method for capturing and converting legacy applications into a Business Process Execution Language (BPEL) model supporting a Service Oriented Architecture (SOA), the method comprising: starting a recorder for recording the legacy applications; mapping the plurality of variables of the legacy applications to a plurality of fields and to a plurality of sub-fields of the BPEL model; highlighting and identifying the plurality of fields and the plurality of sub-fields; identifying and generating partner links; identifying additional input variables of the legacy applications; mapping the additional input variables of the legacy applications to arbitrary variables; repeating the previous steps until an end result is generated; and ending the recorder.

Business process execution language (BPEL) application generator for legacy interfaces

According to the preferred embodiments, an apparatus and method is described for creating a real-time class package to class archive file mapping index that improves the performance of a class loader to load needed classes in an object oriented programming environment. In preferred embodiments, the class loader includes a mapping mechanism that creates and maintains a real-time class package to file archive mapping index. In preferred embodiments, the mapping mechanism optimizes access to the file archive mapping index. In a preferred embodiment, when the mapping mechanism finds a entry in the file archive mapping index for the package, but the class is not found, the class is searched in the class path beginning from the last file archive listed in the index to optimize the search. In other embodiments, the class loader includes a large package list that is used to further optimize access to the archive index.

Creating a real-time class package to class archive file mapping index

An apparatus and method is described for identification of applications that benefit from HA features and assisting a system administrator in the installation of the applications in an application server with HA features configured properly for run-time operation. In preferred embodiments, an HA policy engine allows a system administrator to set up one or more general HA policies in a policy table. In a preferred embodiment, an HA run-time engine uses the policies in the policy table to configure new applications being installed in the application server. Other embodiments include an application inspection unit that introspects the byte code of the application as well as deployment descriptors to determine which features and APIs are being used that can take advantage of HA functions.

Growing community of inventors

Rochester, MN, United States of America

Steven Joseph Branda