International Business Machines Corporation

Steven Powell

Jose Emir Garza

Stephen James Hobson

Ian J Mitchell

John Brian Pickering

Timothy Vincent Pickrell

John Steven Dodson

Jeffrey A Stuecheli

Benjiman L Goodman

Hillery C Hunter

Thomas James Freund

Glyn Normington

Martin Mulholland

Anthony John O'Dowd

Martin R Naish

Andrew Simon Clement

Michael J A Johnson

Ann Eleanor Dalton

Michael Johnson

Barry Dickinson

R Anthony Storey

Stephen B Toledo-Brown

David J Gorman

Jonathan Peter Hoare Lawrence

Jerzy Tadeusz Czaykowski

Stephen Benjamin Toledo-Brown

David John Gorman

Systems methods and computer programs are disclosed that enable generating transaction messages. In one embodiment, the method comprises: generating a transaction message using a first computing device, the transaction message comprising: compensation information comprising instructions indicating a transaction to be executed in order to undo a previously executed transaction; and a transaction identification that identifies an executing program within the first computing device to execute the transaction; and sending the transaction message over an input/output device connected to the first computing device for processing on a second computing device.

Generating transaction message

A method for providing atomicity for a unit of work involving a plurality of participants, the method comprising the steps of: sending a prepare request to at least one participant, wherein the request comprises data required for recovery purposes of the unit of work; and on recovery of the unit of work, recovering the unit of work comprising: obtaining the data from the at least one participant; and using the obtained data to recover and preserve the atomicity of the unit of work.

Providing atomicity for a unit of work

A method for resolving a unit of work involving a plurality of participants, the method comprising the steps of: generating logic comprising an identifier generator; aggregating the logic with an owning application of a unit of work; and in response to the owning application initiating the unit of work, generating, by the identifier generator, an identifier associated with the unit of work.

System and method for resolving a unit of work

A method for resolving a unit of work involving a plurality of participants, for use in a publish/subscribe system having a plurality of participants that subscribe to a first topic and at least one component having access to an outcome associated with the unit of work. The component publishes, to the first topic, a first message comprising a first outcome associated with the unit of work. If there is a failure associated with a first participant, a second participant use the published outcome to recover the unit of work.

Resolving a unit of work

A method for performing refresh operations is disclosed. In response to a completion of a memory operation, a determination is made whether or not a refresh backlog count is greater than a first predetermined value. In a determination that the refresh backlog count is greater than the first predetermined value, a refresh operation is performed as soon as possible. In a determination that the refresh backlog count is not greater than the first predetermined value, a refresh operation is performed after a delay of an idle count value.

Method and apparatus for performing refresh operations in high-density memories

A system, method, apparatus, and computer program product uses a plurality of message transmitters to achieve high availability message transmission. The plurality of message transmitters are each operable to transmit a message to a subscriber. In accordance with a determination, for example, of the value of the connections, the message is copied and transmitted to the plurality of the message transmitters so that at least one of the plurality of message transmitters transmits the copy to the subscriber. The at least one message transmitter may be selected by analyzing the message and determining an associated rule based on characteristics of the message.

High availability message transmission

Responsive to a client application initiating a synchronous communication with a server application by sending a request via an asynchronous communication manager, one or more checks are performed to identify a cause of any failure to provide a response to the client application satisfying synchronous communication criteria. The results of one or more checks are used to determine whether to back out any data updates performed by/on behalf of the server application in response to the request.

Method, apparatus and computer program for facilitating communication between a client application and a server application

Provided are methods, apparatus and computer programs for monitoring operational data relating to a sequence of data processing operations in a network of data processing units. In response to specified boundaries for data gathering, operational data is selectively gathered into discrete data partitions for a desired time period, a desired set of processing nodes, and/or a desired set of process executions. A set of event listeners invoke operations of a data gatherer in response to events within a processing sequence and the data gatherer allocates operational data to different ones of a set of discrete logical data containers in response to notifications from the event listeners. The data collection is responsive to system events such as a collection interval expiry to end data collection for a first partition and start data collection for a second partition.

Monitoring operational data in data processing systems

The present invention provides a method, system, computer program product and service, by which a unit of work manager can reliably start a follow-on unit of work after a first unit of work, in the event the first unit of work backs out without requiring to interlock the execution of the first unit of work and follow on unit of work. If the first unit of work completes before the follow-on is started information written to non-volatile memory, written as part of the first unit of work, is used on recovery to start is follow-on unit of work if no other information exists in the volatile storage which indicates the follow-on unit of work has started.

Invocation of a follow on unit of work

In a workload managed system comprising a plurality of server processes each capable of supporting a given program entity, such as an Enterprise JavaBeans&#x2122; specified stateful session bean, a stateful session bean instance is passivated, by writing it to a bean store, on completion of a unit of work. On next use the session bean is reactivated, by reading it from the bean store, in any one of the plurality of servers thereby allowing workload management for stateful session beans. A routing table is maintained, in non-volatile mass storage, that contains location information for units of work and stateful session bean instances, used to maintain unit of work-server affinity for the lifetime of the unit of work Stateful session beans instances are associated with ID keys that include a flag that is used to indicate whether or not the routing table contains location information for the bean instance.

Workload management of stateful program entities

An application server system has a constructed environment for executing application programs where the system has a plurality of processors, for receiving data from client requests and then modifying the constructed execution environment accordingly and for receiving and returning server data, and an interface for each of the processors, for receiving client request data and server data and returning server data, via the interface to/from its corresponding processor for modification of the execution environment and determination of server data to be returned. Each processor includes a receiving unit for calls containing client request data, a unit for processing the client request data and modifying the execution environment, and a unit for determining that another processor must be invoked, locating the other processor and invoking the other processor using the interface, and passing server data and client request data corresponding to the other processor.

Dynamic construction of complex execution environments

A transaction processing method, system and computer program product for processing applications comprising multiple component transactions. A transaction failure of a component transaction causes a reliable admission of failure by means of a failure indicator to be made available to one or more further transactions. The failure indicator is stored in recoverable storage, so that its effect can survive system failure and recovery.

Transaction processing system, method and computer program product

A data management system and method enables the storage of long records in a set of keyed physical records of restricted length while minimising movement of data. The logical record to be stored is logically divided into a number of physical record portions to each of which is prepended a key with a unique sequence number. By starting from one end of the record with the key of highest sequence number and copying the physical record consisting of key plus data into the data set, successive physical records can be assembled in situ by overwriting the previous record's data portion with the current record's key. This ensures that the split logical record data need only be moved once as it is transferred to non-volatile storage as physical records of the data set. The original logical record can be reassembled by reversing the above procedure. Thus, the last written (lowest sequence number) physical record is written into main memory first and subsequent physical records are written into main memory so that their data portions overwrite the previously written record's key.

Growing community of inventors

Winchester, United Kingdom

Steven Powell