# US 2024/0004723 A1 · Workflow optimization and re-distribution

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0004723 A1
- Document ID: US20240004723A1
- Status: Published application
- Kind: A1
- Application number: 17/809,570
- Filed: 2022-06-29
- Published: 2024-01-04
- Earliest claimed: 2022-06-29
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Peng Hui Jiang; ZHI LI GUAN; Jun Su; Kun Yang; Yun Diao; Shi Su
- Web page: https://patentgrep.com/patent/US20240004723A1

## CPC

- G06F 9/5088: {involving task migration}
- G06F 9/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)}
- G06F 9/5066: {Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs (mappping at compile time, see G06F8/451)}
- G06F 9/5072: {Grid computing}
- G06N 5/02: Knowledge representation; Symbolic representation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Workflow optimization and re-distribution involves a target task set that is determined from a plurality of tasks in a workflow and based on a data flow of the workflow. The target task set is re-distributed to obtain at least one re-distributed task set. Each re-distributed task set indicates a respective data path different from a data path of the target task set and has a same function as the target task set. A simulated data flow for the at least one re-distributed task set is obtained by simulating data flowing in at least one data path indicated by the at least one re-distributed task set. An optimized task set for the target task set is determined based on the simulated data flow for the at least one re-distributed task set.

## Claims

### Claim 1

A computer-implemented method comprising:
determining, by one or more processors, a target task set from a plurality of tasks included in a workflow based on a data flow of the workflow;
re-distributing, by the one or more processors, the target task set to obtain at least one re-distributed task set for the target task set, each re-distributed task set indicating a respective data path different from a data path of the target task set, with the at least one re-distributed task set having a same function as the target task set;
obtaining, by the one or more processors, a simulated data flow for the at least one re-distributed task set by simulating data flowing in at least one data path indicated by the at least one re-distributed task set; and
determining, by the one or more processors, an optimized task set for the target task set based on the simulated data flow for the at least one re-distributed task set.

### Claim 2 (depends on 1)

The method of claim 1 wherein determining the target task set further includes:
grouping, by the one or more processors, the plurality of tasks of the workflow into a plurality of task sets based on the data flow of the workflow and a knowledge base; and
selecting, by the one or more processors, the target task set from the plurality of task sets.

### Claim 3 (depends on 2)

The method of claim 2, wherein selecting the target task set further includes:
determining, by the one or more processors, the task set as the target task set based, at least in part, upon a determination that a time duration for completing the task exceeds a time threshold and/or a determination that a resource consumption for completing the task exceeds a consumption threshold.

### Claim 4 (depends on 2)

The method of claim 2, wherein grouping the plurality of tasks into the plurality of task sets further includes:
grouping, by the one or more processors, the plurality of tasks into the plurality of task sets based, at least in part, upon operators of the plurality of tasks and/or functions of the plurality of tasks.

### Claim 5 (depends on 2)

The method of claim 2, wherein selecting the target task set further includes:
determining, by the one or more processors, similarities among the plurality of task sets based on the data flow of the workflow; and
in accordance with a determination that a similarity between a first task set and a second task set exceeds a threshold, determining, by the one or more processors, the first task set or the second task set to be the target task set.

### Claim 6 (depends on 5)

The method of claim 5, wherein determining the similarities includes:
for each task set of the plurality of task sets:
obtaining, by the one or more processors, input data and output data of the task set by intercepting a request to the task set;
aggregating, by the one or more processors, a data metric for the task set based at least in part on the input data and output data of the task set;
obtaining, by the one or more processors, data flow timeline information of the task set; and
determining, by the one or more processors, the similarities based on the data metrics and data flow timeline information of the plurality of task sets.

### Claim 7 (depends on 6)

The method of claim 6, wherein aggregating the data metric for the task set includes:
aggregating, by the one or more processors, the data metric based on the input data and output data of the task set, pre-conditions and post-conditions of the task set and task implementations of the task set.

### Claim 8 (depends on 1)

The method of claim 1, wherein obtaining the simulated data flow for the at least one re-distributed task set further includes:
generating, by the one or more processors, simulated input data for the at least one re-distributed task set;
obtaining, by the one or more processors, simulated output data by inputting the simulated input data to the at least one data path indicated by the at least one re-distributed task set; and
obtaining, by the one or more processors, the simulated data flow by collecting the simulated input data and the simulated output data along with data flow timeline information and resource consumption information for the at least one re-distributed task set.

### Claim 9 (depends on 1)

