27 Partial Critical Paths One of the most cited algorithms in this area has been proposed by Yu et al.: divide the workflow into partitions assign each partition a sub-deadline according to the minimum execution time of each task and the overall deadline of the workflow try to minimize the cost of execution of each partition under the sub- deadline constraints Performance Evaluation Comparison to Other Algorithms (1)
{}