Sie sind auf Seite 1von 5

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/327234224

Enhanced Round Robin Algorithm for Cloud Computing

Article  in  International Journal of Scientific Research & Management Studies · July 2018

CITATIONS READS

0 26

3 authors, including:

Hubert Shanthan
St. Joseph's College of Tiruchchirappalli
8 PUBLICATIONS   2 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Load Balanced Scheduling in cloud View project

All content following this page was uploaded by Hubert Shanthan on 26 August 2018.

The user has requested enhancement of the downloaded file.


ISSN 2319 – 1953
International Journal of Scientific Research in Computer Science Applications and Management Studies

Enhanced Round Robin Algorithm for Cloud


Computing
A.Stephen #1, BJ.Hubert Shanthan*2, Dr.D.Ravindran*3
#1, *2, *3
Department of Computer Science, St. Joseph’s College, Trichy, India
1
stephena003@gmail.com, 2ravindran.da@gmail.com, 3hshanthan@gmail.com

Abstract- Cloud computing is an emerging technology which  The algorithm has to minimize the turnaround time.
provides various services for cloud users. The requests for cloud Waiting time
services are increasing in the computerized world. Load  The time taken by a task which has been waiting in
balancing technique is used to provide better services to cloud the ready queue.
users and to utilize the cloud computing technology efficiently.
 The algorithm should minimize the waiting time.
Many algorithms are used to reduce the load in the cloud
environment. Round robin is one of the simplest algorithms used Response time
for load balancing technique. In this paper, enhanced round  The time taken to respond for a particular task by the
robin algorithm (RAST ERR technique) is proposed to minimize algorithm.
waiting time and turnaround time using average burst time. The  The algorithm must minimize the response time.
proposed algorithm outperforms the existing Round Robin and Make span
SRDQ algorithms.  The total time taken to complete a set of given tasks
 It is also called as overall completion time for the set
Key words – cloud computing, round robin, load balancing, of tasks.
waiting time, turnaround time, load balancing technique, RAST
 The algorithm ought to minimize the makespan.
ERR technique.
Round Robin [14]
I. INTRODUCTION
Round Robin is a well-known pre-emptive algorithm for
Cloud computing provides remote access to store and
load balancing in the cloud environment. A fixed time is
manage data in parallel and in distributed environment. Cloud
provided for each process to execute. The fixed time is called
service providers give services based on pay-as-you-go
Time Quantum (TQ). Once a process is executed for a given
system[1]. Cloud Service Providers (CSPs) are third parties
TQ, it is pre-empted (resumed) and the next process is
who are giving the cloud services with service level
executed for a given TQ. The rounds will be carried out till all
agreement (SLA). The cloud users should read the service
the process are completed. The states of pre-empted processes
level agreement carefully. If the SLA is not clear, it will lead
are stored in context switches.
to legal issues for the cloud users. Multiple virtual machines
This paper comprises of four main sections where, in
can be created on a single physical machine to provide better
section II, review of literature is presented. In section III the
service for the cloud users. A virtual machine is the simulation
methodology and proposed algorithm are explained. In section
of the physical machine. Load balancing is the technique used
IV result and discussion are presented and finally conclusion
to utilize cloud computing services efficiently [2]. Normally,
and future work are discussed in section V.
the load of a server in a cloud environment can be classified
into three categories namely under loaded, over loaded and II. LITERATURE REVIEW
equally loaded. The virtual machine is used less than its
Apoorva et al.[4] proposed a hybrid algorithm which
available capacity is called under loaded. The virtual machine
combination of ant colony optimization and bee colony
is used beyond its available capacity is called over loaded.
algorithm. The proposed hybrid algorithm had given better
The virtual machine is used with its available capacity is
result than the individual ant colony optimization algorithm.
called equally loaded. The cloud services could be better when
The hybrid algorithm gave better result for overall response
the load is equally loaded with virtual machines. The load of a
time of the system, processing time of the data center and
virtual machine should be equally distributed when a virtual
cost. And the proposed algorithm was simulated using the
machine is over loaded or under loaded.
cloud analyst tool.
The major load balancing metrics in cloud computing [3] Ramandeep et al.[5] introduced a load balancing algorithm
Throughput based on processing capacities of virtual machines in cloud
 Total number of tasks which complete execution per computing. The utilized power of each virtual machine was
unit time. calculated then the tasks were allocated to the virtual
 The algorithm should maximize the throughput. machines based on the processing capacity of the virtual
