Job Scheduling Algorithm for Cloud Computing Based on Particle Swarm Optimization

2013 ◽  
Vol 662 ◽  
pp. 957-960 ◽  
Author(s):  
Jing Liu ◽  
Xing Guo Luo ◽  
Xing Ming Zhang ◽  
Fan Zhang

Cloud computing is an emerging high performance computing environment with a large scale, heterogeneous collection of autonomous systems and flexible computational architecture. The performance of the scheduling system influences the cost benefit of this computing paradigm. To reduce the energy consumption and improve the profit, a job scheduling model based on the particle swarm optimization(PSO) algorithm is established for cloud computing. Based on open source cloud computing simulation platform CloudSim, compared to GA and random scheduling algorithms, the results show that the proposed algorithm can obtain a better solution concerning the energy cost and profit.

2015 ◽  
Vol 60 (4) ◽  
pp. 47-55
Author(s):  
Phan Thanh Toàn ◽  
Nguyễn Thế Lộc ◽  
Nguyễn Doãn Cường ◽  
Đỗ Như Long

Mobile Cloud Computing is an accumulation of both Cloud Computing and Mobile Computing. In cloud computing resources are deployed to a client on-demand basis. Mobile cloud computing is similar to cloud computing except that some devices involved in mobile cloud computing should be mobile. The demand for MCC has been increasing due to its scalability, reliability, high QOS (Quality Of Services), longer battery life, large storage capacity. Mobile cloud computing aims to take benefit of limited resources provided by a cloud provider. Task scheduling is a major concept involved in executing a task. In cloud computing job scheduling is required to execute each job without any deadlock. But the scheduling of dependent tasks is a problem in cloud systems. This problem is an NP-complete problem and can be solved using various heuristic and metaheuristic approaches. These approaches give high-quality solutions with reasonable execution time. Particle Swarm Optimization (PSO) is one of these meta-heuristic approaches that solve the problem of grid scheduling. In this paper, we address the problem encounter in dynamic scheduling. In dynamic scheduling, each task has its own deadline completion time. The task that arrived earlier in the system occupied the resources first and later arrived tasks are rejected because their execution time exceeds the deadline. In this paper, we proposed PSO with a variable job identifier that identifies independent and dependent tasks from the population. The particles are arranged with a grid dynamically and influence swarm to minimize execution time and waiting time simultaneously. The experimental studies show that the proposed approach is more efficient than other PSO based approaches as described in the literature


A vibrant on demand service of today’s era is cloud computing where one can utilize computer resources without indirect active management by user where one can use computing resources to achieve coherence in economic scale. Since cloud computing feel like Everything as a service so there should be highly scalable and reliable mechanisms to distribute the load evenly across the VMs evenly. Innumerable cloudlet mapping policies are presented in various research articles to achieve the high performance, better QOS and minimized task execution time but maximum are conventional approaches. No unconventional realistic scheduling algorithms is available which can schedule the tasks in heterogeneous manner. Since cloudlet scheduling is crucial metrics of cloud computing that has to be heightened by combining the different parameters. This paper tried to provide effectiveness and improvement in task scheduling using nature inspired Particle Swarm optimization (PSO) strategy. A powerful nature inspired load balancing mechanism is proposed in this paper which optimized makespan and throughput in environment of varying cloudlets and virtual machines results as compared to other conventional approaches. Proposed (EPSO) algorithm is with four scheduling policies namely FCFS, Round Robin (RR) and Shortest Job First (SJF) and get near twice good throughput percentage and minimized makespan in two different environments. Author used Cloud sim toolkit and some Open Source cloud packages to simulate the results of various scheduling components. Experimental results of various components are tested and simulated on java based CloudSim toolkit framework.


Sign in / Sign up

Export Citation Format

Share Document