International Business Machines Corporation

Lenovo (singapore) Pte. Ltd.

Peter Siddall

Paul Kettley

Stephen James Hobson

Paul Hopewell

Robert Daniel Millar

Stephen Richard Walker

Jose Emir Garza

Matthew W Leming

James H Warnes

David James Fisher

Richard M W Harran

Paul Stephen Dennis

Dermot Flaherty

Robert F Buxton

Anthony J Sharkey

Hazel Heather Fix

Arndt Douglas Eade

Jeffrey Mark Nick

Jonathan Lee Rumsey

Anthony John O'Dowd

Daniel Noel Millwood

Ian C Edwards

David Postlethwaite

John Edmund Ahern

Richard Michael Harran

Keith Andrews

Sharuff Morsa

A computer system with a first messaging application communicates a message to another computer system with a second messaging application via a coupling facility storage device. If the message does not exceed a predetermined threshold, the message is put onto the queue in the coupling facility. If the message does exceed a predetermined threshold, the message is put onto a log associated with the first messaging application and readable by the second messaging application. A pointer to the message is put onto the queue in the coupling facility. The pointer can be used to access the message in the log.

Handling large messages via pointer and log

Provided is a data storage system for a computer network adapted to store a message. The data storage system includes a data storage unit and a processing unit. The processing unit stores message data of the message across one or more data elements of a data list entry of an auxiliary list in the data storage unit. The processing unit further stores an indexing pointer of the message across one or more indexing elements of an indexing list entry of an indexing list in the data storage unit. The indexing pointer is adapted to point to the data list entry. The indexing list entry further includes an indexing control element containing control information associated with the indexing list entry. The data list entry further includes control information associated with the data list entry.

Storing messages of a message queue

A method for message handling between a message producer and a remote message consumer in a shared queue computing environment. The method includes, receiving from a message producer, at least one message by a first queue manager. A first queue manager writes both the message data associated with at least one message, to a shared data repository, and a pointer, associated with the message data to a coupling facility, using an uncommitted key. The second queue manager, upon an indication that an uncommitted key is written to the coupling facility, reads the message from the shared data repository based on the pointer, and stores the message in an internal memory storage buffer. The first queue manager then commits a batch of messages. Finally, the second queue manager merges the pointer and the message from the internal memory storage buffer, in response to a remote message consumer requesting the message.

Pre-staging messages at a remote location

An apparatus for controlling subscriptions comprising: a detector operable to detect to a subscription associated with a wildcard topic string; and an analyzer, responsive to the detection of the subscription associated with a wildcard topic string and a topic string of a topic node matching the wildcard topic string, for analyzing a first attribute of the topic node; and means for determining whether a subscriber associated with the subscription should receive a message associated with the topic string of the topic node.

Apparatus for controlling subscriptions

The present invention discloses a queue manager that includes a smart alias function. The smart alias function can associate a queue name with two or more queues. The queues associated with the queue name for a given operation can be dependent upon programmatically determinable conditions. For example, the queue name (Queue A) can cause a message to be put in a Queue Awhen smart aliased. The same queue name (Queue A) can cause a message to be retrieved from Queue Awhen smart aliased. Additional processing can be performed against messages placed in Queue Aand post processed messages can be placed in Queue AThe queue manager can be a component that receives digitally encoded messages, that stores the received digitally encoded messages, and that provides the digitally encoded messages to authorized requesting software applications. The queue manager and the smart alias function can be software/firmware.

Solution for modifying a queue manager to support smart aliasing which permits extensible software to execute against queued data without application modifications

The present invention relates to a data processing system and method as well as to a computer program product for realizing such a data processing system and method. Conventionally, access to system resources is controlled within, for example, MQSeries, via security settings or security definition contained within profiles that are used to initialize a data processing system. Typically, each computer program or user has associated access permissions which may, from time to time, be varied by a system administrator. It will be appreciated that to issue on a resource by resource or user by user basis individual changes to access permission would require a significant amount of work. Suitably, the present invention provides a system and method for implementing grouping of security access control for a number of resources or users. Therefore, a single security change request can be used to effect a change of access permissions associated with a number of separate or at least closely coupled resources.

Data processing system and method

