Task Scheduling in Cloud Infrastructure

using Optimization Technique Genetic

Algorithm
Manju Arora Vivek Kumar Meenu Dave

IT ,JIMS,GGSIPU Quantum University JaganNath University

Delhi , India Roorkee, India Jaipur, India

manju.arora@jimsindia.org Vicechancellor@quantumuniversity.edu meenu.s.dave@gmail.com

cannot be applicable in dynamic world

computing. Our research aim is to consider the
Abstract- In cloud infrastructure, job
number of instruction execution of processor and
scheduling is the main critical issue to be solved
Grain_size of work of piece. Through the
.Effective and efficient task scheduling algorithm
simulation experiment the proposed algorithm
needed to met users requirement and resolve the
helps to improve the efficiency & effectiveness of
complexity in cloud environment, Data of
scheduling as well as to minimize the finished
resources are shared among several cloud users.
time in (ms).
Task scheduling comes under NP-complete
problem to apply appropriate scheduling policy KeywordsͲTask Scheduling; Genetic Algorithm; Cloud
Computing
is major concern. Many researchers consider
this problem with fixed length of time which
I. CLOUD COMPUTING projected the improved Genetic algorithm to
calculate the cost and the finish _time distribution of
It is the ocean of resources, services, applications,
task or load applications on different VMs is an
infrastructure etc these services can be available to
major concern field for engineering candidates.
their clients through internet. A new accessing
Heterogeneous users request enhance the
mechanism to access the resources, application,
complexity for finding the appropriate VM in
data, power, ,servers, signals and many more as per
minimum time period is a difficult task.
the user requirement at the cost effective manner.
Conventional scheduling techniques are problematic
This paradigm provides services beyond the
to minimize the finished time of piece of work.
imagination on -demand network access for their
Genetic algorithm is a kind of search problem in
customers. The motto of this approach is to satisfy
which after every iteration seed increased due to this
with no constraint to access the pool of resources.
the optimal results chances are brighter. In section 1
Cloud computing is triggered on the demand of
there is brief introduction of cloud section II
customers. The fundamental advantage of the cloud
associated with literature review, section III is the
paradigm is computation outsourcing, Quality of
projected work section IV describes the algorithm to
Services and Customer Satisfaction. Diuling was
cut down the finished time section V is simulated
proposed to get the optimal solution. Here, I
outcomes section VI conclusion

c
978-1-7281-6823-4/20/$31.00 2020 IEEE 788

Authorized licensed use limited to: Carleton University. Downloaded on October 26,2020 at 06:47:03 UTC from IEEE Xplore. Restrictions apply.
 II. LITERATURE SURVEY
