Following is the claim for this invention:-

1. In this invention we have a directed acyclic graph with a plurality of nodes and edges. The nodes represent tasks and edges represent dependency driven by the previous task result. Based on the previous task result, a job scheduler determines that one of the nodes or task is runnable and is scheduled for execution. Jon scheduler can schedule tasks for multiple such directed acyclic graphs and we may assign priority to each directed acyclic graph in case of shared resources to execute a given task. Note that for every directed acyclic graph of nodes or tasks, there is a root node or initial task to be executed which has no parent node or task. The above novel technique of task result based scheduling to execute the next task is the claim for this invention.