Embedding Software Requirements in Grid Scheduling

Both grid and cloud applications may require specific softwares for their execution. Introducing such requirements into the DAG describing the dependencies among the tasks of an application leads to a combinatorial problem with numerous possibilities of modified DAGs. This paper introduces an algorithm to obtain a single DAG with the minimum possible makespan by reducing the need for data transfer over the network.