K Loheswaran ,et al proposed an algorithm in
cloud environment. for task scheduling The author
proposed a hybrid optimization method which
combines the best feature of optimization algorithm
Genetic and elephant herd algorithm by
considering task scheduling performance
attributes are minimum retort time, makespan and
the cos t of using the resource[9].
Congcong Xiong, Long Feng and Lixion Chen
etproposed a model by adopting series of focused
parameters for the scheduling problem are
completed time, task operating cost and reliability
in cloud zone The author proposed an algorithm
and find a rule for crossover and mutation the two
genetic algorithm operator to improve the quality[
10]
Pradeep Kumar and Amandeep Verma .proposed a
new scheduling idea by amalgamation of three task
scheduling algorithm like Max-Min, Min-Min and
genetic algorithm. The author proposed an
improved GA for scheduling the tasks and to
measure their performance various attributes
involved are Makespan, Resource utilization .Using
improved GA author tried to minimize the response
time & Makespan efficiently than the standard
GA[3]
III. TASK SCHEDULING IN
CLOUD ENVIRONMENT
In cloud environment Genetic algorithm is
implemented to solve many NP-complete problem
like Job Shop scheduling etc .researchers suppose
that each task is executed with in the fixed time slot.
But this cannot be considered in dynamic world
where the number of users are exponentially
increased. Finish time of job is completely depend
upon the various attributes like MIPS of processor,
bandwidth Ram, heat dissipation of machine and
No. of processor in which the task has to be
2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)
Authorized licensed use limited to: Carleton University. Downloaded on October 26,2020 at 06:47:03 UTC from IEEE Xplore. Restrictions apply.
accomplished. In dynamic world scenario,
granularity of program and the speed of processor
which is measured in MIPS. From seeing through
the angle of business the aim is to earn maximum
profit and SLA should not be violated so that QOS
is maintained at customer perspective
Fig.1. The Projected representation of Scheduling
A. Projected Representation Explanation
The suggested model for scheduling in cloud
environment has revealed in above Fig 1.
Scheduling mainly comprised with series of
sections:
1) Feasible collection of cloud clients: Cloud end
users want the service and clients get it for this users
sent their request and looking for several types of
services. Each service has layers of QoS like the
resource usage cost, instruction cost, constraint for
the completion of of task during the specified time
as well as services have their precedence.
2) Job Categorization Section: This section accept
client task and apply preprocessing and
classification technique this section comprised with
two sub component
ĂͿWƌĞƉƌŽĐĞƐƐŝŶŐƐĞĐƚŝŽŶ͗dŚĞĂĐĐŽƵŶƚĂďŝůŝƚLJŽĨ
ƚŚŝƐƐĞĐƚŝŽŶŝƐƚŽĐĂůĐƵůĂƚĞƚŚĞƚĂƐŬǁŝƚŚĐĞƌƚĂŝŶ
ŵĞƚƌŝĐƐĂŶĚŵĂŝŶƚĂŝŶƚŚĞYŽ^͘dŚĞǀĂƌŝŽƵƐ
ŵĞƚƌŝĐƐĨŽƌƚŚĞĐŽŵƉƵƚĂƚŝŽŶŽĨƚĂƐŬĂƌĞƉůĂĐĞĚŝŶĂ
ǀĞĐƚŽƌƚĞƌŵĞĚĂƐůŝĞŶƚƚĂƐŬDĞƚƌŝĐǀĞĐƚŽƌ͕͘/ƚĂůƐŽ
ĐŝƉŚĞƌĞĚƚŚĞŵĞƚƌŝĐŝŶƚŽůŝĞŶƚdĂƐŬDĞƚƌŝĐƌƌĂLJ
;dDͿ͘
b) Task categorization, tries to select the
several jobs based on their metrics which
789
 was accepted from first sub section. Let us
take an example task can be selected into
several kind based on the service, like
application, network resources, hybrid
service etc Then it forward the piece of
work to the suitable scheduler for further
proceeding for scheduling into Job_Queue.
3) DC_ Controller: This unit which is accountable
for allocating user service. Data center mainly the
collection of devices servers and , virtual machines
with different capabilities
TABLE I. CLIENTS TASK METRIC ARRAY
A processing unit metric array (PUMA) is
associated with each processing element. PUMA
specifies the MIPS, Cost and utilization.
Correspondingly, for each storage unit, there may
be some memory unit metric Array (MUMA). Each
working section get a task from dispatcher queue,
which was schedule by scheduler using algorithm.
4) DC_ Manager: . It accumulate the current
PUMA from several processing unit, and apply
sorting for better scheduling, then this sorted
information is sent to respective assigner.
5) Task_ Assigner: This unit accepts the input
from preprocessing _unit and the DC_Manager.
So that the component came to know about the
users requirement and QoS is maintained
associated with CTMA .This section aware with
the processing unit capability so that SLA does
violate means no users return back without getting
the services The major concern of this component
is mapping between the task and the processing
unit optimally.
IV. IMPROVED SCHEDULING
ALGORITHM
An improved task scheduling algorithm can be
used to rectify the problem and find the solution
A. Ciphering: A standalone solution can be
found using Genetic algorithm on fixed
790 2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)
Authorized licensed use limited to: Carleton University. Downloaded on October 26,2020 at 06:47:03 UTC from IEEE Xplore. Restrictions apply.
size set of bits . To cipher that string in a
particular format for finding the all
possible solutions then genetic algorithm is
used to compute them
B. Deciphering: For deciphering the string
and calculating the fitness function the
projected algorithm is:
Seq 1: Fix D_Cost=0;
Seq 2: For int j =1 to n do step 3 to 5
Seq 3: Calculate Fin_time=(Grain _Size of piece of
work[j] ) / (MIPS_PUChromosome [j] );
Seq 4: Calculate Impedence_time = Fin_time ±
Cutoff-time;
Seq 5: D_Cost=D_Cost+(Grain _Size of piece of
work[j]j)*(Cost per instruction of PUChromosome
[j])+,PSHGHQFHBWLPH¨M
There are five phases for genetic algorithm
C. Phases
1) Initialization: Seeds here represented as
populations which are randomly generated
.Assume that the size of seed is Seed_Size means
population size. In genetic algorithm random
generation of seed increases the search space
region but getting the global optimal chances are as
GA algorithm basic nature is randomly generation
of population the which enhances search space
area.and getting mre opportunities for finding the
best optimal solution.
.The optimal solution can be achieved with full
assurance.
2) Selection Criteria: An appropriate parent is
chosen from the Seed_size before applying any
operator the following rules are projected as
Fitness _value= T_S + L (1)
Where,
 T_S =Time period of Surge .Here, time period of