Turnaround time machines. After completing the jobs, the power of virtual
 The total time taken to execute a particular task in the machine was updated. The average of response time and
queue. turnaround time were calculated and simulated using

IJSRCSAMS
Volume 7, Issue 4 (July 2018) www.ijsrcsams.com
ISSN 2319 – 1953
International Journal of Scientific Research in Computer Science Applications and Management Studies
CloudSim. The proposed algorithm was compared with RR namely busy and idle. The states were used to identify
approach and Heurist approach. whether the virtual machines were available or not. The idle
Ramandeep et al.[6] proposed task based load balancing state was used to represent that the virtual machine was free to
algorithm for cloud computing by efficient utilization of VMs. use. The busy state was used to indicate that the virtual
The proposed dynamic load balancing algorithm gave better machine was still there to serve for the users.
result based on response time, turnaround time and total cost. Priyanga et al.[12] enhanced Round Robin algorithm for
The proposed algorithm consisted of three phases. The first load balancing in cloud environment. The major objective of
phase was the process of grouping of tasks and virtual enhancing the algorithm was to balance the load with different
machines based on the average value of length of the task. The data centers according to the tasks/cloudlets received and to
tasks which were greater than the average length were added handle the new cloudlets.
to the upper class tasks and other were added to a group of Praveen kumar et al.[13] proposed the new technique to find
lower class tasks. The same process was carried out for best time quantum for round robin scheduling algorithm. The
grouping of the virtual machines. Phase two had the technique was used to avoid frequent context switches.
responsibility to send a group of tasks to the virtual machines Samir Elmougy et al.[14] proposed a novel hybrid task
based on the upper class and the lower class concern with the scheduling technique using shortest job first and round robin
group. Phase three had the responsibility to the utilized power with dynamic variable quantum. The proposed technique
of VMs and submission of tasks to the virtual machines. relied on two basic keys. The first key was having a dynamic
Amanpreet Chawla et al.[7] proposed load balancing time quantum for balancing waiting time between short and
technique in cloud computing environment based on the long tasks. The second key involved in splitting the ready
packages. The motivation of the proposed technique was queue into two sub queues. Q1 was used for short tasks and
grouping of packages and performing the VM replication at Q2 was used for the long tasks. Two tasks from Q1 and one
the time of unavailability of the requested package. The task from Q2 were assigned to the resources. The CloudSim
proposed technique was used to minimize the execution time was used to simulate the proposed with few existing
and reduce cost for CSPs and users. algorithms. The proposed algorithm gave better result than the
Sathya sofia et al.[8] proposed task scheduling algorithm existing algorithm.
with multiple objective to reduce energy consumption and
makespan in cloud technology using NSGA-II. The ANN III.METHODOLOGY
algorithm is used to predict the VMs based on the The proposed enhanced round robin algorithm uses mean
characteristics of the tasks and features of available resources. for dynamic time quantum. The mean for the given tasks is
Energy consumption and makespan were reduced by the use calculated using burst time (execution time of a task) and set
of proposed work. as the time quantum for the first iteration in the algorithm. The
Santhosh et al.[9] proposed new task scheduling algorithm first iteration is done with initial burst time and mean. After
using Max-Min and enhanced Max-Min algorithm. The tasks the first iteration, the completed tasks will be removed from
were selected based on the availability of resources. The the queue otherwise it would proceed with the next iteration.
resources were grouped into two types based on their speed. The mean value is calculated using remaining burst time for
Jobs which had average length were submitted to the first the second iteration and the execution time of the tasks will be
group. And the jobs which had maximum length were the remaining burst time of each task. Then in the next
submitted to the second group. The experimentation was done iteration the mean is again calculated using remaining burst
using Workflow Sim toolkit. The algorithm gave better results time of the tasks and set as the time quantum for the
for scheduling tasks. concerned round. The process of finding mean and setting up
Yosef Berhanu et al.[10] proposed dynamic time quantum the time quantum keeps on repeating till there is no task in the
based on Round Robin CPU scheduling algorithm. The queue to be executed.The average waiting time of the given
algorithm was enhanced from improved Round Robin and tasks is computed by subtracting turnaround time and burst
Improved Round Robin Varying time Quantum (IRRVQ). The time of each task. Turnaround time of each task for each
experimental and simulation results showed that the proposed round is calculated by subtracting completion time of the task
algorithm performed better than Round Robin, Improved for each round and the arrival time of each task. The proposed
Round Robin, Improved Round Robin Varying time algorithm is distinguished with waiting time and turnaround
Quantum. The algorithm was compared with the existing time of the tasks.
algorithms based on waiting time, number of context switches
and turnaround time. The comparison result was given very Proposed Algorithm
clearly with appropriate tables and figures. Input: Ti where i = {0, 1, 2, 3, 4 …n-1}
Suresh kumar et al.[11] proposed virtual machine based Output: Executed tasks with minimized waiting time and
algorithm for random load balancing in cloud computing. The turnaround time.
proposed algorithm (VM ARLB) handled the requests Begin
randomly in the initial level. Then the requested jobs were Step 1: TQ = 0 // Time Quantum
allocated to the virtual machines using minimum completion CBT = 0 // Complete Burst Time
time. Two states were maintained for the virtual machines TBT =BT0 + BT1 + ……BTn-1

