International Journal of Scientific Research & Engineering Trends

Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X

Load Balancing of Tasks on Cloud Computing

Using Time Complexity of Proposed Algorithm
Smrithi V Prof. B.K. Tiwari
Dept. of Computer Science & Engg. Dept. of Computer Science & Engg.
Vindhya Institute of Tech.& Science Vindhya Institute of Tech.& Science
Indore, M.P., India Indore, M.P., India

Abstract- Cloud Computing is a developing field and lean toward by numerous one at current yet it's rage is part more rely
upon its execution which thusly is excessively rely upon the powerful booking algorithm and load adjusting . In this paper we
address this issue and propose an algorithm for private cloud which has high throughput and for open cloud which address the
issue of condition awareness likewise with execution. To enhance the throughput in private cloud SJF is utilized for planning
and to conquer shape the issue of starvation we utilize limited pausing. For stack adjusting we screen the heap and dispatch
the activity to the minimum stacked VM. To acquire advantage and to have open door for future upgrade out in the open
cloud condition cognizance is the key factor and for better execution and load adjusting likewise wanted. While stack adjusting
enhances the execution, the earth awareness increment the benefit of cloud suppliers.

Keywords- Private Cloud, Open Cloud, Virtualization, Stack Adjusting, Limited Pausing etc.

I. INTRODUCTION and so on.), regardless of whether oversaw inside or by

