Computing resource allocation with subgraph isomorphism

A method for use with a computing system, the method comprising:

• generating a first computing resource graph, wherein the first computing resource graph is a directed weighted graph indicating a plurality of functions configured to be executed on a plurality of communicatively connected processing devices;
• for a plurality of pairs of the functions indicated in the first computing resource graph, wherein each pair includes a first function with a first output type and a second function with a second input type that matches the first output type, determining a shortest path including one or more first-graph edges on the first computing resource graph between the first function and the second function;
• generating a second computing resource graph indicating the plurality of pairs of functions connected by a plurality of second-graph edges, wherein each second-graph edge is the shortest path for the pair of functions connected by that second-graph edge;
• receiving a pipeline directed acyclic graph (DAG) specifying a data pipeline of a plurality of processing stages configured to be executed with corresponding functions of the plurality of functions;
• determining a subgraph isomorphism between the pipeline DAG and the second computing resource graph;
• and
• conveying, to one or more processing devices of the plurality of processing devices, instructions to execute the plurality of processing stages with the plurality of functions as specified by the subgraph isomorphism.

A computing system comprising:

• a processor configured to:
• generate a first computing resource graph, wherein the first computing resource graph is a directed weighted graph indicating a plurality of functions configured to be executed on a plurality of communicatively connected processing devices;
• for a plurality of pairs of the functions indicated in the first computing resource graph, wherein each pair includes a first function and a second function that are indicated in the first computing resource graph as having available processing capacity, determine a shortest path including one or more first-graph edges on the first computing resource graph between the first function and the second function;
• generate a second computing resource graph indicating the plurality of pairs of functions connected by a plurality of second-graph edges, wherein each second-graph edge is the shortest path for the pair of functions connected by that second-graph edge;
• receive a pipeline directed acyclic graph (DAG) specifying a data pipeline of a plurality of processing stages;
• determine a subgraph isomorphism between the pipeline DAG and the second computing resource graph configured to be executed with corresponding functions of the plurality of functions;
• and
• convey, to one or more processing devices of the plurality of processing devices, instructions to execute the plurality of processing stages with the plurality of functions as specified by the subgraph isomorphism.