Hybrid-Computing Resource Optimization

Arranging computational sub-tasks in a hybrid-computing environment is provided. The method comprises receiving input of a number of nodes, wherein each node represents a computational sub-task, and wherein the nodes are grouped into different sets according to differing computing resources used by the nodes. A computational objective is also received as well as initial data inputs and desired final outputs. A directed graph network is generated comprising the nodes and directed edges connecting the nodes. An optimization problem is then solved to determine a best path through the directed graph network for deriving the desired final outputs from the initial data inputs according to the computational objective. The best path comprises a subset of nodes and directed edges within the directed graph network. The best path to achieve the computational objective and estimated computational resources required for the best path are output to a user.