Abstract: A method is provided for using a temporary object handle. The method performed at a resource manager includes: receiving an open temporary handle request from an application for a resource object, wherein a temporary handle can by asynchronously invalidated by the resource manager at any time; and creating a handle control block at the resource manager for the object, including an indication that the handle is a temporary handle. The method then includes: responsive to receiving a request from an application to use a handle, which has been invalidated by the resource manager, sending a response to the application that the handle is invalidated.

Abstract: A system is provided for using a temporary object handle. The system includes a resource manager: receiving an open temporary handle request from an application for a resource object, where a temporary handle can by asynchronously invalidated by the resource manager at any time; and creating a handle control block at the resource manager for the object, including an indication that the handle is a temporary handle. The system then includes the resource manager: responsive to receiving a request from an application to use a handle, which has been invalidated by the resource manager, sending a response to the application that the handle is invalidated.

Abstract: A method is provided for using a temporary object handle. The method performed at a resource manager includes: receiving an open temporary handle request from an application for a resource object, wherein a temporary handle can by asynchronously invalidated by the resource manager at any time; and creating a handle control block at the resource manager for the object, including an indication that the handle is a temporary handle. The method then includes: responsive to receiving a request from an application to use a handle, which has been invalidated by the resource manager, sending a response to the application that the handle is invalidated.

Abstract: Generating exception delay messages when messages communicated between asynchronous messaging applications are delayed and for forcibly retaining the original message. Specifically, the invention provides methods and systems for generating an exception delay message after a time threshold has expired without deleting the original message. The exception delay message may be sent once when the time threshold first expires or each time that the time threshold expires.

Abstract: A method and system are provided for using a temporary object handle. A method at a resource manager includes: receiving an open temporary handle request from an application for a resource object, wherein a temporary handle can by asynchronously invalidated by the resource manager at any time; and creating a handle control block at the resource manager for the object, including an indication that the handle is a temporary handle. The method then includes: responsive to receiving a request from an application to use a handle, which has been invalidated by the resource manager, sending a response to the application that the handle is invalidated.

Abstract: Generating exception delay messages when messages communicated between asynchronous messaging applications are delayed and for forcibly retaining the original message. Specifically, the invention provides methods and systems for generating an exception delay message after a time threshold has expired without deleting the original message. The exception delay message may be sent once when the time threshold first expires or each time that the time threshold expires.

Abstract: A method and system of inherited transactions in an asynchronous messaging are provided. A producer requests a message put operation in a transaction. A consumer carries out a get operation with the option to inherit the transaction of the put operation. In an inherited transaction, the consumer's transaction will not commit unit the transaction it has inherited from commits. Work performed in the producer's transaction is visible to the consumer, but work performed in the consumer's transaction is not visible to the producer preserving asynchronous messaging semantics. A transaction hierarchy results and only the net effect of transaction hierarchy is hardened to non-volatile storage.

Abstract: A system and method for messaging in which, when a connection to a queue manager (220) is established, the queue manager allocates a Connection Identifier from the same name space (300) as Message Identifiers and returns this information (400) to the user. The user can then use this Connection Identifier as a Correlation Identifier, safe in the knowledge that it will not clash with any system generated Message Identifier or Correlation Identifier. A secondary benefit to this allocation scheme is that if a shared reply queue suffers from a build-up of messages then the Correlation Identifier in those messages can be used to identify the application expected to receive those messages.

Abstract: A method and a system of deferred synchronisation of data resulting from operations by applications (506) on a resource manager (501). The method includes receiving a request for an operation (511), identifying the operation as part of a synchronised transaction that has not yet started, completing the operation, subsequently starting the synchronised transaction (517) of which the completed operation is to be a part, and associating (519) the completed operation with the synchronised transaction (517). For example, the system may be an asynchronous messaging system with a plurality of distributed applications (506) getting and putting messages and the resource manager (501) is a queue manager. The operation (511) may be a get operation and the synchronised transaction (517) may be a unit of work.

Abstract: A method and system for combined commit transaction request and subsequent operation request for committing the operations of a synchronized transaction by one or more applications (301, 4001, 501) on a resource manager (302, 402, 502). The method comprises: receiving a combined request (310, 410, 510) for an operation and a request to commit any outstanding synchronized transaction; committing the outstanding transaction (311, 414, 512); and processing (313, 413, 517) the requested operation outside the outstanding transaction. For example, in an asynchronous messaging process, the combined request specifies an option in a get operation request to commit any outstanding units of work prior to carrying out the get operation.

