PROACTIVE CHANNEL AGENT
First Claim
1. A computer-implemented method for a proactive channel agent structure, comprising executing on a computer processor the steps of:
- sending individually, to a target queue of a receiving node of a cluster plurality of server nodes, messages of a first batch sequence plurality of messages, each with different sequence numbers indicative of their relative positions within the first batch sequence, wherein each of the first batch sequence plurality of messages is associated with a first logic unit of work identifier;
updating a message counter value in response to each receipt by the receiving node of one of the first batch sequence plurality of messages sent to the target queue;
in response to determining that the updated message counter value meets a threshold limit, generating a force commit packet comprising the sequence number of a last one of the batch messages sent to the target queue; and
in response to determining that the sequence number of the generated force commit packet data is not a last position number within the first batch sequence, associating a second logic unit of work identifier with a subset sequence plurality of the first batch messages that comprises a plurality of the batch messages having different sequence numbers spanning from a first of the sequence numbers to the sequence number of the generated force commit packet data, and committing the subset sequence plurality of messages to the target queue of the receiving node, wherein the second logic unit of work identifier is different from the first logic unit of work identifier.
1 Assignment
0 Petitions
Accused Products
Abstract
Automated devices send messages of a first batch sequence individually to a target queue of a receiving node of a cluster of server nodes, the messages having a different sequence number indicative of their relative positions within the batch sequence, and each is associated with a first logic unit of work identifier. In response to determining that a message counter meets a threshold, a force commit packet is generated to include the sequence number of the last batch message sent to the target queue. If the force commit packet sequence number is not the last position number within the batch sequence, a second logic unit of work identifier is associated with a subset sequence of the batch of messages having sequence numbers spanning from the first number to the force commit packet sequence number, and the subset sequence messages are committed to the receiving node target queue.
-
Citations
20 Claims
-
1. A computer-implemented method for a proactive channel agent structure, comprising executing on a computer processor the steps of:
-
sending individually, to a target queue of a receiving node of a cluster plurality of server nodes, messages of a first batch sequence plurality of messages, each with different sequence numbers indicative of their relative positions within the first batch sequence, wherein each of the first batch sequence plurality of messages is associated with a first logic unit of work identifier; updating a message counter value in response to each receipt by the receiving node of one of the first batch sequence plurality of messages sent to the target queue; in response to determining that the updated message counter value meets a threshold limit, generating a force commit packet comprising the sequence number of a last one of the batch messages sent to the target queue; and in response to determining that the sequence number of the generated force commit packet data is not a last position number within the first batch sequence, associating a second logic unit of work identifier with a subset sequence plurality of the first batch messages that comprises a plurality of the batch messages having different sequence numbers spanning from a first of the sequence numbers to the sequence number of the generated force commit packet data, and committing the subset sequence plurality of messages to the target queue of the receiving node, wherein the second logic unit of work identifier is different from the first logic unit of work identifier. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system, comprising:
-
a processor; a computer readable memory in circuit communication with the processor; and a computer readable storage medium in circuit communication with the processor; wherein the processor executes program instructions stored on the computer-readable storage medium via the computer readable memory and thereby; sends individually, to a target queue of a receiving node of a cluster plurality of server nodes, messages of a first batch sequence plurality of messages, each with different sequence numbers indicative of their relative positions within the first batch sequence, wherein each of the first batch sequence plurality of messages is associated with a first logic unit of work identifier; updates a message counter value in response to each receipt by the receiving node of one of the first batch sequence plurality of messages sent to the target queue; in response to determining that the updated message counter value meets a threshold limit, generates a force commit packet comprising the sequence number of a last one of the batch messages sent to the target queue; and in response to determining that the sequence number of the generated force commit packet data is not a last position number within the first batch sequence, associates a second logic unit of work identifier with a subset sequence plurality of the first batch messages that comprises a plurality of the batch messages having different sequence numbers spanning from a first of the sequence numbers to the sequence number of the generated force commit packet data, and commits the subset sequence plurality of messages to the target queue of the receiving node, wherein the second logic unit of work identifier is different from the first logic unit of work identifier. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A computer program product for a proactive channel agent structure, the computer program product comprising:
-
a computer readable storage medium having computer readable program code embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the computer readable program code comprising instructions for execution by a processor that cause the processor to; send individually, to a target queue of a receiving node of a cluster plurality of server nodes, messages of a first batch sequence plurality of messages, each with different sequence numbers indicative of their relative positions within the first batch sequence, wherein each of the first batch sequence plurality of messages is associated with a first logic unit of work identifier; update a message counter value in response to each receipt by the receiving node of one of the first batch sequence plurality of messages sent to the target queue; in response to determining that the updated message counter value meets a threshold limit, generate a force commit packet comprising the sequence number of a last one of the batch messages sent to the target queue; and in response to determining that the sequence number of the generated force commit packet data is not a last position number within the first batch sequence, associate a second logic unit of work identifier with a subset sequence plurality of the first batch messages that comprises a plurality of the batch messages having different sequence numbers spanning from a first of the sequence numbers to the sequence number of the generated force commit packet data, and commit the subset sequence plurality of messages to the target queue of the receiving node, wherein the second logic unit of work identifier is different from the first logic unit of work identifier. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification