International Business Machines Corporation

Stephen Joseph Kinder

Steven Jay Greenspan

Matthew J Sykes

Douglas Michael Zobre

Robert Vaughn Geiner

David Andrew Booz

Jeffrey Alan Frey

Geoffrey Martin Hambrick

Bernard R Pierce

Michael Gerard Mall

Timothy Marc Francis

James Irwin Knutson

Timothy D Kaczynski

Nested recovery scope management systems and methods for a multiple process computer system having a dynamic multiple address space server are disclosed. Stateless recovery agents are employed, under the control of a supervisory program called Recovery Director, during initialization or restart of servers to restore recoverable data in response to identified failures or other abnormal termination. The Director controls the recovery of protected resources in a systematic manner. The Director is initialized when a first address space of a first server is started. Then, as each instance of a recoverable component is initialized, the component registers with the Director by providing a reference to a stateless recovery agent that can later perform recovery functions for it if needed. As part of the registration, a token representing the current failure scope of the registration is generated and provided to the recoverable component by the Director.

Nested recovery scope management for stateless recovery agents

A method provides an annotated language extension for the class of an object, the extension identifying an internal state that may be exposed via simple accessor methods. The extension could apply to an entire object type, or to a specific state within the object. Annotations that can be added to the extension include @Accessable, @Gettable and @Settable. In one embodiment, a method selectively accesses one or more object states. The method includes generating an annotated extension identifying each internal object state to be exposed for access, adding a usage annotation to the extension that defines an accessor method associated with each identified state, and operating a virtual machine to call the accessor method associated with a particular identified state. The particular state may then be accessed, as defined by the called accessor method.

Method for accessing internal states of objects in object oriented programming

The present invention enables a component under test to bind to a single component, that is capable of simulating most depended upon services, including the details of their interface, whether or not they return explicit results or cause side effects, and regardless of the state of their implementation. This invention includes features that allow for dynamic reconfiguration to meet the needs of both manual and automated testing, including the ability to control normal and exceptional results, as well as features to support both unit and integration testing.

Method and apparatus for dynamically binding service component implementations for specific unit test cases

A histogram, or resource status history table, for multiple resources is created and maintained. A transaction or resource manager arranges and/or reorders various resources into a sequence based on the histogram such that read-only resources are prepared first and a sole non-read-only resource need not be prepared, but only committed. The transaction manager heuristically determines the order that resources are driven to achieve last-agent optimization. The histogram is kept related to context, based on runtime and applications context to ensure that usage patterns by context are optimized without the need for the installation to know any usage patterns.

Method, system, and storage medium for dynamically reordering resource participation in two-phase commit to heuristically optimize for last-agent optimization

Resources used by components are aggressively reclaimed, in order to enable those resources to be available to other components. To aggressively reclaim one or more resources of a component, the component is forced to transition from one state to a reclaim state, and at the reclaim state, the resources are reclaimed, if necessary.

Reclaiming resources in response to forced state transitions

An exemplary embodiment of the invention is a method for providing a path-sensitive branch registry for cyclic distributed transactions. This method requires that a superior node's transaction manager (TM) identify itself as the root followed by sending the syncpoint cue to at least one subordinate node. Before sending the syncpoint cues to the subordinate the superior links the inbound messages with its specific branch qualifier (BQUAL) as well as a global transaction identifier (GTRID). The TM of each subordinate node receives syncpoint cues and is responsible for knowing who its superior is. In addition, the TM is responsible for recognizing the flow of branch instructions and guarantee that it uses a network-wide unique value for the branch values it generates for a given global transaction. With the recognition of the flow from the superior node the subordinate TM updates the node registry as to the inbound and outbound flow of branch messages by its superior and its subordinates.

Method for creating path-sensitive branch registry for cyclic distributed transactions

The frequency at which a multisystem log stream is compressed by a system of a multisystem environment is adjusted in real-time. The rate at which the multisystem log stream is compressed by the system is ascertained. That rate is relative to how frequently the multisystem log stream is compressed by other systems of the multisystem environment. The frequency with which the system compresses the multisystem log stream is then adjusted in real-time. Thus, the frequency at which one system of the multisystem environment compresses the log stream is relative to the frequency at which other systems of the multisystem environment are compressing the log stream.

Pacing the frequency at which systems of a multisystem environment compress log streams

Method of pacing the frequency at which systems of a multisystem environment compress log streams

Program products for pacing the frequency at which systems of a multisystem environment compress log streams

Work units are identified, managed and reported on as a group or enclave. The dispatching priorities of the work units are separated from the address spaces executing the work units. Instead, the dispatching priorities are tied to the priority of the enclave allowing work units to be executed within an address space at a priority independent from the address space. Additionally, resources used by the work units are accumulated and allocated to the requestor of the work.

Growing community of inventors

Hyde Park, NY, United States of America

Stephen Joseph Kinder