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

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

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

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

Abstract: For processing messages in a messaging system comprising a source and a destination queue manager, an uncommitted message is received from an application at the source queue manager. This is transmitted to the destination queue manager and received thereat. When it is determined that the message is uncommitted, it is stored in memory, rather than placing the message on a receive queue for processing by another application. If it is determined that the uncommitted message has been committed by the application which originated the uncommitted message, then it is placed on the receive queue.

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

Abstract: A method, apparatus and computer program are disclosed for refusing to process messages from a sender at a queue manager associated with a receiver when the receiver is inactive. It is identified whether a first destination has been selected. This first destination provides an indication of whether the receiver is active. If a first destination has been selected, it is determined using this first destination whether the receiver is active. If the receiver is inactive, the queue manager refuses to process messages intended for the receipt by the receiver.

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

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

Abstract: Message content associated with at least one message received by a message processing server is stored in association with the message processing server. The message content within an incoming message is compared with the stored message content. A determination is made as to whether the stored message content is duplicated by the message content associated with the incoming message. A duplicate message content management action is performed based upon the determination as to whether the stored message content is duplicated by the message content associated with the incoming message. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

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

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

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

Abstract: A data processing method for optimizing one or more parameters of a message handling system comprises defining a test workload comprising a plurality of messages, simulating the normal operation of the message handling system, processing at least a portion of the test workload, changing one or more parameters of the message handling system, monitoring the performance of the message handling system, and generating an optimization of at least one parameter based upon the performance of the message handling system.

Abstract: A method, apparatus and computer program are disclosed for refusing to process messages from a sender at a queue manager associated with a receiver when the receiver is inactive. It is identified whether a first destination has been selected. This first destination provides an indication of whether the receiver is active. If a first destination has been selected, it is determined using this first destination whether the receiver is active. If the receiver is inactive, the queue manager refuses to process messages intended for the receipt by the receiver.

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

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

Abstract: Message content associated with at least one message received by a message processing server is stored in association with the message processing server. The message content within an incoming message is compared with the stored message content. A determination is made as to whether the stored message content is duplicated by the message content associated with the incoming message. A duplicate message content management action is performed based upon the determination as to whether the stored message content is duplicated by the message content associated with the incoming message. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: State information in a publish and subscribe system is retained. A state publication is received from a publisher for a topic with one or more delta publications. The state publication and the one or more delta publications are used to keep track of a current state associated with the topic. It is determined that a subscriber has connected to a topic and information pertaining to the current state is sent to the subscriber. This equates to either a list comprising the state publication and subsequent delta publications or a single publication. Such a single publication is maintained by the system and comprises a state publication updated by one or more subsequent delta publications.

Abstract: This system detects and corrects looping problems in a publish-subscribe messaging network. This system requires a token which uniquely identifies a node in this network or universally unique in this messaging network. This system maintains a list of Universally Unique Identifiers (UUID) as a metadata attached to each publish-subscribe message (“publication”). As a node forwards a publication to another node, it is required to append its own UUID to this list or discard the message if its UUID already is in the attached list. Several nodes could form a broker cooperative aggregate node and have a unique identifier for all the nodes in the cooperative if they have an internal mechanism for preventing publication looping.