Abstract: Resource reservation request information originated by a client application during a first phase of a distributed multi-phase transaction is received at a processor. The resource reservation request information specifies a first resource the client application intends to access during a first subsequent phase of the distributed multi-phase transaction after the first phase of the distributed multi-phase transaction is completed. The requested first resource is reserved on behalf of the client application. A transaction weighted priority is assigned to the distributed multi-phase transaction of the client application based upon a stage of completion of the distributed multi-phase transaction.

Abstract: A method, system and computer program product for generating appropriately sized core files used in diagnosing application crashes. An instruction pointer corresponding to the instruction that led to the application crash is identified. Address ranges of the garbage collection module and the compiler module are obtained. A determination is made as to whether the address of the instruction pointer lies within any of these address ranges for each stack frame in a crash stack. If it does not, then read or write instructions executed prior to the instruction that led to the application crash are identified for each stack frame in the crash stack. If a value of a register involved in such read or write instructions is within the address range of the compiled code buffers and/or heap, then the compiled code buffers and/or heap need to be included in the core file; otherwise, they do not.

Abstract: Establishment of an exclusive lock on each of an outer database ownership table and an inner database ownership table is attempted. In response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table, a switch is made to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table. Release and re-acquisition of each of the pair of overlapping shared locks on the outer database ownership table and the inner database ownership table is alternated.

Abstract: A method for a messaging engine to control messaging within a virtual machine having a heap is disclosed. The messaging engine creates a list of destinations associated with a messaging engine and receives parameters associated with the heap. The messaging engine determines total heap usage and based on the parameters associated with the heap and the total heap usage, controls message production rates of producers associated with the destinations.

Abstract: Allocating space for storing heterogeneous messages in a message queue according to message classification. The classification may comprise message type, application type, network type, and so forth. Messages of multiple classification values may be queued in a single queue, referred to as a primary queue. When the allocated portion of the primary queue is reached for a particular message classification, then subsequent messages having that classification are sent to a secondary queue for queueing. The secondary queue also allocates space according to message classification. When space for a particular message classification becomes available in the primary queue, one or more messages having that classification may be moved from the secondary queue to the primary queue.

Abstract: A method of controlling the retention of publications in a publish/subscribe system, the method comprising receiving, at a message broker, a first publication from a publisher on a topic; receiving, at the message broker, a second publication from the publisher on the topic; identifying, at the message broker, whether the first publication should be overwritten with the second publication and, if not, retaining at least payload data from both the first and second publications on the topic; and storing, for the second publication, if retained, data indicating when the second publication was published to the broker. Other methods, apparatus, and computer readable media are also provided.

Abstract: A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.

Abstract: Message integrity in a messaging oriented middleware system is preserved by determining a message producer's level of message integrity by examination of connection details between the message producer and a messaging engine. The message producer's level of integrity is stored in a memory of the messaging engine. The message is then stored in the designated destination using the message producer's level of integrity. The message is sent from the designated destination to a consumer when it is determined that the consumer conforms to the integrity levels.

Abstract: A method, system and computer program product for generating appropriately sized core files used in diagnosing application crashes. An instruction pointer corresponding to the instruction that led to the application crash is identified. Address ranges of the garbage collection module and the compiler module are obtained. A determination is made as to whether the address of the instruction pointer lies within any of these address ranges for each stack frame in a crash stack. If it does not, then read or write instructions executed prior to the instruction that led to the application crash are identified for each stack frame in the crash stack. If a value of a register involved in such read or write instructions is within the address range of the compiled code buffers and/or heap, then the compiled code buffers and/or heap need to be included in the core file; otherwise, they do not.

Abstract: A method of controlling the retention of publications in a publish/subscribe system, the method comprising receiving, at a message broker, a first publication from a publisher on a topic; receiving, at the message broker, a second publication from the publisher on the topic; identifying, at the message broker, whether the first publication should be overwritten with the second publication and, if not, retaining at least payload data from both the first and second publications on the topic; and storing, for the second publication, if retained, data indicating when the second publication was published to the broker. Other methods, apparatus, and computer readable media are also provided.

