Issue No. 08 - Aug. (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.303
Saeid Abrishami , Ferdowsi University of Mashhad, Mashhad
Mahmoud Naghibzadeh , Ferdowsi University of Mashhad, Mashhad
Dick H.J. Epema , Delft University of Technology, Delft
Recently, utility Grids have emerged as a new model of service provisioning in heterogeneous distributed systems. In this model, users negotiate with service providers on their required Quality of Service and on the corresponding price to reach a Service Level Agreement. One of the most challenging problems in utility Grids is workflow scheduling, i.e., the problem of satisfying the QoS of the users as well as minimizing the cost of workflow execution. In this paper, we propose a new QoS-based workflow scheduling algorithm based on a novel concept called Partial Critical Paths (PCP), that tries to minimize the cost of workflow execution while meeting a user-defined deadline. The PCP algorithm has two phases: in the deadline distribution phase it recursively assigns subdeadlines to the tasks on the partial critical paths ending at previously assigned tasks, and in the planning phase it assigns the cheapest service to each task while meeting its subdeadline. The simulation results show that the performance of the PCP algorithm is very promising.
Grid computing, workflow scheduling, utility Grids, economic Grids, QoS-based scheduling.
M. Naghibzadeh, S. Abrishami and D. H. Epema, "Cost-Driven Scheduling of Grid Workflows Using Partial Critical Paths," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1400-1414, 2011.