IP Library Granted Patent US 11,645,253
Granted Patent B1
US 11,645,253 · App. 17/539,781 · Granted May 9, 2023

Managing a new version of an integration flow during a rolling update

Inventors: Chengxuan Xing (Romsey, GB); Ashley Donald Harrison (Southampton, GB); Matthew Paul Chapman (Eastleigh, GB); Vlad Balanescu (Southampton, GB)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F16/219
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,645,253
App. No.
17/539,781
Granted
May 9, 2023
Kind
B1
Abstract

A method includes: receiving an indication of a new integration flow document that updates a current integration flow document of an integration flow; determining a last switchable node that is included in both the current integration flow document and the new integration flow document; determining, for each running instance of the integration flow using the current integration flow document, whether a currently executing node of the instance is less than or equal to the last switchable node; in response to determining the currently executing node of the instance is less than or equal to the last switchable node, switching the instance to the new integration flow document; and in response to determining the currently executing node of the instance is greater than or the last switchable node, waiting for completion of the instance using the current integration flow document.

Claims (36)

1. A method, comprising:

receiving, by a computing device, an indication of a new integration flow document that updates a current integration flow document of an integration flow;

determining, by the computing device, a last switchable node that is included in both the current integration flow document and the new integration flow document;

determining by the computing device, for each running instance of the integration flow using the current integration flow document, whether a currently executing node of the instance is less than or equal to the last switchable node;

in response to determining the currently executing node of the instance is less than or equal to the last switchable node, switching the instance to the new integration flow document; and

in response to determining the currently executing node of the instance is greater than the last switchable node, waiting for completion of the instance using the current integration flow document.

2. The method of claim 1 , further comprising, in response to completion of the instance using the current integration flow document, running a new instance of the integration flow using the new integration flow document.

3. The method of claim 1 , wherein the determining the last switchable node comprises analyzing the current integration flow document and the new integration flow document.

4. The method of claim 3 , wherein the analyzing the current integration flow document and the new integration flow document comprises analyzing top-level nodes in the current integration flow document and the new integration flow document.

5. The method of claim 4 , wherein the analyzing ignores asynchronous nodes.

6. The method of claim 3 , wherein the analyzing the current integration flow document and the new integration flow document comprises analyzing only top-level nodes in the current integration flow document and the new integration flow document.

7. The method of claim 6 , wherein the analyzing ignores asynchronous nodes.

8. A computer program product comprising one or more computer readable storage media having program instructions collectively stored on the one or more computer readable storage media, the program instructions executable to:

receive an indication of a new integration flow document that updates a current integration flow document of an integration flow;

determine a last switchable node that is included in both the current integration flow document and the new integration flow document;

determine, for each running instance of the integration flow using the current integration flow document, whether a currently executing node of the instance is less than or equal to the last switchable node;

in response to determining the currently executing node of the instance is less than or equal to the last switchable node, switching the instance to the new integration flow document; and

in response to determining the currently executing node of the instance is greater than the last switchable node, waiting for completion of the instance using the current integration flow document.

9. The computer program product of claim 8 , wherein the program instructions are executable to, in response to completion of the instance using the current integration flow document, run a new instance of the integration flow using the new integration flow document.

10. The computer program product of claim 8 , wherein the determining the last switchable node comprises analyzing the current integration flow document and the new integration flow document.

11. The computer program product of claim 10 , wherein the analyzing the current integration flow document and the new integration flow document comprises analyzing top-level nodes in the current integration flow document and the new integration flow document.

12. The computer program product of claim 11 , wherein the analyzing ignores asynchronous nodes.

13. The computer program product of claim 10 , wherein the analyzing the current integration flow document and the new integration flow document comprises analyzing only top-level nodes in the current integration flow document and the new integration flow document.

14. The computer program product of claim 13 , wherein the analyzing ignores asynchronous nodes.

15. A system comprising:

a processor, a computer readable memory, one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions executable to:

receive an indication of a new integration flow document that updates a current integration flow document of an integration flow;

determine a last switchable node that is included in both the current integration flow document and the new integration flow document;

determine, for each running instance of the integration flow using the current integration flow document, whether a currently executing node of the instance is less than or equal to the last switchable node;

in response to determining the currently executing node of the instance is less than or equal to the last switchable node, switching the instance to the new integration flow document; and

in response to determining the currently executing node of the instance is greater than the last switchable node, waiting for completion of the instance using the current integration flow document.

16. The system of claim 15 , wherein the program instructions are executable to, in response to completion of the instance using the current integration flow document, run a new instance of the integration flow using the new integration flow document.

17. The system of claim 15 , wherein the determining the last switchable node comprises analyzing the current integration flow document and the new integration flow document.

18. The system of claim 17 , wherein the analyzing the current integration flow document and the new integration flow document comprises analyzing top-level nodes in the current integration flow document and the new integration flow document.

19. The system of claim 18 , wherein the analyzing ignores asynchronous nodes.

20. The system of claim 17 , wherein the analyzing the current integration flow document and the new integration flow document comprises analyzing only top-level nodes in the current integration flow document and the new integration flow document.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 1, 2021
From: XING, CHENGXUAN; HARRISON, ASHLEY DONALD; CHAPMAN, MATTHEW PAUL; BALANESCU, VLAD
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 058259/0041 →
Cited By (5)
US 12,461,841 US 12,541,785 US 12,608,689 US 12,645,350 US 12,664,599