Abstract: A method of controlling the retention of publications in a publish/subscribe system, the method comprising receiving, at a message broker, a first publication from a publisher on a topic; receiving, at the message broker, a second publication from the publisher on the topic; identifying, at the message broker, whether the first publication should be overwritten with the second publication and, if not, retaining at least payload data from both the first and second publications on the topic; and storing, for the second publication, if retained, data indicating when the second publication was published to the broker. Other methods, apparatus, and computer readable media are also provided.

Abstract: Allocating space for storing heterogeneous messages in a message queue according to message classification. The classification may comprise message type, application type, network type, and so forth. Messages of multiple classification values may be queued in a single queue, referred to as a primary queue. When the allocated portion of the primary queue is reached for a particular message classification, then subsequent messages having that classification are sent to a secondary queue for queuing. The secondary queue also allocates space according to message classification. When space for a particular message classification becomes available in the primary queue, one or more messages having that classification may be moved from the secondary queue to the primary queue.

Abstract: A server computing device receives an update message from a client computing device at which a read-ahead buffer has been partitioned into partitions corresponding to selectors. The selectors correspond to different types of the messages of interest to be consumed by a given consuming application running on the client computing device. The update message specifies a given partition of the read-ahead buffer that requires filling with new messages matching the selector of the given partition. The server computing device sends the new messages requested in the update message to the client computing device, to fill the given partition of the read-ahead buffer at the client computing device.

Abstract: A method, system, and computer usable program product for pre and post purchase identification of counterfeit products in a supply chain are provided in the illustrative embodiments. A customer reference number (CRN) associated with a unit of product is identified. The unit of product has associated therewith a unique set of identifiers including the CRN, a customer acknowledgment number (CAN), and a merchant acknowledgment number (MAN). The CRN is sent to a second application and a message is received from the second application in response to sending the CRN. If the message includes a second CAN that is not the same as the CAN associated with the unit, the unit is determined to be a counterfeit product.

Abstract: A method, system, and computer usable program product for improved manufacturing and distribution to avoid counterfeit products in a supply chain are provided in the illustrative embodiments. For manufacturing to avoid a counterfeit product, a product to be manufactured is selected. Production volume information is determined, the production volume information including a number of units of the product to be produced. An identifier of a manufacturer of the product, an identifier of the product, and the production volume information are sent and several sets of identifiers are received. Each set of identifiers include identifiers corresponding to a customer reference number (CRN), a customer acknowledgment number (CAN), and a merchant acknowledgment number (MAN). One set of identifiers is uniquely associated with one unit of the product being produced. A unit of the product is manufactured such that the unit includes a corresponding set of identifiers.

Abstract: A method, system, and computer usable program product for mitigating distribution or consumption of counterfeit products in a supply chain are provided in the illustrative embodiments. A first set of identifiers is generated to associate with a product to be manufactured. The first set of identifiers includes identifiers corresponding to a customer reference number (CRN), a customer acknowledgment number (CAN), and a merchant acknowledgment number (MAN). The first set of identifiers is associated with the product and a status indicator. The status indicator is set to a first value representative of the product being an original product and the product being available for sale. The first set of identifiers is transmitted to another second application.

Abstract: There is provided a method for recalling a message. The method comprises receiving a message from a publisher, sending the message to a durable subscriber for queuing pending consumption by a subscriber. When a message recall request identifying the message is received, the unconsumed message is deleted from the durable subscriber.

Abstract: A method of controlling the retention of publications in a publish/subscribe system, the method comprising receiving, at a message broker, a first publication from a publisher on a topic; receiving, at the message broker, a second publication from the publisher on the topic; identifying, at the message broker, whether the first publication should be overwritten with the second publication and, if not, retaining at least payload data from both the first and second publications on the topic; and storing, for the second publication, if retained, data indicating when the second publication was published to the broker. Other methods, apparatus, and computer readable media are also provided.

Abstract: A server computing device receives an update message from a client computing device at which a read-ahead buffer has been partitioned into partitions corresponding to selectors. The selectors correspond to different types of the messages of interest to be consumed by a given consuming application running on the client computing device. The update message specifies a given partition of the read-ahead buffer that requires filling with new messages matching the selector of the given partition. The server computing device sends the new messages requested in the update message to the client computing device, to fill the given partition of the read-ahead buffer at the client computing device.

Abstract: A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.