International Business Machines Corporation

George S Denny

Judy Y Tse

Bruce E Naylor

Richard G Hannan

Betty J Patterson

Sandra L Stoob

Janna L Mansker

Anu V Vakkalagadda

Jim W Bahls

Gerald Dean Hughes

Michael Bruce Kennedy

Khiet Quang Nguyen

Anuradha V Vakkalagadda

Karen D Paffendorf

James W Bahls

Mark Neal Ziebarth

Robert Shiwen Lai

Hoang Minh Nguyen

Sherry H Li

Joseph F Murphy

An UOWE is created to represent a message which is put out to the coupling facility. If it is a committed message and the PUT failed for some reason, the UOWE is flagged for &ldquo;retry&rdquo;. These retry UOWEs will accumulate over time. The retry logic analyzes each &ldquo;retry&rdquo; UOWE, extracts the log token from this UOWE, uses this log token to read a specific log record from the IMS log data set and attempts to put the committed message to the central facility again.

UOWE's retry process in shared queues environment

During phase one of each protected conversation transaction, one or more messages are inserted. These messages are logged for recoverability. IMS system could crash before phase two of commit. When IMS restarted and eventually reached phase 2, it could vote to abort or commit the conversation. During IMS restart, the retry logic is used to put all protected conversation messages out to central facility with a specification that the first message segment be put on the staging queue using the recovery token as the queue name. If it is an abort request, all messages under the same commit scope identified by the recovery token, will be deleted. If it is a commit request, the first segment of all messages under the same commit scope will be moved to its appropriate ready queue with its actual queue name.

Handling protected conversation messages across IMS restart in shared queues environment

A shared queue is provided to allow any of a plurality of systems to process messages received by clients of a data processing environment. A received message is enqueued onto the shared queue. Any of the plurality of systems having available processing capacity can retrieve the message from the shared queue and process the message. A response to the message, where appropriate, is enqueued onto the shared queue for delivery back to the client. A unique list structure is provided to implement the queue. The list structure is comprised of a plurality of sublists, or queue types. Each queue type is divided into a plurality of list headers. List entries, containing data from the received messages, are chained off of the list headers. A common queue server is used to interface to the queue and to store messages thereon. The common queue server stores message data in storage buffers, and then transfers this data to the list entries. Thus, common queue server coordinates the enqueuing of data onto the shared queue.

Computer program product for a shared queue structure for data integrity

Shared queue structure for data integrity

A computer program product comprising a computer useable medium having computer program logic recorded on it for enabling a processor in a computer system to interact with a shared storage medium comprising a ready queue is described and a staging queue. The computer program logic enables the processor to determine whether a data object is larger than available storage capacity of a working storage associated with an application. A public key is associated with the data object and is available to all applications. If it is determined that the data object is larger than available storage capacity of the working storage, then the computer program product enables the processor to generate a private key for the data object, enables the processor to divide the data object into N segments, enables the processor to cause segments 2 through N of the data object to be stored in the staging queue via the working storage (the private key is also stored with each of the segments 2 through N in the staging queue), and enables the processor to cause segment 1 of the data object, the public key, and the private key to be stored in the ready queue. The private key becomes available to all applications once stored in the ready queue.

Computer program product for queuing and retrieving data objects to and

A system and method for interacting with a shared storage medium comprising a ready queue and a staging queue is described. To store a data object, whether the data object is larger than available storage capacity of a working storage associated with an application is first determined. If the data object is larger than available storage capacity of the working storage, then a private key for the data object is generated. The application then divides the data object into N segments, and causes segments 2 through N to be stored in the staging queue via the working storage. The private key is stored with each of segments 2 through N in the staging queue. Then, the application causes segment 1 of the data object, the public key, and the private key to be stored in the ready queue. To retrieve a data object, an application causes a record having a public key stored therein to be retrieved from the ready queue. Stored in the record are at least a portion of a data object and a private key. The application determines whether any segments of the data object are stored on the staging queue. If one or more segments of the data object are stored on the staging queue, then the application causes any records having the private key stored within them to be retrieved from the staging queue in the order in which the records were stored on the staging queue.

System and method for queuing an retrieving data objects to and from a

Described herein is a computer program product comprising a computer useable medium having computer program logic recorded thereon for enabling a processor in a computer system to manage a plurality of data structures stored in a computer storage medium. The computer storage medium includes a primary storage medium and an overflow storage medium. The computer program logic enables the processor to receive a request to store a data object in a target data structure, and enables the processor to determine whether an overflow mode condition currently exists. If it is determined that an overflow mode condition does not currently exist, then the computer program product enables the processor to determine whether a combined size of all data structures stored in the primary storage medium plus a size of the data object is greater than a predetermined threshold. If it is determined that a combined size of all data structures stored in the primary storage medium plus a size of the data object is greater than a predetermined threshold, then the computer program product enables the processor to enter an overflow mode such that an overflow mode condition exists. Once in the overflow mode, the computer program product enables the processor to select one or more data structures currently stored in the primary storage medium, and enables the processor to move the selected data structures from the primary storage medium to the overflow storage medium.

Computer program product for overflow queue processing

A communication system includes a network of transaction management systems having the same or different operating system software versions. Each transaction management system includes an associated input device for generating a transaction request or message switch. The transaction requests and message switches generated by a particular input device can be executed by the transaction management system associated with the device, and alternatively by remote transaction management systems in the network. To provide for remote execution of transaction requests and message switches, the system includes means for generating transaction request messages and message switch messages that have prefixes which can be dynamically extended as required for use by the appropriate remote transaction management system, without requiring upgrading the software of the remote system.

System and method for generating messages for use in transaction networks

Growing community of inventors

San Jose, CA, United States of America

George S Denny