# US 2025/0156240 A1 · Smoothing Intra-Faas Workflow Variations Using Process-Subsumed Subflows

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

- Number: US 2025/0156240 A1
- Document ID: US20250156240A1
- Status: Published application
- Kind: A1
- Application number: 18/389,333
- Filed: 2023-11-14
- Published: 2025-05-15
- Earliest claimed: 2023-11-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Padmanabha Venkatagiri Seshadri; Vijay Ekambaram; Subhajit Bhuiya; Saravanan Sadacharam
- Web page: https://patentgrep.com/patent/US20250156240A1

## CPC

- G06F 9/4843: {by program, e.g. task dispatcher, supervisor, operating system}
- G06F 9/5077: {Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455)}
- G06F 9/4411: {Configuring for operating with peripheral devices; Loading of device drivers}
- G06F 9/45558: {Hypervisor-specific management and integration aspects}
- G06F 9/485: {Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence)}
- G06F 9/5005: {to service a request}
- 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/5061: {Partitioning or combining of resources}
- G06F 9/5072: {Grid computing}
- G06F 9/4494: {data driven}
- G06F 2009/45562: {Creating, deleting, cloning virtual machine instances}
- G06F 2009/4557: {Distribution of virtual machine instances; Migration and load balancing}
- G06F 2009/45575: {Starting, stopping, suspending or resuming virtual machine instances}
- G06F 2209/484: Precedence
- G06F 2209/486: Scheduler internals
- G06F 2209/5017: Task decomposition
- G06F 2209/509: Offload
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Mechanisms are provided for segregating a function-as-a-service (FaaS) workflow into processes for segregated execution. The mechanisms identify a plurality of sub-flows within the FaaS workflow. The mechanisms generate, for each sub-flow, a container to implement the sub-flow as a separate process from processes of other sub-flows in the FaaS workflow. At least one sub-flow comprises a plurality of functions of the FaaS workflow. In addition, the mechanisms deploy the containers of the plurality of sub-flows for execution by one or more nodes.

## Claims

### Claim 1

A method, in a data processing system, for segregating a function-as-a-service (FaaS) workflow into processes for segregated execution, the method comprising:
identifying a plurality of sub-flows within the FaaS workflow;
generating, for each sub-flow, a container to implement the sub-flow as a separate process from processes of other sub-flows in the FaaS workflow, wherein at least one sub-flow comprises a plurality of functions of the FaaS workflow; and
deploying the containers of the plurality of sub-flows for execution by one or more nodes.

### Claim 2 (depends on 1)

The method of claim 1, wherein the method further comprises inserting, for at least one function, in one or more of the sub-flows of the plurality of sub-flows, that invokes a function of a different sub-flow, a routing tap that applies a policy to alter an input to a subsequent function or determine an execution path based on a condition of the at least one function.

### Claim 3 (depends on 2)

The method of claim 2, wherein the routing tap controls, based on an output of a first function in a first sub-flow of a first process, with which the routing tap is associated, which second function in a second sub-flow of a second process to invoke.

### Claim 4 (depends on 2)

The method of claim 2, wherein the routing tap comprises logic that determines when to invoke the function of the different sub-flow or to continue a workflow of a sub-flow in which the routing tap is inserted.

### Claim 5 (depends on 2)

The method of claim 2, wherein the routing tap comprises a wrapper of the at least one function, which comprises a signature of the at least one function and control-flow-flags, wherein the control-flow-flags are set through an attached probe which is invoked during function invocate or before a function return of the at least one function.

### Claim 6 (depends on 2)

The method of claim 2, wherein the routing tap comprises an Extended Berkeley Packet Filter (eBPF) user probe attached to a function invocation event, and wherein the policy is obtained from an eBPF map with an eBPF master.

### Claim 7 (depends on 1)

The method of claim 1, wherein the method further comprises inserting a proxy, for at least one function, in the one or more sub-flows of the plurality of sub-flows, that is invoked by a function of a different sub-flow.