Distributed computing is the utilization of registering
assets (equipment and programming) that are conveyed
as an administration over a system (regularly the
Internet). The name originates from the utilization of a
cloud-formed image as a deliberation for the
unpredictable foundation it contains in framework
charts. Distributed computing endows remote
administrations with a client's information,
programming and algorithm. Distributed computing has
turned into a well-known trendy expression; it has been
generally used to allude to various advances,
administrations, and ideas.
1. Types of Cloud Computing
1.1 Public cloud- Public cloud applications, stockpiling,
and different assets are made accessible to the overall
population by a specialist organization. These
administrations are free or offered on a compensation
for each utilization show. By and large, open cloud
specialist organizations like Amazon AWS, Microsoft
and Google claim and work the framework and offer
access just by means of Internet (coordinate availability
isn't advertised).
1.2 Community cloud- Community cloud shares
foundation between a few associations from a particular
group with basic concerns (security, consistence, locale,
an outsider and facilitated inside or remotely. The
expenses are spread over fewer clients than an open
cloud (yet in excess of a private cloud), so just a portion
of the cost funds capability of distributed computing are
figured it out.
1.3 Hybrid cloud- Hybrid cloud is a synthesis of at
least two mists (private, group or open) that stay one of
a kind elements however are bound together, offering
the advantages of numerous organization models. By
using "half breed cloud" design, organizations and
people can acquire degrees of adaptation to non-critical
failure joined with locally prompt ease of use without
reliance on web network. Cross breed cloud design
requires both on-premises assets and off-site (remote)
server based cloud foundation. Cross breed mists do not
have the adaptability, security and sureness of in-house
applications. Half and half cloud gives the adaptability
of in house applications with the adaptation to internal
failure and versatility of cloud based administrations.
1.4 Private cloud- Private cloud will be cloud
framework worked exclusively for a solitary
association, regardless of whether oversaw inside or by
an outsider and facilitated inside or remotely.
Undertaking a private cloud venture requires a critical
level and level of engagement to virtualize the business
condition, and it will require the association to re-
examine choices about existing assets. When it is done
well, it can positively affect a business; however every

© 2018 IJSRET
1199
 International Journal of Scientific Research & Engineering Trends
Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X
one of the means in the undertaking raises security
issues that must be tended to with a specific end goal to
maintain a strategic distance from genuine
vulnerabilities.
2. Virtualization: It is an exceptionally valuable idea in
setting of cloud frameworks. Virtualization signifies
"something which isn't genuine", yet gives every one of
the offices of a genuine. It is the product usage of a PC
which will execute distinctive projects like a genuine
machine. Virtualization is identified with cloud, since
utilizing virtualization an end client can utilize
distinctive administrations of a cloud. The remote data
center will give distinctive administrations in a full or
halfway virtualized way.
3. Motivation: The utilization of distributed computing
is expanding step by step since now individuals the
utilization of advanced mobile phone and tablet PC are
getting to be regular. I
ability as they got on their stationary Desktop PC are
Laptop PC. In any case, these are little and have less
processing office so they can't run substantial
programming. Distributed computing is utilized here to
run the coveted programming on the versatile as an
administration over the Internet.
The necessities of association are extremely powerful
today and in the event that they go to buy everything
like framework, programming and stage they need to
spend a ton of cash each time and furthermore invest
energy for the setup. They need to complete a
considerable measure of documentation for keeping up
the rundown of merchant, permit key and so on. With
cloud condition associations need to pay for the asset
they need to utilize and they need to pay for as
indicated by roughly their utilization time. They not
need to invest any energy for the setup.
With distributed computing association need to stress
over the support since it is finished by the cloud
supplier. So agent can ponder their business.
RGPV entrance and MP Online Portal, IRCTC all are
the case of distributed computing which indicates how
the function wind up less demanding for both chief and
client with the utilization of distributed computing. In
any case, Cloud Computing execution have depend
significantly more on the booking algorithm and
legitimate load adjusting algorithm. Booking algorithm
will make such a succession of process, to the point
that throughputs are expanded and stack adjusting
algorithm separate the heap legitimately between every
single accessible asset. Distributed computing is a
parallel handling model where this issue is of
fundamental significance so they additionally have
significance. As cloud is a pay go-demonstrate, the
business execution should be quickened which is a
© 2018 IJSRET
1200
testing issue in the space. There is sure imperative
factor like;
Job Scheduling
Load Balancing
Resource Allocation
Along these lines, we have picked this theme to locate
a superior procedure to enhance the execution in
distributed computing condition.
4. Paper Organization: In segment two we survey the
past work of different creator of same field. We examine
about their work and furthermore talk about their
constraints. In segment three we propose our algorithm
which is two sections. In First part we examine
algorithm of private cloud and in second part we talk
about algorithm for open cloud. We likewise assess the
execution of algorithm by computing their opportunity
multifaceted nature. We additionally put the after-effect
of our work. In segment four we finish up our work and
examine about the future work.
II. SURVEY OF PRIOR WORKS
Creator of [1] recommends an algorithm which covers
condition cognizant issue for booking of HPC
applications on disseminated cloud focuses. Creator
think about demonstrates that at exhibit the carbon
outflow of ICT industry is getting to be equivalent to the
carbon discharge of aeronautics industry. Presently a
portion of the legislature forcing a carbon emanation
restrict over the ICT business.
So if cloud suppliers not consider this issue they are not
ready to broaden their framework in future. For
condition cognizant the creator considers the carbon
outflow rate of server farm. Carbon outflow rate of
various server farms is diverse so booking algorithm
plan the activity to a server farm which has least carbon
discharge rate. Creator likewise takes care of the issue
of expense which will expand the benefit of cloud
supplier. For cost he considers execution value,
versatility cost and information exchange cost. On base
of these data creators recommend algorithm which will
discover server farm which boost the benefit from the
server farm match of least carbon rate.
Creator's algorithm is of HPC application where
applications have the need of in excess of one VM.
After choice of a server farm planning algorithm select
the VM as per the prerequisite. Creator's answer is
useful for condition cognizant however he not cover the
issue of load adjusting to pick the VM frame a server
farm which is additionally a noteworthy issue at show
time.
 International Journal of Scientific Research & Engineering Trends
Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X
Creator of [2] has pondered the factor that impacts the
activity dismissal in the cloud condition. He
demonstrates the examination of SJF and R-R booking
algorithm in top hour implies when no of landing of
employment is high. Creator recommends R-R planning
for booking and SJF for stack adjusting and process
relocation to maintain a strategic distance from halts.
Creator appears in the outcome that in crest hour SJF
has better execution in work dismissal issue. SJF has the
issue of starvation so long employment has high
turnaround time. His examination demonstrates that on
account of distributed computing the quantity of
employment dismissal ought to be less on the grounds
that cloud is pay-go display so if client's activity is
dismissed then the component of distributed computing
would not draw in the client Creator really demonstrates
an examinations amongst SJF and RR booking.
however he not recommend any method for changing
the algorithm from SJF to RR and shape RR to SJF
writer just says in regards to the relocation of
procedures for stack adjusting yet how movement will
happen and what is the strategy for knowing over-
burden VM . Creator has consider the factor that impact
the activity dismissal in cloud condition and he propose
the RR algorithm for booking and SJF planning for
stack adjusting yet R-R planning has a ton of overhead
of seizure and SJS has starvation issue.
Creator of [6] proposes an answer for overseeing huge
picture accumulations. Creator displays a distributed
computing administration and its application for the
capacity and investigation of extremely huge picture.
His answer permits that an information picture can be
isolated into various sub-pictures that can be put away
and prepared independently by various operators in the
framework, encouraging handling substantial pictures in
a parallel way. His motivation is to make a distributed
computing administration fit for putting away and
investigating extensive picture datasets.
Creator creates distributed computing administration
model for putting away and investigating pictures.
Sufficient parallelism and workload adjusting of our
dispersed framework is essential element to guarantee
an enhanced execution. Creator really ponders genuine
use of expansive picture datasets and parallelism will
truly enhances the execution such application. His
answer isolate expansive picture into sub-pictures and
enhance the execution by parallelism. Creator not covers
issue of condition and cost and furthermore of load
adjusting.
Creator of [8] propose the mathematical planning of the
procedures since he found that some unique procedures
have distinctive requirement for the execution so he
© 2018 IJSRET
1201
recommend the algorithm which demonstrate the
procedure asset request as utility capacity . He
recommends that coveted asset request ought to be in
the frame delicate limitation implies it isn't fundamental
that procedure can execute with the coveted asset. As
cloud assets and applications develop more
heterogeneous, allotting the correct assets to various
occupants' exercises progressively relies on
understanding tradeoffs with respect to their individual
practices. One may require a particular measure of
RAM, another may profit by a GPU, and a third may
profit by executing on an indistinguishable rack from a
fourth. Creator alter the current approach where asset
buyers needs to indicate at least zero hard imperatives
with each demand, in light of some foreordained trait
construction comprehended by the bunch scheduler .
Such imperatives could fill in as a channel on the
arrangement of machines, empowering recognizable
proof of the subset that is appropriate for the comparing
demand. Yet, this approach overlooks an essential issue:
as a rule, the coveted machine qualities give advantage
however is not required.
This paper proposes a particular approach for obliging
delicate requirements, and in addition hard imperatives
and general machine heterogeneity. In this model, each
activity submitted for preparing is joined by an asset ask
for, which is communicated as utility capacities as
mathematical articulations demonstrating what
advantage would be acknowledged if specific assets
were allocated to it. Creator proposes arithmetical
planning on account of heterogeneity in cloud condition.
He recommends that procedure needs to express their
asset prerequisite in delicate imperative and
mathematical booking choose that procedure must be
executed on which VM. In his planning utility capacity
express all alternative in arrangement which will have a
great deal of overhead.
III. Algorithm of Load Balancing on Cloud
As we have perused that there are four sorts of
organization Model in distributed computing.
Private Cloud
Public Cloud
Hybrid Cloud
Community Cloud In our paper we propose algorithm
of following two sorts of model 1) Private Cloud, 2)
Public Cloud
 International Journal of Scientific Research & Engineering Trends
Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X
1. Private Cloud Algorithm : The normal contrasts
between circulated registering and distributed
computing are-
As we realize that appropriated framework is
straightforward means client is chipping away at the
PC as he have every one of the assets on that PC yet he
really have just little piece of it. In distributed
computing client have nothing on his machine and he
needs to get to everything in no transparent way.
For circulated framework we not need to interface
ourselves to the system or interne however for
distributed computing we need to associate ourselves
to the system (for private cloud) and to the web (for
pubic cloud) to get to the administrations.
2. Important Point of Scheduling In Private Cloud
1. Jobs are conceded just of the system so there are less
number of employments looks at to open cloud so
some overhead passable in planning.
2. Higher throughput is essential prerequisite on the
grounds that if this isn't the situation then it is
valuable to change to higher equipment and
programming cost implies not to utilize distributed
computing.
3. SJF planning has the higher throughput so this is
better choice of booking in private cloud.
4. With SJF a few occupations may endure due
extensive burst time this is called starvation. To defeat
frame this issue limited holding up must be there
which present a tag with each arrived and diminished
naturally with each fresh introduction of process and
when it will reach to zero then that activity must be
executed
5. In distributed computing there is number of processor
is accessible for the execution so a legitimate load
adjusting is likewise compulsory for this there ought
to be a typical line for all employments touched base
from any client and cloud supervisor can designate
the activity to the sit out of gear VM (Virtual
Machine).
6. On abridging we can state that :
On landing each procedure is kept on a typical line
this line is kept up by the cloud administrator which is
running on the server machine which have the control
over all assets.
Cloud supervisor check for the sit VM and any VM
send a flag that it has completed the execution of
current dispensed occupation at that point cloud
trough needs to choose a procedure for execution.
Cloud oversee first watch that is there is any activity
with d)Zero label which is doled out to the activity on
its entry for guaranteeing limited pausing if there is
any procedure then that will be chosen and dispatched
to the slightest stacked Virtual Machine (VM).
© 2018 IJSRET
1202
If there is no procedure with zero labels at that point
cloud chief select the procedure with minimum burst
time and apportion that activity to the VM.
3. Algorithm for Private Cloud
Database of VM is kept up at cloud chief who have 4
fields.
VM id
Num field demonstrate the quantity of process it can
process.
Pacer Number of procedures as of now distributed to
the VM.
load per demonstrate stack percent on the VM On
PCB an additional label field is utilized for the bound
waiting.0 Ready line is kept up by cloud director
which contain the rundown of all arrived
employments. Number of process is showing by
p_num.
4. Algorithm
Step I -> at first all VM have the zero label an
incentive in the database of VM and an
incentive in Num field.
Step II -> While [queue]! = NULL
Step III -> if tag [process] ==0 at that point, step V
else step IV
Step IV -> Select min burst [process] frame prepared
line
Step V -> measure [vm_table] = n
Step V -> Select min load per[VM] (least loaded and
if More than one then least hop time and
VM capacity indicate by the num field also
more than the request size) VM from the
VM pool and p_cur[VM] = p_cur[VM] +1;
Load per [VM] =
p_cur[VM]*100/num[VM]
Step VI -> remove the selected process form queue
and Dispatch it to selected VM p_num=
p_num -1;
Step VII -> if new process is arrived add to the tail of
the Queue and p_num= p_num + 1;
Step IX -> While i<p_num
Tag [process] =tag [process] -1;
If tag [process] =0 then
Move this process at the head of the queue
Repeat
Step X -> goto step II
Step XI -> Stop
5. Time Complexity of Algorithm
Let n forms touches base in unit time then n time tag
[process] of prepared line process is refreshed until the
 International Journal of Scientific Research & Engineering Trends
Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X
point that it will reach to zero let bound holding up tag
is m which is not as much as n and let number of
existing procedure in the prepared line is p and number
of process leaves the prepared line is r then. Let number
of VM is s. Time required to refresh tag [process] = p
(Number of Existing procedure in the line) + n (Number
of procedures in the line) - r (Number of procedures
leaves the line) Time required to discover min. burst
process = [p (Existing procedure in prepared line) + n
(process touched base in the prepared line) r (process
leave the queue)] * r Time required to locate the
slightest stacked VM =S Time required to refresh the
load per[VM] = r (Number of process leaves the
prepared line)
Add up to time = p + n r + (p + n r) *r + s + r = p +
n + p*r + n*r r2 + s
= p (r+1) + n(r + 1) r2 + s
= (p + n) (r+1) r2+ s; n and r >> s
So Total time = (p + n) (r + 1) – r2
p is around equivalent to n
At that point add up to time = 2n (r+1) r2
Case I n >> r
It implies that number of occupation arrived is
considerably more than number of employment leaved
at that point
Add up to time = O (n2)
Case – II n is roughly equivalent to r It implies that
number of occupation arrived is around equivalent to
number of occupation leaved at that point add up to
time = 2r (r+1) r2 = 2 r2 + 2r r2
Add up to time = O (r2)
6. Algorithm for Public Cloud
These are some vital purpose of planning in broad
daylight Cloud:
1. Cloud figuring is pay-go show so number of
employment rejected must be less so booking must
think about this issue.
2. Cloud supplier needs to acquire benefit so planning
algorithm must build the benefit of cloud supplier.
3. Algorithm must be condition cognizant in light of the
fact that Carbon outflow rate of ICT (Information and
Communication Technology) industry is presently
around equivalent to the flight business so
government force carbon emanation restrict. In the
event that booking algorithm not cover this issue at
that point cloud supplier are not capable grow their
framework.
4. Environment cognizant likewise give the advantage of
point (1) and (2) in light of the fact that if cloud give
has more foundation at that point number of
employment dismissal is additionally low and to take
care of the more demand of cloud client cloud
© 2018 IJSRET
1203
supplier needs to expand framework which thus
additionally increment their benefit.
5. Load adjusting must be there so process must be
moved shape over stacked VM to less stacked VM
inside server farm. This thing won't done ceaselessly
mean it will done on occasional base so it won't
expand all the more overhead. Cloud administrator
intermittently screens the status of the VMs for the
appropriation of the heap, if an overloaded VM is
discovered then the cloud oversee moves the heap of
the over-burden VM to the underutilized VM.
7. Algorithm
A client present his prerequisite for an application j as a
tuple ( dj, eji , (DT)j ) where dj is the due date to finish
application j, eji is the application execution time on the
server farm I. , (DT)j is the extent of information to be
exchanged.
Here (CO2E)ij = riCO2 x Eij Where riCO2 is the carbon
outflow rate of server farm I and (Profit)ij = (Profit
Exec)ij + (ProfData)ij implies (Profit Exec)ij = ejipc-pie
x Eij
Here pc CPU execution cost foot preparing time pie is
the power value (ProfData) ij = (DT) j x (pDTU piDT)
Here pDTU is the dara exchange cost for the
transfer/download piDT is the information exchange
cost for transfer/download Cloud supplier needs to pay
server farm I the vitality cost and information exchange
cost contingent upon its power value pie and
information exchange cost for piDT transfer/download.
Cloud supplier at that point charges foxed cost to the
client for executing his application in light of the CPU
execution value pc and information exchange value
piDT for the handling time and transfer/download
separately.
Be mapped discover the data enter of which the carbon
emanation is the base means least (CO2E) ij among
every one of the server farms which can finish the
application by its due date.
Step II -> Among all the application server farm sets
found in Step I discover the combine that outcomes in
the greatest benefit implies most extreme (Prof)ij.
Step III -> once a server farm a chose then it will put
in the line of demand. Cloud administrator in the server
farm keep up an information structure involving the Job
ID, VM ID and VM Status. Cloud director parses the
information structure for designation to recognize the
slightest used VM. On the off chance that accessibility
of VMs is in excess of one then the VM with slightest
bounce time is considered.
 International Journal of Scientific Research & Engineering Trends
Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X
Step – IV -> Cloud supervisor refreshes the information
structure naturally after designation.
Step – V -> Cloud supervisor intermittently screens the
status of the VMs for the conveyance of the heap, if an
over-burden VM is discovered then the cloud chief
relocates the heap of over-burden VM to the
underutilized VM. On the off chance that more than one
is accessible then VM with slightest bounce time is
considered.
Step – VI -> Cloud chief updates the information
structure by changing the passages.
Step – VII -> on landing of next process go to Step – I
Step – VIII -> Stop
8. Time Complexity of Proposed Algorithm
Let n forms lands in unit time at that point there are d
server farm and all things considered there are v number
of VM in server farms. Time required to pick least
carbon discharge and max benefit server farm on most
pessimistic scenario = nd2
Time required to pick a VM is = nd * v Time required
for stack adjusting on a normal = d*v*n Total time =
(nvd + nvd) normally n (Number of procedures arrived)
and v (normal number of VM in server farm) is
significantly more than warmth of number of server
farm implies, n and v >>d So, Total time = nv + nv =
2nv
Add up to time = O (n2).
IV. CONCLUSION AND FUTURE WORK
In this paper we created algorithm for private cloud and
open cloud to deal with stack adjusting with viable
planning algorithm. For private cloud we create
algorithm which utilize SJF with starvation and
furthermore think about the issue of load adjusting.
After-effect of private cloud demonstrates that less
stacked VM is decided for the execution of client ask for
which will thusly build the throughput of private cloud
for open cloud we create algorithm which cover the
issue of condition and benefit augmentation with stack
adjusting.
Result demonstrates that carbon outflow rate not shift
excessively with the expansion or reduction in the
landing rate of procedures. Add up to benefit is
expanded with entry rate up as far as possible after that
it begins diminishing which will expanded with
additional setup and cloud supplier may go for that on
the off chance that they have the spending implies they
not need to confront lawful issue because of carbon
discharge. Private cloud work is useful for the
association who needs to make its own particular setup
to give distributed computing to its client. Open cloud
© 2018 IJSRET
1204
work is useful for the cloud supplier who need condition
cognizant arrangement and after that need to amplify
their benefit.
Later on we additionally cover the issue of delicate
imperative in condition cognizant arrangement of open
cloud. Openly cloud our algorithm right off the bat a
couple of server farm is chosen on the base of condition
cognizant. After that a server farm is picked on the base
of benefit expansion. Delicate requirement determine
the procedure asset require in a way that if assets are
accessible they will be distributed to the procedure. This
will additionally expand the execution of cloud
framework.
REFERENCES
[1]. Saurabh K Garg,Chee Shin Yeo, Arun
Anandasivam, Rajkumar Buyya “Environment –
Conscious Scheduling of HPC application on
distributed Cloud – oriented centers”,
ScienceDirect, May 2010.
[2]. Rashid K S and Suma V and Vaidehi M “Factors
Influencing Job Rejection in Cloud Environment
“IJC May 2012.
[3]. Rashid K S and Suma V and Vaidehi M “Enhanced
Load Balancing Approach to avoid Deadlocks in
Cloud” IJCA-ACCTHPCA, June 2012.
[4]. Gabriel Mates, Wolfgan Entsch, Calvin J Ribbons
“Hybrid Computing – Where HPC meets grid and
Cloud Computing” Science Direct November 2010.
[5]. Tadapaneni, N. R. (2018). Cloud Computing:
Opportunities And Challenges. International
Journal of Technical Research and Applications.
[6]. Raul Alonso-Calve, Jose Cresco, Miguel Garcia-
Removal, Alberto Anita and Victor Major “On
Distributing load in cloud computing: A real
application for very large image datasets”, Science
Direct 2010.
[7]. Ashram Zia & Muhammad Need Ahmad Khan
“Identifying Key Challenges in Performance Issues
in Cloud Computing”, IJMECS 2012.
[8]. Alexei Tomato, James Cigar and Michael, A
Couch, “Algebraic Scheduling of Mixed Workloads
in Heterogeneous Clouds”, ACM 2012.
[9]. Monir Abdullah , Mohamed Othman “Cost – Based
Multi – Quos Job Scheduling using Divisible Load
Theory in Cloud Computing”, Science Direct 2013.
[10]. R. Santosh and T. Ravichandran “Non-Pre-emptive
on- Line Scheduling of Real-Time Services with
Task Migration for Cloud Computing”, EJSR 2012.
[11]. Soma Ray and Ajanta De Starker “Execution
Analysis of Load Balancing Algorithm in Cloud
Computing Environment in International Journal on
Cloud Computing: Service and Architecture
(IJCCSA)”, Vole 2, Oct 2012.
 International Journal of Scientific Research & Engineering Trends
Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): 2395-566X