Abstract: Documents are published in a publish subscribe data processing system. A first document to be published may have an associated topic. The first document is retained as a retained document. A second document to be published is retained as the retained document in response to receiving the second document before a predetermined time interval has passed. A copy of the second document is sent to a subscriber of the topic. A copy of the retained document is sent to the subscriber of the topic in response to a determination that the predetermined time interval has passed.

Abstract: A method for deleting expired items in a queue data structure, the queue data structure comprising a sequential list of ordered data items including a queue head at one end of the sequential list and a queue tail at another end of the sequential list, wherein each data item includes an expiry time, the method comprising: generating a maximum interval value corresponding to a maximum time interval between an expiry time of a first item in the queue and an expiry time of a second item in the queue, wherein the second item is nearer the queue head than the first item; sequentially scanning the list of ordered items from the queue head; responsive to a determination that a scanned item is expired, deleting the scanned item; responsive to a determination that a scanned item will not expire for a time interval greater than the maximum interval value, terminating scanning of the list of ordered items.

Abstract: A method for identifying a complete response to a first request from a requesting entity, the method comprising the steps of: the requesting entity sending the first request to a first receiving entity; the first receiving entity sending a second request to a second receiving entity, the second request including a unique request identifier; the first receiving entity sending the unique request identifier to the requesting entity; and the second receiving entity sending a response to the requesting entity, the response including the unique request identifier.

Abstract: An apparatus includes a browse mechanism to scan a list of data items. A marker is applied to the data items once they have been scanned by the browse mechanism. The marker provides an indication that a respective data item has been scanned by a given browse entity. The browse mechanism subsequently scans only unmarked data items in the list of data items.

Abstract: 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.

Abstract: In a publish/subscribe data processing broker network having a plurality of broker data processing apparatuses each of which has an input for receiving published messages directly from a publisher application and/or receiving subscription data from a subscriber application, a first broker data processing apparatus has: a unit for receiving a data message published on a first topic by a first publisher application; and a unit for forwarding the received published data message to a subscriber application which has requested, by entering subscription data, to receive a message on the first topic; wherein the first broker data processing apparatus sends a declaration to at least one other broker data processing apparatus of said plurality of broker data processing apparatuses declaring that the first broker data processing apparatus is the only broker data processing apparatus that is directly communicating with a publisher application that is publishing on the first topic.

Abstract: Access to groups of related items which are accessible by multiple processes in a computer system is controlled, in response to determining that an individually accessed data item is part of a group, by marking the whole group as locked and returning an unlocking key to the process accessing the original data item. Further access to any items of the group by a process is prevented except on provision of the key. The invention is particularly applicable to messages in a message queuing system which are logically grouped and yet may be individually destructively retrieved.

Abstract: A publishing data processing method for use in a publish/subscribe data processing broker network having a plurality of broker data processing apparatuses each of which has an input for receiving published messages directly from a publisher application and/or receiving subscription data directly from a subscriber application, the method includes steps of: Publishing a message on a topic to a first broker data processing apparatus; and providing an indication as to whether the published data message is to be considered as local to the first broker apparatus. Also included are an analogous subscribing data processing method, an analogous broker data processing method, apparatuses and computer program products.

Abstract: In a publish/subscribe data processing broker network having a plurality of broker data processing apparatuses each of which has an input for receiving published messages directly from a publisher application and/or receiving subscription data from a subscriber application, a first broker apparatus has: a software unit for receiving via said input subscription data from a subscriber application; a software unit for providing an acknowledgement to said subscriber application to acknowledge that the subscription data has been received; a software unit for propagating said subscription data to a group of other broker apparatuses; a software unit for determining whether said means for propagating has propagated said subscription data to the group of other broker apparatuses; and a software unit for receiving via said input an indication from said subscriber application that said acknowledgement should not be sent to the subscriber application until the means for determining has determined that said means for prop

Abstract: A method of converting a plurality of strings stored in an input buffer to a plurality of evenly spaced strings in an output buffer involves first passing over the input buffer and, for each string, placing the string in the output buffer at a next available address. If the string length is longer than a maximum string length, the maximum string length is set to the string length and the string is set as the last incorrectly placed string in the output buffer. The next available address in the output buffer is incremented by the maximum string length plus the product of any positive difference between the current string length and previous maximum string length and the number of strings already placed in the output buffer. A second pass over said output buffer from the last incorrectly placed string in a direction opposite the first passing step moves each string within the output buffer to an address being a multiple of the maximum string length from the start of the output buffer.