### Claim 8 (depends on 1)

The method of claim 1, wherein identifying a plurality of sub-flows within the FaaS workflow comprises identifying a subset of functions of the FaaS workflow that are executed together in a sequence at least a threshold number of times.

### Claim 9 (depends on 1)

The method of claim 1, wherein the identifying of the plurality of sub-flows within the FaaS workflow is performed dynamically based on gathered performance data for the FaaS workflow, and wherein the sub-flows within the FaaS workflow may change over time based on the gathered performance data.

### Claim 10 (depends on 1)

The method of claim 1, wherein deploying the containers of the plurality of sub-flows for execution by one or more nodes comprises generating a deployment plan having segregated invocation paths and control data for the plurality of sub-flows executed as segregated processes.

### Claim 11

A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to segregate a function-as-a-service (FaaS) workflow into processes for segregated execution, at least by:
identifying a plurality of sub-flows within the FaaS workflow;
generating, for each sub-flow, a container to implement the sub-flow as a separate process from processes of other sub-flows in the FaaS workflow, wherein at least one sub-flow comprises a plurality of functions of the FaaS workflow; and
deploying the containers of the plurality of sub-flows for execution by one or more nodes.

### Claim 12 (depends on 11)

The computer program product of claim 11, wherein the computer readable program further causes the computing device to:
insert, for at least one function, in one or more of the sub-flows of the plurality of sub-flows, that invokes a function of a different sub-flow, a routing tap that applies a policy to alter an input to a subsequent function or determine an execution path based on a condition of the at least one function.

### Claim 13 (depends on 12)

The computer program product of claim 12, wherein the routing tap controls, based on an output of a first function in a first sub-flow of a first process, with which the routing tap is associated, which second function in a second sub-flow of a second process to invoke.

### Claim 14 (depends on 12)

The computer program product of claim 12, wherein the routing tap comprises logic that determines when to invoke the function of the different sub-flow or to continue a workflow of a sub-flow in which the routing tap is inserted.

### Claim 15 (depends on 12)

The computer program product of claim 12, wherein the routing tap comprises a wrapper of the at least one function, which comprises a signature of the at least one function and control-flow-flags, wherein the control-flow-flags are set through an attached probe which is invoked during function invocate or before a function return of the at least one function.

### Claim 16 (depends on 12)

The computer program product of claim 12, wherein the routing tap comprises a Extended Berkeley Packet Filter (eBPF) user probe attached to a function invocation event, and wherein the policy is obtained from an eBPF map with an eBPF master.

### Claim 17 (depends on 11)

The computer program product of claim 11, wherein the method further comprises inserting a proxy, for at least one function, in the one or more sub-flows of the plurality of sub-flows, that is invoked by a function of a different sub-flow.

### Claim 18 (depends on 11)

The computer program product of claim 11, wherein identifying a plurality of sub-flows within the FaaS workflow comprises identifying a subset of functions of the FaaS workflow that are executed together in a sequence at least a threshold number of times.

### Claim 19 (depends on 11)

The computer program product of claim 11, wherein the identifying of the plurality of sub-flows within the FaaS workflow is performed dynamically based on gathered performance data for the FaaS workflow, and wherein the sub-flows within the FaaS workflow may change over time based on the gathered performance data.

### Claim 20

An apparatus comprising:
at least one processor; and
at least one memory coupled to the at least one processor, wherein the at least one memory comprises instructions which, when executed by the at least one processor, cause the at least one processor to segregate a function-as-a-service (FaaS) workflow into processes for segregated execution, at least by:
identifying a plurality of sub-flows within the FaaS workflow;
generating, for each sub-flow, a container to implement the sub-flow as a separate process from processes of other sub-flows in the FaaS workflow, wherein at least one sub-flow comprises a plurality of functions of the FaaS workflow; and
deploying the containers of the plurality of sub-flows for execution by one or more nodes.