surge is considering as a parameter for checking
whether the VM is able to survive after small-small
spikes.
L= Nature of load
C1: Find fitness value of each chromosome
(processing unit) in Fitness_value(t)using eq1. Find
the excellent two chromosome from the Seed_Size
for cross over, annotated as{c1,c2}.
C2: chromosome which was randomly selected
from Fitness_value(t), annotated as c3, one bit
replacement operator for mutation.
3) Rep_ Operator: Reproduction operator used
special operator : a) [1]Cross-over Cut ±and ±splice
b) Mutation simple one bit mutation is used. By
DSSO\LQJWKHRSHUDWRUVRIIVSULQJ¶VDUHJHQHUDWHG for
further proceeding. It means the PU are selected
among the Seed_Size
4) Change_Over͗KŶĐĞƚŚĞŽĨĨƐƉƌŝŶŐĂƌĞŐĞŶĞƌĂƚĞĚ
ƚŚĞ ĐŚĂŶŐĞͺŽǀĞƌ ƌƵůĞ ŝƐ ĂƉƉůŝĞĚ ǁŚĞƚŚĞƌ ƚŚĞ ŽůĚ
ŽŶĞŝƐďĞƚƚĞƌĨƌŽŵŶĞǁŽŶĞŽƌŶŽƚĨƚĞƌŐĞŶĞƌĂƚŝŶŐ
ŽĨĨƐƉƌŝŶŐƚŚĞǀĂƌŝŽƵƐůĂǁĂƌĞƵƐĞĚ͗
Law L1: If the set of parent chromosome
Fitness_value ”VHWRInew offspring chromosome
Fitness _value .It means the newly generated set is
better so it include in seed for the next generation
than old one. Due to this there is variation in
seed_size so the search space is large and better
chances for finding the optimal solution. Else apply
law L2.
Law L2: If there is no chromosome having
FitnessBYDOXH  •   Fitness_value of offspring or
already that chromosome exit in the population,
then leave that new offspring
5) Concluded condition: Computed results varies
after various iteration the process must be
summarized, the designed rules for stopping the
process:
2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)
Authorized licensed use limited to: Carleton University. Downloaded on October 26,2020 at 06:47:03 UTC from IEEE Xplore. Restrictions apply.
Rule T1: when maximum generation (M_GENR)
encounters END the process
Rule T2: s when the Fitness_value of each
chromosome is near to the previous computed
value terminate. and stop the iterations..
The main Improved Genetic algorithm (IGA) is
given below:
IGA Algorithm for Assignment
1: Fix Seed_SIZE= 10, generation g=l;
2:Generate Seed: S( g)= lnitialization()
3: Compute Fitness_ value for each processing
unit using eq(1);.
4: Find excellent parents c1, c2 out of the Seed g)
5: Generate new ones OS1, OS2 by applying with
a crossover(c1,c2) cut and .Splice operator.
6:x a mutation one bit interchange.(c3) operator is
used to Generate new ones OS1
7: Replace some chromosome from old seed s(g)
using law L1 and L2 to generate new population:
S(g+1).
8By applying Rule Tl and T2, if condition
matched result displayed, else GOTO 3.
V. Simulation Results and Discussion
The projected algorithm has applied in CloudSim
Intel Core i3 processor 4GB volatile memory and 32
bit windows .,The cloud user put forward their
requested job into Cloudsim..Every task in cloudsim
consider as cloudlet.Every cloudlet contain several
instructions.These cloudlet later on submitted to the
broker come across with virtual machines. Task
scheduling algorithm will execute in data centres.
Scheduler can be classify space share or time
shared.The experimental results shown that the
finished time by using I-GA is lesser than the
traditional GA
791
 TABLE II COMPARISON of FINISHED TIME with
EXISTING GA and IMPROVED GA ALGORITHM
ϳϬϬϬ

ϲϬϬϬ
Finished Time(ms) Ĩ
ŝ d ϱϬϬϬ
Tasks GA IGA Ŷ ŝ
ϰϬϬϬ /'
ŝ ŵ
20 499 250
Ɛ Ğ ϯϬϬϬ '
40 900 550