[12]. K. L. Girds, A Shaking nargunam, “CHPS in Cloud

Computing Environment “ in International Journal of
Engineering and Technology (IJET) October Nov
2012.
[13]. Tadapaneni, N. R. (2016). Overview and
Opportunities of Edge Computing. Social Science
Research Network.
[14]. Hoarser and Dr. Aura Shah “A Modified Genetic
Algorithm for Process Scheduling in Distributed
System”, IJCA, 2011.
[15]. Engraver China and Anjou Baal, “A Survey of
Various Workflow Scheduling Algorithm in Cloud
Environment”, NCICT 2011.
[16]. Anthony T. Volte, Toby J. Volte, Robert Elsenpeter,
“Cloud Computing a Practical Approach”, TATA
McGraw HILL Edition2010.
[17]. Zhang. Y and Zhou Y “Transoms: A Transparent
computing-based operating system for the cloud”.
[18]. Weise Lin, James Z. Wang, Chen Liang, Day I “A
Threshold – Based Dynamic Resource Allocation
Scheme for Cloud Computing” Science Direct 2011.
[19]. Chauhan, S., & Vermani, S. (2016). Shift from Cloud
Computing to Fog Computing. Journal of Applied
Computing, 1(1), 25-29.

© 2018 IJSRET
1205