US 11,641,306 B1 · Dynamic runtime application integration

Abstract

Systems and techniques for dynamic runtime application integration are generally described. A set of source nodes may be determined for a first compute service. A source node priority score may be determined for each source node. A first destination node priority score may be determined for a first destination node for the first compute service. The source node priority score for a first source node and the first destination node priority score may be combined to determine a first priority score. The source node priority score for a second source node and the first destination node priority score may be combined to determine a second priority score. A first data pathway from the first source node to the first destination node may be prioritized based at least in part on a comparison of the first priority score and the second priority score.

Claims20

Dependent claims

A method comprising:

determining a set of source nodes, wherein each source node of the set of source nodes is designated as a data source for a first compute service;
determining, for a first source node of the set of source nodes, a first source node priority score based at least in part on a first amount of data to be sent to the first compute service by the first source node;
determining, for a first destination node designated to receive data from the first compute service, a first destination node priority score based at least in part on a compute load on the first destination node;
and
prioritizing deployment of a first data pathway from the first source node to the first destination node based at least in part on the first source node priority score and the first destination node priority score.

2 more elements

A system comprising:

a first compute service;
and
an integration service comprising at least one processor, the at least one processor effective to:
determine, for the first compute service, a set of source nodes, wherein each source node of the set of source nodes is designated as a data source for the first compute service;
determine, for a first source node of the set of source nodes, a first source node priority score based at least in part on a first amount of data to be sent to the first compute service by the first source node;
determine, for a first destination node designated to receive data from the first compute service, a first destination node priority score based at least in part on a compute load on the first destination node;
prioritize deployment of a first data pathway from the first source node to the first destination node based at least in part on the first source node priority score and the first destination node priority score.

4 more elements

A non-transitory machine readable medium storing a program, which when executed by at least one processor, is effective to:

determine, for a first compute service, a set of source nodes, wherein each source node of the set of source nodes is designated as a data source for the first compute service;
determine, for a first source node of the set of source nodes, a first source node priority score based at least in part on a first amount of data to be sent to the first compute service by the first source node;
determine, for a first destination node designated to receive data from the first compute service, a first destination node priority score based at least in part on a compute load on the first destination node;
prioritize deployment of a first data pathway from the first source node to the first destination node based at least in part on the first source node priority score and the first destination node priority score.

1 more element

Dependencies are inferred from the claim text.

Dynamic runtime application integration

Life of this patent

Dynamic runtime application integration

Life of this patent

Abstract

Claims20