Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/24355
Title: Elastic and flexible deadline constraint load Balancing algorithm for Cloud Computing
Authors: Kumar M.
Dubey K.
Sharma, Subhash Chander
Singh A.K.
Jimson J.
Published in: Procedia Computer Science
6th International Conference on Smart Computing and Communications, ICSCC 2017
Abstract: There are many load balancing algorithm has been proposed for cloud computing in last decade but none of algorithm provides the elasticity with load balancing. We proposed a cloud architecture that is capable of handling the maximum user request before meet to deadline and provides an elasticity mechanism with the help of threshold based trigger strategy. Computational results (Table 1 & Figs. 2-5) shows that develop algorithm decrease the makespan time and enhance task acceptance ratio more than 10% compare to min-min algorithm, 30% compare to First come first serve (FCFS) and shortest job first (SJF) in all condition. © 2018 The Authors. Published by Elsevier B.V.
Citation: Procedia Computer Science (2018), 125: 717-724
URI: https://doi.org/10.1016/j.procs.2017.12.092
http://repository.iitr.ac.in/handle/123456789/24355
Issue Date: 2018
Publisher: Elsevier B.V.
Keywords: elasticity
makespan time
scalability
task scheduling
virtual machine
ISSN: 18770509
Author Scopus IDs: 56243664000
56973782100
57221072360
Author Affiliations: Kumar, M., IIT, Roorkee, India
Dubey, K., IIT, Roorkee, India
Sharma, S.C., IIT, Roorkee, India
Corresponding Author: Kumar, M.; IITIndia; email: mohit05cs33@gmail.com
Appears in Collections:Conference Publications [PT]

Files in This Item:
There are no files associated with this item.
Show full item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.