| CPC G06F 9/44505 (2013.01) [G06F 9/4881 (2013.01); G06F 11/3495 (2013.01); H04L 9/3236 (2013.01); G06F 9/468 (2013.01)] | 16 Claims |

|
1. A method for executing a process using an execution strategy for the process, wherein the process comprises: a plurality of computerized validations and a plurality of computerized actions, wherein the execution strategy comprises a tree data structure comprising a plurality of linked nodes, and wherein the plurality of linked nodes comprise a root node and at least one leaf node, the method comprising, using one or more computer processors:
traversing the plurality of linked nodes of the tree data structure, starting at the root node, and ending at one of the at least one leaf nodes; and
executing computer instructions included in each traversed node, wherein each instruction relates to at least one of: a computerized validation of the plurality of computerized validations and a computerized action of the plurality of computerized actions, wherein the computerized validation comprises performing one or more checksums, wherein the computerized action comprises: one or more computing parts, and one or more committing parts, the committing parts comprising changing one or more data items stored in a computing device, wherein the committing parts are delayed based on at least one computerized validation of the plurality of computerized validations, wherein at least one computerized validation of the plurality of computerized validations and at least one computerized action of the plurality of computerized actions are configured to be executed in parallel, wherein one or more of the instructions comprise rolling back an action after the action has been executed, and wherein a route of the traversing is based on at least one outcome of executing at least one validation of the plurality of computerized validations.
|