Dynamic factoring and composing workflows

Patent metadata

Field	Value
Publication number	US-12299497-B2
Application number	US-202217657017-A
Country	US
Kind code	B2
Filing date	Mar 29, 2022
Priority date	Mar 29, 2022
Publication date	May 13, 2025
Grant date	May 13, 2025

Abstract

Various embodiments are provided for dynamically factoring and composing workflows in a computing environment by one or more processors in a computing system. Subgraphs (e.g., blocks) of workflows stored in a workflow library may be identified. The subgraphs may be functional blocks such as, for example, the functional blocks may perform a logical task. Similarities and relationships may be identified between one or more of the blocks of one or more workflows. One or more blocks may be suggested for use in workflow opportunities of target workflows based on the identified associated similarities and relationships.

First claim

What is claimed is:

1. A method executed by one or more processors in a computing environment comprising:
receiving, from one or more workflow creators, a plurality of workflows comprising a plurality of blocks;
storing the plurality of workflows in a workflow library;
executing the plurality of workflows; and
presenting, to a user, a set of changes between versions of a block in two workflows of the plurality of workflows based on a sequence of block modification events, wherein:
the plurality of blocks are functional blocks that are represented as one or more graphs and subgraphs;
the functional blocks perform one or more logical tasks;
the one or more graphs and subgraphs are associated with a quotient graph defined by an equivalence relationship which defines if two nodes of the one or more graphs and subgraphs are on the same block;
the equivalence relationship is for a given set of paths and a set of nodes if they appear together in all paths and do not appear separately in the one or more graphs and subgraphs;
the given set of paths are all subgraphs to leaf nodes of a graph of the one or more graphs and subgraphs;
the functional blocks are defined by subgraphs all of whose elements are not on the way to a leaf node; and
a plurality of associated similarities and relationships exist between at least two of the plurality of blocks of the plurality of workflows.

2. The method of claim 1 , further comprising:
receiving, from the user, a selection of one or more of the plurality of blocks.

3. The method of claim 1 , wherein a composition knowledge base (CKB) is a graph of the one or more graphs and subgraphs where nodes in the CKB represent workflows and edges similarities or producer/consumer relationships between the nodes.

4. The method of claim 1 , wherein a compatibility score is associated with at least two blocks of the plurality of blocks.

5. The method of claim 1 , wherein a similarity score is associated with one or more of the plurality of blocks and one or more target workflows.

6. The method of claim 1 , further including:
providing access to one or more workflows external to the workflow library for use in one or more target workflows.

7. The method of claim 1 , wherein one or more blocks of the plurality of blocks execute at least one command line executable.

8. A system comprising:
one or more computers with executable instructions that when executed cause the system to:
receive, from one or more workflow creators, a plurality of workflows comprising a plurality of blocks;
store the plurality of workflows in a workflow library;
execute the plurality of workflows; and
present, to a user, a set of changes between versions of a block in two workflows of the plurality of workflows based on a sequence of block modification events, wherein:
the plurality of blocks are functional blocks that are represented as one or more graphs and subgraphs;
the functional blocks perform one or more logical tasks;
the one or more graphs and subgraphs are associated with a quotient graph defined by an equivalence relationship which defines if two nodes of the one or more graphs and subgraphs are on the same block;
the equivalence relationship is for a given set of paths and a set of nodes if they appear together in all paths and do not appear separately in the one or more graphs and subgraphs;
the given set of paths are all subgraphs to leaf nodes of a graph of the one or more graphs and subgraphs;
the functional blocks are defined by subgraphs all of whose elements are not on the way to a leaf node; and
a plurality of associated similarities and relationships exist between at least two of the plurality of blocks of the plurality of workflows.

9. The system of claim 8 , wherein the executable instructions when executed further cause the system to:
receive, from the user, a selection of one or more of the plurality of blocks.

10. The system of claim 8 , wherein a composition knowledge base (CKB) is a graph of the one or more graphs and subgraphs where nodes in the CKB represent workflows and edges similarities or producer/consumer relationships between the nodes.

11. The system of claim 8 , wherein a compatibility score is associated with at least two blocks of the plurality of blocks.

12. The system of claim 8 , wherein a similarity score is associated with one or more of the plurality of blocks and one or more target workflows.

13. The system of claim 8 , wherein the executable instructions when executed further cause the system to:
provide access to one or more workflows external to the workflow library for use in one or more target workflows.

14. The system of claim 8 , wherein one or more blocks of the plurality of blocks execute at least one command line executable.

15. A computer program product comprising:
one or more computer readable storage media and program instructions collectively stored on the one or more computer readable storage media, the program instructions comprising the steps of:
receiving, from one or more workflow creators, a plurality of workflows comprising a plurality of blocks;
storing the plurality of workflows in a workflow library;
executing the plurality of workflows; and
presenting, to a user, a set of changes between versions of a block in two workflows of the plurality of workflows based on a sequence of block modification events, wherein:
the plurality of blocks are functional blocks that are represented as one or more graphs and subgraphs;
the functional blocks perform one or more logical tasks;
the one or more graphs and subgraphs are associated with a quotient graph defined by an equivalence relationship which defines if two nodes of the one or more graphs and subgraphs are on the same block;
the equivalence relationship is for a given set of paths and a set of nodes if they appear together in all paths and do not appear separately in the one or more graphs and subgraphs;
the given set of paths are all subgraphs to leaf nodes of a graph of the one or more graphs and subgraphs;
the functional blocks are defined by subgraphs all of whose elements are not on the way to a leaf node; and
a plurality of associated similarities and relationships exist between at least two of the plurality of blocks of the plurality of workflows.

16. The computer program product of claim 15 , the program instructions further comprising the steps of:
receiving, from the user, a selection of one or more of the plurality of blocks.

17. The computer program product of claim 15 , wherein a compatibility score is associated with at least two blocks of the plurality of blocks.

18. The computer program product of claim 15 , wherein a similarity score is associated with one or more of the plurality of blocks and one or more target workflows.

19. The computer program product of claim 15 , the program instructions further comprising the steps of:
providing access to one or more workflows external to the workflow library for use in one or more target workflows.

20. The computer program product of claim 15 , wherein one or more blocks of the plurality of blocks execute at least one command line executable.

Assignees

• IBM

Inventors

• Johnston Michael
• Vasileiadis Vasileios

Classifications

• G06N5/02

  Knowledge representation; Symbolic representation · CPC title

• G06F2209/5011

  Pool · CPC title

• G06F2209/505

  Clust · CPC title

• G06F9/5072

  Grid computing · CPC title

• G06F9/5038

  considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups) · CPC title