Dependency Based Scheme for Load Balancing in Cloud Environment
1Neethu.M.S, PG Student, Department of Computer Science & Engineering, LBSITW, Thiruvananthapuram (Kerala), India.
2Jayalekshmi.S, Associate Professor, Department of Computer Science & Engineering, LBSITW, Thiruvananthapuram (Kerala), India.
Manuscript received on 13 August 2016 | Revised Manuscript received on 20 August 2016 | Manuscript Published on 30 August 2016 | PP: 141-147 | Volume-5 Issue-6, August 2016 | Retrieval Number: F4703085616/16©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Cloud computing provides an opportunity to dynamically share the resources among the users through virtualization technology. In this paper, a scheme for load balancing is proposed on the basis of dependency among the tasks. CMS consists of three algorithms including Credit-based scheduling for independent tasks, Migrating Task and Staged Task Migration for dependent tasks. The Credit-based method is used for scheduling the independent tasks considering both user priority and task length. Each task will be assigned a credit based on their task length and its priority. In the actual scheduling of the task, these credits values will be considered. Task Migration algorithm is used to guarantee balancing of loads among the virtual machines. Task migration is done such that the tasks gets migrated from heavily loaded machines to comparatively lighter ones. Thus, no rescheduling is required. For dependent tasks, the dependencies between tasks are considered and the technique termed as data shuffling is used. In data shuffling, a job is divided into several tasks according to the execution order. The method used here is that the tasks in one stage run independently, while the tasks in different stages must be executed serially. Finally the system is simulated and experiments are conducted to evaluate the proposed methods. This work also concentrates on a simulated study among some common scheduling algorithms in cloud computing on the basis of the response times. The algorithms being compared with the work includes: Random, Random Two Choices (R2C) and On-demand algorithms. The evaluations demonstrate that Credit-based scheduling algorithm significantly reduces the response time.
Keywords: Load Balancing, Virtual Machine, Task Scheduling, Dependency.
Scope of the Article: Machine Design