Implementing a serialization construct within an environment of parallel data flow graphs
View Patent ↗A serialization construct is implemented within an environment of a number of parallel data flow graphs. A quiesce node is appended to every active data flow graph. The quiesce node prevents a token from passing to a next data flow graph within a chain before an execution of the active data flow graph has been finished. A serial data flow graph is implemented to provided for a serial execution while no other data flow graph is active. A serialize node is appended to a starting point of a serial data flow graph. A serialize end node is appended to an endpoint of the serial data flow graph. The serialize node is activated to start a serial operation. The serialize end node is activated after the serial operation has been terminated.
1. A method for implementing a serialization construct within an environment of a number of parallel data flow graphs, which method comprising:
appending, by a quiesce manager executing on a processor, a quiesce node to an active data flow graph, wherein the quiesce node prevents a token from passing to a next data flow graph within a chain before an execution of the active data flow graph has been finished;
implementing a serial data flow graph provided for a serial execution while no other data flow graph is active;
appending a serialize node to a starting point of the serial data flow graph;
appending a serialize end node to an endpoint of the serial data flow graph, wherein the quiesce manager is connected to the quiesce node, to the serialize node and/or to the serialize end node;
activating the serialize node to start a serial operation; and
activating the serialize end node after the serial operation has been terminated.
2. The method according to claim 1 , wherein the serial operation comprises a sequence of operations.
3. The method according to claim 1 , wherein a parallelism is allowed inside the serial data flow graph.
4. The method according to claim 1 , wherein the activation of the serialize end node terminates all currently active quiesce nodes.
5. The method according to claim 1 , wherein the activation of the serialize end node allows a token to pass to the next data flow graph within the chain.
6. The method according to claim 1 , wherein the quiesce node receives a token from the associated data flow graph and sends the token to the corresponding next data flow graph.
7. The method according to claim 1 , wherein the serialize node receives a token from the quiesce manager and sends the token to the serial data flow graph.
8. The method according to claim 1 , wherein the serialize end node receives a token from the serial data flow graph and sends the token to the quiesce manager.
9. The method according to claim 1 , wherein the quiesce manager receives requests of the serial operation.
10. The method according to claim 1 , wherein the quiesce manager receives a token from the quiesce nodes.
11. The method according to claim 10 , wherein the quiesce manager sends the token to the serialize node during the serial operation.
12. The method according to claim 10 , wherein the quiesce manager sends the token to the serialize node during the serial sequence of operations.
13. The method according to claim 10 , wherein the quiesce manager sends the token to all quiesce nodes after the serial operation has finished.
14. The method according to claim 10 , wherein the quiesce manager sends the token to all quiesce nodes after the serial sequence of operations has finished.
15. A system for implementing a serialization construct within an environment of a plurality of parallel data flow graphs, wherein the system is provided to perform the method comprising:
appending, by a quiesce manager executing on a processor, a quiesce node to an active data flow graph, wherein the quiesce node prevents a token from passing to a next data flow graph within a chain before an execution of the active data flow graph has been finished;
implementing a serial data flow graph provided for a serial execution while no other data flow graph is active;
appending a serialize node to a starting point of the serial data flow graph;
appending a serialize end node to an endpoint of the serial data flow graph, wherein the quiesce manager is connected to the quiesce node, to the serialize node and/or to the serialize end node;
activating the serialize node to start a serial operation; and
activating the serialize end node after the serial operation has been terminated.
16. A computer program product for implementing a serialization construct within an environment of a number of parallel data flow graphs, the computer program product comprising:
a non-transitory computer readable storage medium readable by a processor and storing instructions for execution by the processor for performing a method comprising:
appending, by a quiesce manager, a quiesce node to an active data flow graph, wherein the quiesce node prevents a token from passing to a next data flow graph within a chain before an execution of the active data flow graph has been finished;
implementing a serial data flow graph provided for a serial execution while no other data flow graph is active;
appending a serialize node to a starting point of the serial data flow graph;
appending a serialize end node to an endpoint of the serial data flow graph, wherein the quiesce manager is connected to the quiesce node, to the serialize node and/or to the serialize end node;
activating the serialize node to start a serial operation; and
activating the serialize end node after the serial operation has been terminated.
17. The computer program product of claim 16 , wherein the serial operation comprises a sequence of operations.