Using Time Discretization to Schedule Scientific Workflows in Multiple Cloud Providers

With the ever-increasing application demands, the execution of applications may require more resources than locally available. In this scenario, resources from multiple IaaS cloud providers can be leased to fulfill application requirements. In this paper we deal with the problem of scheduling workflow applications in multiple IaaS providers, where the workflow scheduler must determine on which computational resource each component of a workflow should be allocated in order to minimize the involved monetary costs. We propose the use of different levels of discrete-time intervals in linear programming to schedule workflows with deadline constraints in multiple cloud providers. Simulations shown that increasing the granularity level of time-discretization decreases the scheduler running time, although yet achieving good solutions.

[1]  Christine Morin,et al.  Using open standards for interoperability issues, solutions, and challenges facing cloud computing , 2012, 2012 8th international conference on network and service management (cnsm) and 2012 workshop on systems virtualiztion management (svm).

[2]  Luiz Fernando Bittencourt,et al.  Workflow scheduling for SaaS / PaaS cloud providers considering two SLA levels , 2012, 2012 IEEE Network Operations and Management Symposium.

[3]  Johan Tordsson,et al.  Cloud brokering mechanisms for optimized placement of virtual machines across multiple providers , 2012, Future Gener. Comput. Syst..

[4]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[5]  Nelson Luis Saldanha da Fonseca,et al.  Scheduling in hybrid clouds , 2012, IEEE Communications Magazine.

[6]  Rajkumar Buyya,et al.  SLA-based admission control for a Software-as-a-Service provider in Cloud computing environments , 2012, J. Comput. Syst. Sci..

[7]  Hlynur Stefansson,et al.  Production , Manufacturing and Logistics Discrete and continuous time representations and mathematical models for large production scheduling problems : A case study from the pharmaceutical industry , 2011 .

[8]  Rizos Sakellariou,et al.  Scheduling Data-IntensiveWorkflows onto Storage-Constrained Distributed Resources , 2007, Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07).

[9]  Jan Broeckhove,et al.  Cost-Optimal Scheduling in Hybrid IaaS Clouds for Deadline Constrained Workloads , 2010, 2010 IEEE 3rd International Conference on Cloud Computing.

[10]  Nilay Shah,et al.  Improving the efficiency of discrete time scheduling formulation , 1998 .

[11]  Christodoulos A. Floudas,et al.  Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications , 2005, Ann. Oper. Res..