IJSRCSAMS
Volume 7, Issue 4 (July 2018) www.ijsrcsams.com
ISSN 2319 – 1953
International Journal of Scientific Research in Computer Science Applications and Management Studies
// ∑BTi Total Burst Time and remaining excution time of the T5 is also uptated for the
RBT = 0 //Remain Burst Time next iteration.
Step 2: Compute M for BTi of Ti // Mean
TQ = M Round 3:
Step 3: For i= 0 to n-1 TQ = 3.5
Excute Ti with M T5
If Ti becomes CTi //Completed Task 94.5 98
Thenremove CTi from the list Ti Waiting Time = W.T
Tn = Tn - Tcompleted Turnaround Time = T.A.T
Step 4: Compute M with RBT Completion time of Ti = C.T
// M = ∑RBT / Tn W.T = T.A.T – B.T
RBT = TBT – CBT T.A.T = C.T – A.T
TQ = M Table 2:Comparison of W.T
Step 5: Repeat Step 3 and Step 4 till Tn = 0 T RR SRDQ RAST RR
End T1 0 31.56 0
T2 5 0 12
IV.RESULT AND DISCUSSION T3 10 43.56 60.3
The algorithm is evaluated by using sample data set given in T4 5 8 34.3
the table 1. The table 1 contains burst time and arrival time of T5 20 57.8 65
the tasks. T6 25 18 58.6
Table 1: B.T and A.T of Tasks Avg 51.5 41.806 38.36
T B.T A.T
T1 12 0 The sample data set of waiting time for RR and SRDQ is
taken from [13] for giving comparison with proposed
T1 8 0 algorithm. RAST ERR waiting time taken from the above
T3 23 1 calculation.

T4 10 2
T5 30 3 Avg WT
T6 15 4 60

40
B.T – Burst Time
A.T – Arrival Time 20
Mean = TQ 0
TQ – Time Quantum
Calculating Mean and setting TQ:
M = ∑BTi / Tn RR SDRQ RAST

Round 1: Fig1: Comparison of average waiting time


TQ = 16.3
Figure 1 clearly depicts the comparison of the average
T1 T2 T3 T4 T5 T6
waiting time of the proposed algorithm with other algorithms.
0 12 20 36.3 46.3 62.6 77.6
In first round T1, T2, T4 and T6 are completed. Now, the
Table 3: Comparison of T.A.T
completed tasks are removed from the queue and the mean of
remaining burst time (RBT) of uncompleted tasks (T3, T5) is T RR SRDQ RAST RR
calculated to set TQ for the next round. And total number of T1 60 43.56 12
tasks (Tn) is also updated with Tn = Tn - Tcompleted
T2 38 8 20
Round 2: T3 88 89.7 83.3
TQ = 10.2
T4 48 16 44.3
T3 T5
T5 98 98.52 95
77.6 84.3 94.5
In the second round T3 is completed and removed from the T6 75 76.38 73.6
queue for the next iteration. And the total number of the task Avg 67.83 55.36 54.7

