Abstract: Aspects of the subject disclosure may include, for example, obtaining a graph, applying a first algorithm to the graph to obtain at least one elementary path, applying a rule to each of the at least one elementary path to obtain a respective sanitized elementary path, applying a second algorithm, based on the respective sanitized elementary path, to obtain a respective labeled elementary path, applying a third algorithm to the respective labeled elementary path to identify at least one pattern, mapping a respective pattern of the at least one pattern to a respective graph subsection, applying a fourth algorithm to the respective graph subsection to assign a weight to the respective graph subsection, and allocating a processing of a workload associated with the respective graph subsection to a resource based on the weight. Other embodiments are disclosed.

Abstract: Scalable task scheduling systems and methods for cyclic interdependent tasks using semantic analysis include, for a software application including a plurality of tasks which are cyclic interdependent tasks, segmenting the plurality of tasks into a task graph with vertices including the plurality of tasks and edges including interdependencies between the plurality of tasks; processing the task graph into a dependency graph which is a Directed Acyclic Graph (DAG); and causing execution of the plurality of tasks in a parallel manner based on the dependency graph.

Abstract: Scalable task scheduling systems and methods for cyclic interdependent tasks using semantic analysis include, for a software application including a plurality of tasks which are cyclic interdependent tasks, segmenting the plurality of tasks into a task graph with vertices including the plurality of tasks and edges including interdependencies between the plurality of tasks; processing the task graph into a dependency graph which is a Directed Acyclic Graph (DAG); and causing execution of the plurality of tasks in a parallel manner based on the dependency graph.