| Patent application number | Description | Published |
|---|
| 20080301682 | Inserting New Transactions Into a Transaction Stream - In an embodiment, a selection of an original transaction is received. In response to the selection of the original transaction, a call stack of the application that sends the original transaction during a learn mode of the application is saved. A specification of a new transaction and a location of the new transaction with respect to the original transaction in an transaction stream is received. During a production mode of the application, the original transaction is received from the application. A determination is made that the call stack of the application during the production mode matches the saved call stack of the application during the learn mode. In response to the determination, the new transaction is inserted at the location into a transaction stream that is sent to a database. | 12-04-2008 |
| 20090119352 | Method for Optimizing Generational Garbage Collection Through Object Life Heuristics - A method and apparatus to determine if an object should be instantiated in a nursery space or in a long lived space. Information as to real or estimated longevity of an object instantiated from a class is used to cause instantiation in the long lived space if the object instantiated is likely to be relatively long lived. Otherwise, default instantiation is made to a nursery space in which frequent garbage collection is performed to free up space by eliminating objects that are no longer used. | 05-07-2009 |
| 20090150344 | Collaborative Program Development Method and System - A method, apparatus and program product facilitate the collaborative development of an algorithm by, in part, displaying an algorithm associated with a performance attribute, and receiving user input relating to the algorithm from a plurality of networked users. The performance attribute of the algorithm may be automatically modified based on the user input. The modified performance attribute may be displayed to the plurality of networked users. A query may be received from a user interested in the algorithm. In response to the user query, the algorithm may be located from among a plurality of algorithms. For instance, the algorithm may be located from among the plurality of algorithms by matching the performance attribute to a criterion of the user query. Alternatively or additionally, the algorithm may be located by matching the performance attribute to a profile of the user submitting the user query. Also in response to the user query, a second algorithm and/or performance attribute related to the algorithm, or another, may be displayed. | 06-11-2009 |
| 20090150465 | Object Deallocation System and Method - 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. | 06-11-2009 |
| 20090150498 | Identifying a Plurality of Related Electronic Messages and Combining the Plurality of Related Messages Into a Composite View - A program product, an apparatus, and a method that identify a plurality of related electronic messages and combine the plurality of the related electronic messages into a composite view are provided. Also provided is a method that searches a first account of a first user to identify a plurality of related electronic messages stored in the first account and searches a second account of a second user to identify at least one other electronic message that is associated with the plurality. By doing so, a user may be provided with a more complete email chain, often leading to an increase in productivity, improved collaboration, and a reduction of duplicate data. | 06-11-2009 |
| 20090254923 | Mechanism that Provides More Efficient Event Handler Processing - Disclosed is an apparatus, method, service product, and program product which each provide an enhanced, registration-based event handler mechanism. Listener programs are located and compiled before notification is needed. When notification is ultimately required, the pre-located listeners can be called directly without incurring the performance expense associated with first locating and then calling each listener. | 10-08-2009 |
| 20090276783 | Expansion and Contraction of Logical Partitions on Virtualized Hardware - A method, apparatus, and program product manage a plurality of resources of at least one logically partitioned computing system of the type that includes a plurality of logical partitions managed by a partition manager with an application level administrative console resident in a logical partition of the computing system. Each logical partition is allocated at least a portion of the plurality of resources. A user request to adjust the allocation of at least a portion of the resources using the administrative console is received. The resources of the logically partitioned computing system to adjust in order to satisfy the user request are determined using the application level administrative console. The application level administrative console accesses the partition manager through a resource allocation interface to adjust the determined resources of the logically partitioned computing system in order to satisfy the user request. | 11-05-2009 |
| 20100083228 | Mapping a Class, Method, Package, and/or Pattern to a Component - 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. | 04-01-2010 |
| 20100169289 | Two Phase Commit With Grid Elements - A method, storage medium, and computer that, in an embodiment, receive a command that specifies a transaction identifier, keys, and partition identifiers. A primary partition is selected that executes on a first server. The first server comprises a first grid element that includes a first row that is identified by an initial key. An identification of the first grid element, the transaction identifier, an identifier of the primary partition, and the initial key are stored in a primary factory point at the first server. A secondary partition that executes on a second server is found. The second server comprises a second grid element that includes a second row that is identified by a second key. An identification of the second grid element, the transaction identifier, an identifier of the secondary partition, and the second key are stored in a secondary factory point at the second server. | 07-01-2010 |
| 20100191706 | Storing Information for Dynamically Enlisted Resources in a Transaction - A method, apparatus and program product dynamically enlist a plurality of resources to be committed by a transaction during execution of the transaction and store information about each enlisted resource in the plurality of resources with the transaction in a transaction log, including information about a state of each resource, to facilitate recovery of the transaction. Enlisting and storing may be performed during the execution of the transaction, and the resources to be committed by the transaction may be unknown prior to execution of the transaction. By doing so, a more complete record of all the resources that were enlisted during runtime may be maintained. | 07-29-2010 |
