An approximate ϵϵ-constraint method for a multi-objective job scheduling in the cloud

Cloud computing is a hybrid model that provides both hardware and software resources through computer networks. Data services (hardware) together with their functionalities (software) are hosted on web servers rather than on single computers connected by networks. Through a device (e.g., either a computer or a smartphone), a browser and an Internet connection, each user accesses a cloud platform and asks for specific services. For example, a user can ask for executing some applications (jobs) on the machines (hosts) of a cloud infrastructure. Therefore, it becomes significant to provide optimized job scheduling approaches suitable to balance the workload distribution among hosts of the platform. In this paper, a multi-objective mathematical formulation of the job scheduling problem in a homogeneous cloud computing platform is proposed in order to optimize the total average waiting time of the jobs, the average waiting time of the jobs in the longest working schedule (such as the makespan) and the required number of hosts. The proposed approach is based on an approximate @e-constraint method, tested on a set of instances and compared with the weighted sum (WS) method. The computational results highlight that our approach outperforms the WS method in terms of a number of non-dominated solutions.

[1]  Radu Prodan,et al.  Towards a general model of the multi-criteria workflow scheduling on the grid , 2009, Future Gener. Comput. Syst..

[2]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[3]  Marco Laumanns,et al.  An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , 2006, Eur. J. Oper. Res..

[4]  Alexander Zeier,et al.  A Linear Programming Approach for Optimizing Workload Distribution in a Cloud , 2011, CLOUD 2011.

[5]  Nik Bessis,et al.  Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm , 2013, Future Gener. Comput. Syst..

[6]  Nima Amjady,et al.  Multi-objective congestion management by modified augmented ε-constraint method , 2011 .

[7]  K. Atif,et al.  An Exact Multiobjective Epsilon-Constraint Approach for the Manufacturing Cell Formation Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[8]  Chris Develder,et al.  Multi-cost job routing and scheduling in Grid networks , 2009, Future Gener. Comput. Syst..

[9]  David A. Lifka,et al.  The ANL/IBM SP Scheduling System , 1995, JSSPP.

[10]  Demetrio Laganà,et al.  An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem , 2012, Comput. Oper. Res..

[11]  Rubén S. Montero,et al.  Scheduling strategies for optimal service deployment across multiple clouds , 2013, Future Gener. Comput. Syst..

[12]  Nima Amjady,et al.  Multi-objective electricity market clearing considering dynamic security by lexicographic optimization and augmented epsilon constraint method , 2011, Appl. Soft Comput..

[13]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[14]  Carlos A. Coello Coello,et al.  Epsilon-constraint with an efficient cultured differential evolution , 2007, GECCO '07.

[15]  Michel Gendreau,et al.  An exact epsilon-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits , 2009, Eur. J. Oper. Res..

[16]  Goutam Sanyal,et al.  Task-Scheduling in Cloud Computing using Credit Based Assignment Problem , 2011 .

[17]  Rajkumar Buyya,et al.  A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[18]  Lang Tong,et al.  Secondary Job Scheduling in the Cloud with Deadlines , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[19]  Ruay-Shiung Chang,et al.  Improving job scheduling algorithms in a grid environment , 2011, Future Gener. Comput. Syst..

[20]  Albert Y. Zomaya,et al.  Rescheduling for reliable job completion with the support of clouds , 2010, Future Gener. Comput. Syst..

[21]  Demetrio Laganà,et al.  An Approximate epsilon-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem , 2010, SEA.

[22]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[23]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .