Mechanisms for programmable composition of factor graphs

A composition server comprising:

• a memory storage comprising instructions;
• and
• one or more processors in communication with the memory storage, wherein the one or more processors execute the instructions to perform:
• accessing a first factor graph that represents a first component of a cloud application, the first factor graph comprising a first set of nodes;
• accessing a second factor graph that represents a second component of the cloud application, the second factor graph comprising a second set of nodes;
• determining a third set of nodes that are present in both the first set of nodes and the second set of nodes;
• joining the first factor graph and the second factor graph into a third factor graph, wherein the joining includes:
• unifying the third set of nodes in the first factor graph and the second factor graph;
• creating the third factor graph as an empty factor graph;
• and
• for each node in the third set of nodes:
• removing a factor parent of the node from the second factor graph;
• copying the node into the third factor graph;
• and
• setting a parent of the copied node to a parent of the node in the first factor graph;
• based on the third factor graph, selecting one or more computing resources;
• and
• deploying at least a portion of the cloud application to the selected computing resources.

A non-transitory computer-readable medium storing computer instructions for deploying a cloud application, that when executed by one or more processors, cause the one or more processors to perform steps of:

• accessing a first factor graph that represents a first component of the cloud application, the first factor graph comprising a first set of nodes;
• accessing a second factor graph that represents a second component of the cloud application, the second factor graph comprising a second set of nodes;
• determining a third set of nodes that are present in both the first set of nodes and the second set of nodes;
• joining the first factor graph and the second factor graph into a third factor graph, wherein the joining includes:
• unifying the third set of nodes in the first factor graph and the second factor graph;
• creating the third factor graph as an empty factor graph;
• and
• for each node in the third set of nodes:
• removing a factor parent of the node from the second factor graph;
• copying the node into the third factor graph;
• and
• setting a parent of the copied node to a parent of the node in the first factor graph;
• based on the third factor graph, selecting one or more computing resources;
• and
• deploying at least a portion of the cloud application to the selected computing resources.