;
60 1800 1200 Ś ŵ ϮϬϬϬ
80 2500 1800 Ğ Ɛ
100 3700 2600 ϭϬϬϬ

Ϳ
Ě
Ϭ
ϮϬ ϰϬ ϲϬ ϴϬ ϭϬϬ
dĂƐŬƐ

Fig 2. Comparison of Finished Time(ms) using

GA and IGA

VI. CONCLUSION AND FUTURE
SCOPE
The proposed algorithm for various components of
GA helps for finding the minimum finished
time.This proposed algorithm has improved task
schedulig by considering the various attributes of
finished time , instruction count and cost . The
results has shown that the IGA is better than the GA.
Future scope is the binary fixed string ciphering
scheme is and it should be dynamic. If the string is
dynamic nature the more complexity is the next
scope area.Task scheduliing will give excellent
optimal result if the hybrid approach like ACO &
GA algorithm implemented.

[6] Dongsheng Li, Yixing Chen, and Hai, R.H ,Skew-Aware

REFERENCES Task Scheduling in Cloud IEEE,Service Oriented
System
ȏ1] Koza , and John R , Genetic Programming : On the Engineering (SOSE), IEEE 7th International
Symposium on, 2013
programming of computers by means of natural
selection MIT Press 1996.
[7] Dubey, S, Jain, V., and Shrivastava S, An innovative
[2] Kun Li ,Gaochao Xu, Guangyu Zhao, Yushuang Dong,
approach for scheduling of tasks in cloud environment
and Wang, ,Cloud Task Scheduling Based on Load
IEEE, Computing, Communications and Networking
Balancing Ant Colony Optimization IEEE,China grid
Technologies (ICCCNT), International Conference on,
Conference (ChinaGrid), 2011 Sixth Annual, 2011
2013
[3] Szabo, C, and Kroeger, Evolving multi-objective strategies
[8] Congcong Xiong, LongFengand and Lixioon chen, A
for task allocation of scientific workflows on public clouds
New Task Scheduling Algorithm Based on Improved
,IEEE, Evolutionary Computation (CEC), 2012 IEEE
Genetic Algorithm in Cloud Computing Environment
Congress on, 2012.
International Journal On Advances in Information
Sciences and Service Sciences on 2013.
[4] Pradeep Kumar and Amandeep Verma, Scheduling using
improved genetic algorithm in cloud computing for
[9] Arghavan Keivani and Jules-Raymond Tapamo ,Task
independent tasks ACM International Conference
Scheduling in Cloud Computing: A Review IEEE
Proceeding Series on 2012.
International Conference on Advances in Big Data,
Computing and Data Communication Systems
[5] Wei-Neng Che, and Jun Zhang, A set-based discrete PSO
(ICABCD) on,2016
for cloud workflow scheduling with user-defined QoS
constraints ,IEEE, International conference On Systems,
[10] Zhang, SiweiXie, Jinyua Wu, and Qi ,Applications
Man, and Cybernetics (SMC), 2012.
of Ant Colony Optimization Load Balancing in Cloud

792 2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)

Authorized licensed use limited to: Carleton University. Downloaded on October 26,2020 at 06:47:03 UTC from IEEE Xplore. Restrictions apply.
 Computing International Federation for Information
Processing Springer International Publishing pp. 400-
408, 2018. 
[11] Fang Yiqiu, Xiao Xia and Ge Junwei,Cloud Computing

Task Scheduling Algorithm Based On Improved Genetic
Algorithm ,IEEE 3rd Information Technology,
Networking, Electronic and Automation Control
Conference (ITNEC )2019

[12] Loheswaran, K., Palanivel Rajan, D., & Divya, P, Hybrid

optimization EHO-GA for task scheduling in cloud 
environments International Journal of Engineering and
Advanced Technology, on 2019

[13 Shudong Wang, Yanqing Li,Shanchen Pang, Qinghua

Lu, Shuyu Wang, and Jianli Zhao A Task Scheduling
Strategy in Edge-Cloud Collaborative Scenario Based on
Deadline Scientific Programming Journal Vol 2020 9
pages Published on 2020 

 

2020 Fourth World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4) 793

Authorized licensed use limited to: Carleton University. Downloaded on October 26,2020 at 06:47:03 UTC from IEEE Xplore. Restrictions apply.