Generate a dependency graph using a topological sort algorithm for true dependency based scheduling. This can increase efficiency and would create true fair scheduling which solves the problem of skewing and queueing which is present now when one processor is much heavier to process than a parallel one in the graph.
Generate a dependency graph using a topological sort algorithm for true dependency based scheduling. This can increase efficiency and would create true fair scheduling which solves the problem of skewing and queueing which is present now when one processor is much heavier to process than a parallel one in the graph.