# US 2024/0303131 A1 · System and Method for Optimal Serverless Deployment of Analytics Tasks Across Hierarchical Edge Network

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

- Number: US 2024/0303131 A1
- Document ID: US20240303131A1
- Status: Published application
- Kind: A1
- Application number: 18/598,379
- Filed: 2024-03-07
- Published: 2024-09-12
- Earliest claimed: 2023-03-09
- Assignees: ABB Schweiz AG
- Applicants: ABB Schweiz AG
- Inventors: Santonu Sarkar; Marie Christin Platenius-Mohr; Jan Christoph Schlake; Madapu Amarlingam; Nafise Eskandani; Reuben Borrison
- Web page: https://patentgrep.com/patent/US20240303131A1

## CPC

- G06F 9/5016: {the resource being the memory}
- G06F 9/505: {considering the load}
- G06F 12/0888: using selective caching, e.g. bypass
- G06F 12/126: with special data handling, e.g. priority of data or instructions, handling errors or pinning
- G06F 2212/1016: Performance improvement
- G06F 2212/1056: Simplification
- G06F 2212/175: Industrial control system
- G06F 2212/603: of operating mode, e.g. cache mode or local memory mode
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer-implemented method for orchestrating execution of workloads on nodes includes determining a set of requirements for resources needed for execution of the workload; determining for each compute node an availability of the resources required; establishing multiple candidate configurations having an assignment of each compute workload to at least one pair of a compute node and a working class, wherein different working classes differ at least in the degree of retention of the compute workload in memory and/or in at least one cache of the compute node after execution; computing for each candidate configuration at least one figure of merit with respect to at least one given optimization goal; and determining a candidate configuration with the best figure of merit as the optimal configuration.

## Claims

### Claim 1

A computer-implemented method for orchestrating the execution of a given set of compute workloads on a given set of compute nodes, comprising:
determining for each workload a set of requirements for resources needed for execution of the workload, wherein the resources comprise at least a memory and a frequency 11b-16b) of usage;
determining for each compute node an availability of the resources required by the workloads;
establishing multiple candidate configurations, wherein each candidate configuration comprises an assignment of each compute workload to at least one pair of a compute node and a working class such that the resource requirements of all workloads are satisfied, wherein different working classes differ at least in the degree of retention of the compute workload in memory and/or in at least one cache of the compute node after execution;
computing for each candidate configuration at least one figure of merit with respect to at least one given optimization goal; and
determining a candidate configuration with the best figure of merit as the optimal configuration.

### Claim 2 (depends on 1)

The method of claim 1, wherein the resources needed for execution of the workload further comprise network communication resources and/or input data to be processed by the workload.

### Claim 3 (depends on 1)

The method of claim 1, wherein the available working classes comprise at least:
a hot working class for workloads that are to be retained in random access memory (RAM) of the compute node after execution;
a warm working class for workloads that are to be moved from RAM to a cache memory of the compute node, wherein the access time of said cache memory is slower than the access time of the RAM but faster than the access time of mass storage used by the compute node; and
a cold working class for workloads that are to be retained neither in RAM nor in the cache memory of the compute node after execution.

### Claim 4 (depends on 1)

The method of claim 1, wherein resource availability of compute nodes is discretized into availability classes comprising at least:
a cold availability class indicating that a high amount of resources is available;
a warm availability class indicating that a moderate amount of resources is available; and
a hot availability class indicating that a low amount of resources is available.

### Claim 5 (depends on 4)

The method of claim 4, wherein the establishing of candidate configurations comprises assigning workloads to compute nodes according to a diffusion law where a temperature differential between working classes and availability classes attract workloads by compute nodes.

### Claim 6 (depends on 1)

The method of claim 1, wherein the figure of merit is dependent at least in part on spin-up times that compute nodes require to instantiate execution environments for workloads; and/or data transfer times for input data needed by workloads to compute nodes executing the workloads.

### Claim 7 (depends on 1)

The method of claim 1, further comprising computing at least one new candidate configuration based on a history of at least one candidate configuration and the figure of merit computed for the at least one candidate configuration.

### Claim 8 (depends on 7)

The method of claim 7, wherein the at least one new candidate configuration is determined utilizing an evolutionary algorithm.

### Claim 9 (depends on 1)

The method of claim 1, further comprising executing the given workloads on the given compute nodes according to the determined optimal configuration.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
monitoring, during execution of the workloads, the resource requirements of at least one workload, and/or the resource availability on at least one compute node, and/or the topology of available compute nodes; and
in response to a change in the resource requirements, and/or in the resource availability, and/or in the topology, meeting a predetermined criterion, establishing at least one new candidate configuration based on the changed resource requirements, on the changed resource availability, and/or on the changed topology.

### Claim 11 (depends on 10)

The method of claim 10, wherein at least one new candidate configuration comprises at least one further compute node in addition to the given set of compute nodes.

### Claim 12 (depends on 11)

The method of claim 11, further comprising, in response to determining that the new candidate configuration with the further compute node is a new optimal configuration, onboarding the new compute node to the given set of compute nodes; and
executing the given workloads on the new set of compute nodes according to the determined new optimal configuration.

### Claim 13 (depends on 1)

The method of claim 1, wherein at least one workload comprises executing a trained machine learning model.

### Claim 14 (depends on 1)

The method of claim 1, wherein at least one workload comprises processing input data that is indicative of the operating state of an industrial plant from a distributed control system(DCS) of the industrial plant into an indicator of a quality of at least one product produced by the industrial plant.

### Claim 15 (depends on 14)

The method of claim 14, further comprising feeding back the indicator of the quality to the DCS; and steering, by the DCS, the industrial plant to improve quality.

### Claim 16 (depends on 1)

The method of claim 1, wherein the computer executable method is stored in tangible storage media that includes instructions that, when executed, cause the computer to carry out the method.
