Proactive channel agent

• US 10,462,067 B2
• Filed: 01/26/2017
• Issued: 10/29/2019
• Est. Priority Date: 01/26/2017
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Emmett, Andrew A., Fan, Si Bin, Li, Hui, Lian, Hao, Quan, Jing, Yu, Shan, Zhang, Juan
• Primary Examiner(s): Joo, Joshua
• Application Number:
  US15/416,074
• Publication Number:
  US 20180212857A1
• Time in Patent Office: 1,006 Days
• Field of Search: None
• CPC Class Codes: G06F 9/50 Allocation of resources, e.g. of the central processing unit [CPU]
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: H04L 47/743 Reaction at the end points
• CPC Class Codes: H04L 49/9057 Arrangements for supporting packet reassembly or resequencing

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.

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 message with a different sequence number indicative of a relative position of the message within the first batch sequence plurality of messages, 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 first batch sequence plurality of 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 plurality of messages, associating a second logic unit of work identifier with a subset sequence plurality of the first batch sequence plurality of messages that comprises a plurality of the first batch sequence plurality of 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 the first batch 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.

2. The method of claim 1, further comprising:

in response to determining that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages, de-associating all of the first batch sequence plurality of messages from the first logic unit of work identifier, marking all of the first batch sequence plurality of messages as rolled back, and assigning the second logic unit of work identifier to the subset sequence plurality of the first batch sequence plurality of messages marked as rolled back.

3. The method of claim 1, further comprising:

in response to determining that a last of the first batch sequence plurality of messages has been sequentially sent to the receiving node target queue, making a non-blocking receive-from c all;

reading buffered force-commit packet data returned from the non-blocking receive-from call; and

determining that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages as a function of reading the sequence number of the read force commit packet data from data returned from the non-blocking receive-from call.

4. The method of claim 1, further comprising:

sending a remainder of the messages of the first batch sequence plurality of messages that each have sequence numbers greater than the sequence number of the generated force commit packet data to an alternative destination that is selected from the group consisting of a pause queue, and a target queue of another node of the cluster of nodes that is indicated as available for receiving messages for the target queue.

5. The method of claim 1, further comprising:

in response to determining that the updated message counter value meets the threshold limit, setting a value of a node control state field for the receiving node within a central controller node to a limit-reached value;

updating other nodes of the cluster inclusive of the sending node with the limit-reached value for the node control state field of the receiving node; and

generating the force commit packet in response to updating the sending node with the limit-reached value for the node control state field of the receiving node.

6. The method of claim 5, further comprising:

in response to determining that the message counter did not reach the threshold limit within a specified interval time period from an initialization of the message counter to zero, updating the other nodes of the cluster inclusive of the sending node with an available value for the node control state field of the receiving node.

7. The method of claim 1, further comprising:

integrating computer-readable program code into a computer 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; and

wherein the processor executes program code instructions stored on the computer-readable storage medium via the computer readable memory and thereby performs the steps of sending the messages of the first batch sequence plurality of messages individually with the different sequence numbers to the target queue of the receiving node, each of the messages associated with the first logic unit of work identifier, updating the 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, generating the force commit packet in response to determining that the updated message counter value meets the threshold limit, and in response to determining that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages, associating the second logic unit of work identifier with the subset sequence plurality of the first batch sequence plurality of messages and committing the subset sequence plurality of the first batch sequence plurality of messages to the target queue of the receiving node.

8. The method of claim 7, wherein the computer-readable program code is provided as a service in a cloud environment.

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 message with a different sequence number indicative of a relative position of the message within the first batch sequence plurality of messages, 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 first batch sequence plurality of 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 plurality of messages, associates a second logic unit of work identifier with a subset sequence plurality of the first batch sequence plurality of messages that comprises a plurality of the first batch sequence plurality of 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 the first batch 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.

10. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:

in response to determining that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages, de-associates all of the first batch sequence plurality of messages from the first logic unit of work identifier, marks all of the first batch sequence plurality of messages as rolled back, and assigns the second logic unit of work identifier to the subset sequence plurality of the first batch sequence plurality of messages marked as rolled back.

11. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:

in response to determining that a last of the first batch sequence plurality of messages has been sequentially sent to the receiving node target queue, makes a non-blocking receive-from c all;

reads buffered force-commit packet data returned from the non-blocking receive-from call; and

determines that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages as a function of reading the sequence number of the read force commit packet data from data returned from the non-blocking receive-from call.

12. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:

sends a remainder of the messages of the first batch sequence plurality of messages that each have sequence numbers greater than the sequence number of the generated force commit packet data to an alternative destination that is selected from the group consisting of a pause queue, and a target queue of another node of the cluster of nodes that is indicated as available for receiving messages for the target queue.

13. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:

in response to determining that the updated message counter value meets the threshold limit, sets a value of a node control state field for the receiving node within a central controller node to a limit-reached value;

updates other nodes of the cluster inclusive of the sending node with the limit-reached value for the node control state field of the receiving node; and

generates the force commit packet in response to updating the sending node with the limit-reached value for the node control state field of the receiving node.

14. The system of claim 13, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby further:

in response to determining that the message counter did not reach the threshold limit within a specified interval time period from an initialization of the message counter to zero, updates the other nodes of the cluster inclusive of the sending node with an available value for the node control state field of the receiving node.

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 message with a different sequence number indicative of a relative position of the message within the first batch sequence plurality of messages, 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 first batch sequence plurality of 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 plurality of messages, associate a second logic unit of work identifier with a subset sequence plurality of the first batch sequence plurality of messages that comprises a plurality of the first batch sequence plurality of 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 the first batch 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.

16. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:

in response to determining that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages, de-associate all of the first batch sequence plurality of messages from the first logic unit of work identifier, mark all of the first batch sequence plurality of messages as rolled back, and assign the second logic unit of work identifier to the subset sequence plurality of the first batch sequence plurality of messages marked as rolled back.

17. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:

in response to determining that a last of the first batch sequence plurality of messages has been sequentially sent to the receiving node target queue, make a non-blocking receive-from call;

read buffered force-commit packet data returned from the non-blocking receive-from call; and

determine that the sequence number of the generated force commit packet data is not the last position number within the first batch sequence plurality of messages as a function of reading the sequence number of the read force commit packet data from data returned from the non-blocking receive-from call.

18. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:

send a remainder of the messages of the first batch sequence plurality of messages that each have sequence numbers greater than the sequence number of the generated force commit packet data to an alternative destination that is selected from the group consisting of a pause queue, and a target queue of another node of the cluster of nodes that is indicated as available for receiving messages for the target queue.

19. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:

in response to determining that the updated message counter value meets the threshold limit, set a value of a node control state field for the receiving node within a central controller node to a limit-reached value;

update other nodes of the cluster inclusive of the sending node with the limit-reached value for the node control state field of the receiving node; and

generate the force commit packet in response to updating the sending node with the limit-reached value for the node control state field of the receiving node.

20. The computer program product of claim 19, wherein the computer readable program code instructions for execution by the processor further cause the processor to:

in response to determining that the message counter did not reach the threshold limit within a specified interval time period from an initialization of the message counter to zero, update the other nodes of the cluster inclusive of the sending node with an available value for the node control state field of the receiving node.