Issue No. 07 - July (2014 vol. 25)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2013.238
Rodrigo N. Calheiros , Department of Computing and Information Systems, The University of Melbourne, Australia
Rajkumar Buyya , Department of Computing and Information Systems, The University of Melbourne , Australia
The elasticity of Cloud infrastructures makes them a suitable platform for execution of deadline-constrained workflow applications, because resources available to the application can be dynamically increased to enable application speedup. Existing research in execution of scientific workflows in Clouds either try to minimize the workflow execution time ignoring deadlines and budgets or focus on the minimization of cost while trying to meet the application deadline. However, they implement limited contingency strategies to correct delays caused by underestimation of tasks execution time or fluctuations in the delivered performance of leased public Cloud resources. To mitigate effects of performance variation of resources on soft deadlines of workflow applications, we propose an algorithm that uses idle time of provisioned resources and budget surplus to replicate tasks. Simulation experiments with four well-known scientific workflows show that the proposed algorithm increases the likelihood of deadlines being met and reduces the total execution time of applications as the budget available for replication increases.
Data transfer, Scheduling, Cloud computing, Virtual machining, Schedules, Computational modeling, Delays
R. N. Calheiros and R. Buyya, "Meeting Deadlines of Scientific Workflows in Public Clouds with Tasks Replication," in IEEE Transactions on Parallel & Distributed Systems, vol. 25, no. 7, pp. 1787-1796, 2014.