Online scheduling of workflow applications in grid environments

Scheduling workflow applications in grid environments is a great challenge, because it is an NP-complete problem. Many heuristic methods have been presented in the literature and most of them deal with a single workflow application at a time. In recent years, several heuristic methods have been proposed to deal with concurrent workflows or online workflows, but they do not work with workflows composed of data-parallel tasks. In this paper, we present an online scheduling approach for multiple mixed-parallel workflows in grid environments. The proposed approach was evaluated with a series of simulation experiments and the results show that the proposed approach delivers good performance and outperforms other methods under various workloads.

Research highlights
► Most current workflow scheduling algorithms handle only one single workflow.
► A new approach for scheduling multiple online mixed-parallel workflows.
► The approach outperforms others for average makespan, average SLR and win (%).