On-the-fly reorganization of directed acyclic graph nodes of a computing service for high integration flexibility

Abstract

Systems and techniques that facilitate on-the-fly reorganization of directed acyclic graph nodes of a computing service for high integration flexibility are provided. In various embodiments, an input component can receive from a computing client a requested response time to be satisfied by a computing service. In various embodiments, a node property component can access an execution matrix. In various cases, the execution matrix can list execution properties of a plurality of nodes corresponding to the computing service. In various instances, the plurality of nodes can respectively perform a plurality of sub-operations associated with the computing service. In various aspects, the plurality of nodes can include one or more multi-level-of-execution subsets of nodes. In various cases, each multi-level-of-execution subset can contain at least two nodes that facilitate a same sub-operation at different levels of resource utilization. In various embodiments, a node identification component can identify a set of nodes from the plurality of nodes listed in the execution matrix, such that the identified set can include one node from each of the multi-level-of-execution subsets, and such that the execution properties of the identified set can collectively satisfy the requested response time. In various aspects, the node identification component can build for the computing client a workflow corresponding to the computing service based on the identified set.