Provided are methods, data processing systems, recovery components and computer programs for recovering from storage failures affecting data repositories. At least a part of the recovery processing is performed while the data repositories are able to receive new data and to allow retrieval of such new data. Although new data items may be received into the repository and retrieved therefrom during recovery processing, updates to the data repository which were performed before the failure and which are then restored to the repository by the recovery processing are restored within a recovery unit of work and are inaccessible to processes other than the recovery process until successful completion of the recovery unit of work. The recovery processing ensures that the recovered repository is consistent with the state of the repository at the time of the failure, but is available for addition and retrieval of new data items before completion of the recovery processing.

Recovery from failures within data processing systems

Provided are a computer program, method and system providing simplified administration of groups of computer programs. Command target qualifiers are defined which enable a command to be targeted at either an individual computer program or all members of a group of computer programs. Additionally, scope parameters are defined which enable a command to be targeted at specific computer system resources managed by the computer programs within the group. The computer system resources which are to be accessible to all members of a group have an associated scope parameter defining shared or group access and are held in shared storage, whereas computer system resources to be accessed by only one computer program in the group have a corresponding scope parameter and are held in the local storage of the individual computer program. The invention enables a reduction of the time taken to perform administration and control operations for the group and reduces the risk of inconsistent specification of commands that can arise when a system administrator is required to repeat entry of a command several times.

Administration of groups of computer programs, data processing systems, or system resources

Provided are a method, computer program product and system for providing indexed queue support for efficient retrieval of messages from a queue. An index key for expediting message retrieval is assigned to a message when the operation of placing the message on a queue is committed. The index key assigned at commit time comprises an attribute (such as a message ID or correlation ID) specified by the sending application program, which placed the message on the queue. This deferred assignment of an index key until commit time means that the index key can be used to search for messages having the particular attribute without any possibility of identifying messages for retrieval before the messages have been committed. This maintains transactional requirements of a transaction-oriented messaging system which requires a message to only be made available for retrieval by receiver application programs after the sender application's put operation has committed.

Implementing a message queuing interface (MQI) indexed queue support that adds a key to the index on put commit

The invention relates to the recovery of data in a database of database records, following a failure of a media containing said database. The data recovery uses a backup of the database and a log of log records detailing any changes in the database which are not captured in the backup. The log is replayed starting with the most recent log record. It is the determined for each successive log record, that relates to an operation on a database record, whether processing the log record will result in the most recent state of the corresponding database record, and if so, the log record is processed. Subsequently additional data is restored from the backup.

Data recovery system

A data processing arrangement () and method for fuzzy backup and restore of MQSeries shared queues held in coupling facility list structure (). Periodically backups are taken of the data held in the CF list structure by backing up messages in the sequence uncommitted puts (), committed puts (), uncommitted gets () and expired messages (), whereby all messages may be backed up in the backup means except for exceptions which are recorded in the record log. In the event of media failure of the coupling facility, data can be restored by restoring messages in the sequence restoring messages from the backup means (), replaying messages from the record log means () and determining final disposition of messages from replay of the record log means (). This provides the advantage of allowing the number of log records written to be reduced.

Data processing arrangement and method

A data processing system () and method for creating a fuzzy backup () only of objects older than a predetermined threshold, and restoring from the fuzzy backup and from a record log () replayed from a time equal to the predetermined threshold before the fuzzy backup start time. This provides advantages of reduced resource cost for the fuzzy backup and reduced restore time.

The invention relates to communicating message data between application programs, the message data relating to units of work performed by the application programs. A plurality of message queuing subsystems interface to the application programs and are coupled together through a coupling facility. The message data is communicated in shared queues between the message queuing subsystems by means of data structures contained in the coupling facility. The data structures include an administrative structure listing unit of work descriptors describing operations performed by the queuing subsystems on a shared queue. A connection failure between a queuing subsystem and the shared queue is notified to the remaining queuing subsystems connected to the shared queue. The remaining queuing subsystems interrogate the listed work descriptors so as to identify and to share between them the units of work active in the failed connection, and each of the remaining subsystems recovers its share of the units of work active in the failed connection.

Growing community of inventors

Romsey, United Kingdom

Peter Siddall