IJSRCSAMS
Volume 7, Issue 4 (July 2018) www.ijsrcsams.com
ISSN 2319 – 1953
International Journal of Scientific Research in Computer Science Applications and Management Studies
The sample data set of turnaround time for RR and SRDQ is [6] Ramandeep Kaur and Navtej Singh Ghumman,Task-Based
taken from [13] to compare the proposed algorithm with them. Load Balancing Algorithm by Efficient Utilization of VMs
Turnaround time for RAST ERR taken from the above in Cloud Computing, Advances in Intelligent Systems and
calculation. Computing, ISBN 978-981-10-6619-1, PP 55-62.
[7] Amanpreet Chawla and Navtej Singh Ghumman, Package-
Based Approach for Load Balancing in Cloud Computing,
Avg TAT Advances in Intelligent Systems and Computing, ISBN
978-981-10-6619-1, PP 71-78.
60 [8] A. Sathya Sofia and P. GaneshKumar , Multi-objective
Task Scheduling to Minimize Energy Consumption and
40 Makespan of Cloud Computing Using NSGA-II, Springer,
DOI 10.1007/s10922-017-9425-0, PP 1-23.
20 [9] Santhosh B and Manjaiah D H, A Hybrid AvgTask-
Min and Max-Min Algorithm For Scheduling Tasks In
0 Cloud Computing, 2015 International Conference on
Control,Instrumentation, Communication and
Computational Technologies (ICCICCT), DOI978-1-4673-
9825-1/15, PP 325-328.
RR SDRQ RAST [10] Yosef Berhanu, Abebe Alemu and Manish Kumar
Mishra, Dynamic Time Quantum based Round Robin CPU
Fig 2: Comparison of average turnaround time Scheduling Algorithm, International Journal of Computer
Applications , Volume 167, issue No.13, PP 48-55.
Figure 2 clearly depicts the comparison of the average [11] D.Suresh Kumar and E. George Dharma Prakash Raj,
turnaround time of the proposed algorithm with other VMARLB – Virtual Machine Based Algorithm for
algorithms. Random Load Balancing in Cloud Computing,
International Journal of Advanced Computing and
V. CONCLUSION Communication Systems (IJACCS), Vol.4 Issue.1, PP 1-4.
Round robin is a standard and traditional algorithm for [12] Priyanka Gautam and Rajiv Bansal, Extended Round
balancing the load in the cloud environment. Setting up the Robin Load Balancing in Cloud Computing, International
time quantum is the problem in round robin. In this paper the Journal of Advanced Computing and Communication
dynamic time quantum is calculated based on mean. The Systems (IJACCS), Volume 3 Issue 8, PP 1-6.
proposed algorithm gives better result than the standard round [13] D. Praveen Kumar, T. Sreenivasula Reddy, and A.
robin and SRDQ algorithms concerned with waiting time and Yugandhar Reddy, Finding Best Time Quantum for Round
Robin Scheduling Algorithm to avoid Frequent Context
turnaround time. In future, the algorithm can be enhanced by
Switch, International Journal of Computer Science and
setting up the better quantum time than the proposed
Information Technologies, Vol. 5 (5), PP 6750 – 6754.
algorithm. Various optimization algorithms can be combined
[14] Samir Elmougy, ShahendaSarhan and Manar Joundy, A
with Round Robin to calculate dynamictime quantum. novel hybrid of Shortest job first and round Robin with
dynamic variable quantum time task scheduling technique,
REFERENCES Journal of Cloud Computing:Advances, Systems and
[1] Priyanka Gautam and Rajiv Bansal, Extended Round Applications, DOI 10.1186/s13677-017-0085-0, PP 1-12.
Robin Load Balancing in Cloud Computing, International
Journal of Advanced Computing and Communication
Systems (IJACCS), Volume 3 Issue 8, PP 1-6.
[2] Dr.D.Ravindran, Ab Rashid Dar, Cloud Based Resource
Management with Autoscaling, IJSRSET, Volume 2, Issue
4, 2016.
[3] V.A. Jane, B.J. Hubert Shanthan and L. Arockiam, A
Survey of Algorithms for Scheduling in the Cloud: In a
metric Perspective, International Journal of Computer
Sciences and Engineering, Volume-6, Special Issue-2, PP
66 - 69, March 2018
[4] Apoorva Tripathi, Saurabh Shukla and Deepak Arora,“A
Hybrid Optimization Approach for Load Balancing in
Cloud Computing”, Advances in Intelligent Systems and
Computing, ISBN 978-981-10-3772-6, PP 197-206.
[5] Ramandeep Kaur and Navtej Singh Ghumman ,A Load
Balancing Algorithm Based on Processing Capacities of
VMs in Cloud Computing, Advances in Intelligent Systems
and Computing, PP 63-70, ISBN 978-981-10-6619-1.

IJSRCSAMS
Volume 7, Issue 4 (July 2018) www.ijsrcsams.com

View publication stats

Das könnte Ihnen auch gefallen