International Business Machines Corporation

Richard M W Harran

Matthew W Leming

Peter Siddall

Paul Stephen Dennis

Anthony J Sharkey

Andrew Ian Hickson

Pete Siddall

Robert F Buxton

Colin C Paice

Ian W Parkson

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 computer system defines a list structure on the shared medium wherein the list structure has multiple lists; and provides a list which is allocated to a single queue manager in which message entries are located which belong to multiple shared temporary dynamic queues (STDQs) created by the single queue manager, wherein the message entries are located by reference to a key which determines a message entry's position in the list, the list including: a list header which can be partitioned for multiple current STDQs by assignment of key ranges to message entries belonging each current STDQ; and a list control entry which holds information about the assignment of key ranges to the multiple current STDQs and shares the information with other queue managers using the STDQs, wherein the list control entry is updated by the single queue manager when an STDQ is created or deleted.

Implementing temporary message queues using a shared medium

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 browses a list of data items. The apparatus includes a plurality of browse mechanisms each operable to scan concurrently through a list of data items and a plurality of independent groups each comprising two or more of the plurality of browse mechanisms. The browse mechanisms in a group cooperate together to browse the list of data items such that a data item is seen by only one member of the group.

Growing community of inventors

Southampton, United Kingdom

Richard M W Harran