The method of claim 1, wherein determining the optimized task set further includes:
determining, by the one or more processors, the at least one re-distributed task set to be the optimized task set based, at least in part, upon a determination that a time duration for completing the at least one re-distributed task set is below a time threshold and/or a determination that resource consumption for completing the at least one re-distributed task is below a consumption threshold.

### Claim 10 (depends on 1)

The method of claim 1, wherein the data flow of the workflow includes: (i) input data of tasks in the workflow; (ii) output data of tasks in the workflow; (iii) pre-conditions of tasks in the workflow; (iv) post-conditions of tasks in the workflow; (v) timeline information of tasks in the workflow; and/or (vi) resource consumption information of tasks in the workflow.

### Claim 11 (depends on 1)

The method of claim 1, further comprising:
determining, by the one or more processors, a further similarity between a further task set of a further workflow and the target task set; and
in accordance with a determination that the further similarity exceeds a threshold, re-distributing, by the one or more processors, the further task set of the further workflow based on the optimized task set.

### Claim 12

A computer system comprising:
a processing unit; and
a memory coupled to the processing unit and storing instructions thereon, the instructions, when executed by the processing unit, performing operations including:
determining a target task set from a plurality of tasks comprised in a workflow based on a data flow of the workflow,
re-distributing the target task set to obtain at least one re-distributed task set for the target task set, each re-distributed task set indicating a respective data path different from a data path of the target task set, with the at least one re-distributed task set having a same function as the target task set,
obtaining a simulated data flow for the at least one re-distributed task set by simulating data flowing in at least one data path indicated by the at least one re-distributed task set, and
determining an optimized task set for the target task set based on the simulated data flow for the at least one re-distributed task set.

### Claim 13 (depends on 12)

The computer system of claim 12 further comprising:
grouping the plurality of tasks of the workflow into a plurality of task sets based on the data flow of the workflow and a knowledge base; and
selecting the target task set from the plurality of task sets.

### Claim 14 (depends on 13)

The computer system of claim 13 wherein selecting the target task set further includes:
determining the task set as the target task set based, at least in part, upon a determination that a time duration for completing a task of the plurality of task sets exceeds a time threshold and/or a determination that resource computation for completing the task set exceeds a consumption threshold.

### Claim 15 (depends on 13)

The computer system of claim 13, wherein grouping the plurality of tasks into the plurality of task sets further includes:
grouping the plurality of tasks into the plurality of task sets based, at least in part, upon operators of the plurality of tasks and/or functions of the plurality of tasks.

### Claim 16 (depends on 13)

The computer system of claim 13, wherein selecting the target task set further includes:
determining similarities among the plurality of task sets based on the data flow of the workflow; and
in accordance with a determination that a similarity between a first task set and a second task set exceeds a threshold, determining the first task set or the second task set to be the target task set.

### Claim 17 (depends on 16)

The computer system of claim 16, wherein determining the similarities further includes:
for each task set of the plurality of task sets:
obtaining input data and output data of the task set by intercepting a request to the task set;
aggregating a data metric for the task set based at least in part on the input data and output data of the task set;
obtaining data flow timeline information of the task set; and
determining the similarities based on the data metrics and data flow timeline information of the plurality of task sets.

### Claim 18 (depends on 12)

The computer system of claim 12, wherein obtaining the simulated data flow for the at least one re-distributed task set further includes:
generating simulated input data for the at least one re-distributed task set;
obtaining simulated output data by inputting the simulated input data to the at least one data path indicated by the at least one re-distributed task set; and
obtaining the simulated data flow by collecting the simulated input data and the simulated output data along with data flow timeline information and resource consumption information for the at least one re-distributed task set.

### Claim 19 (depends on 12)

The computer system of claim 12, wherein determining the optimized task set further includes:
determining the at least one re-distributed task set to be the optimized task set based, at least in part, upon a determination that a time duration for completing the at least one re-distributed task set is below a time threshold and/or a determination that resource consumption for completing the at least one re-distributed task is below a consumption threshold.

### Claim 20

A computer program product comprising:
a machine readable storage device; and
computer code stored on the machine readable storage device, with the computer code including instructions and data for causing a processor(s) set to perform operations including the following:
determining a target task set from a plurality of tasks included in a workflow based on a data flow of the workflow,
re-distributing the target task set to obtain at least one re-distributed task set for the target task set, each re-distributed task set indicating a respective data path different from a data path of the target task set, the at least one re-distributed task set having a same function as the target task set,
obtaining a simulated data flow for the at least one re-distributed task set by simulating data flowing in at least one data path indicated by the at least one re-distributed task set, and
determining an optimized task set for the target task set based on the simulated data flow for the at least one re-distributed task set.
