Professional Documents
Culture Documents
Computing Environment
Sagnika Saha, Souvik Pal and Prasant Kumar Pattnaik
1 Introduction
The scheduling of tasks successfully has turned out to be one of the problem areas
in the eld of Computer Science. The aim of the scheduler in a cloud computing
environment is to determine a proper assignment of resources to the tasks to cease
all the tasks received from the users. Vast numbers of users submit their tasks to the
S. Saha (&) S. Pal P.K. Pattnaik
School of Computer Engineering, KIIT University, Bhubaneswar, India
e-mail: sagnika10@gmail.com
S. Pal
e-mail: souvikpal22@gmail.com
P.K. Pattnaik
e-mail: patnaikprasantfcs@kiit.ac.in
Springer India 2016
H.S. Behera and D.P. Mohapatra (eds.), Computational Intelligence
in Data MiningVolume 1, Advances in Intelligent Systems
and Computing 410, DOI 10.1007/978-81-322-2734-2_39
387
388
S. Saha et al.
2 Related Work
The Scheduling of task in the cloud has been a well known issue in both academic
and industrial spheres. A good scheduling algorithm wont just raise the utilization
of resources additionally satisfy the requirements of the users. It is important to deal
with these resources in such a way that resources are properly used and the waiting
time for resources decreases. For proper scheduling of tasks many algorithms are
available as well as methods in cloud computing. The following identies some of
the related works done with scheduling and queuing model:
Snehal Kamalapur, Neeta Deshpande in paper [1] proposed a GA based algorithm for process scheduling. GA is used as a function of process scheduling to
produce effective results. The proposed technique gives better results against other
traditional algorithms.
Luqun Li in paper [2] presented a non pre-emptive priority M/G/1 queuing
model after analysing QoS requirements of Cloud Computing users jobs. The goal
is to nd the optimal result for each job with different priority.
Chenhong Zhao, Shanshan Zhang, Qingfeng Liu, Jian Xe, Jicheng Hu in paper
[3] focused on an optimization algorithm in light of Genetic Algorithm which will
schedule tasks in adaptation to memory constraints and performance.
Yujia Ge, Guiyi Wei in paper [4] displayed a new task scheduler taking into
account Genetic algorithm for the Cloud Computing Systems in Hadoop
MapReduce. After evaluation of the entire tasks in the queue, the proposed technique makes a new scheduling decision. Genetic Algorithm is applied as an optimization method for the new scheduler. The performance analysis demonstrates
that the new scheduler attains a better make span for tasks against FIFO scheduler.
389
390
S. Saha et al.
3 Proposed Model
The focus of the system is to have a maximum usage of resources and to decrease
the waiting time and queue length of the entire system. The proposed model of
scheduling environment is demonstrated in Fig. 1. Assume Cloud users send n
number of tasks {T1, T2, T3Tn} for the resources and these requests from various
users are at rst stored into the buffer. The controller then apportions these tasks to
the proper resources. The task queue is structured by mapping the tasks to the
resources. In this paper, FCFS and GA are used as the scheduling algorithms and
these algorithms are applied over the task queue. The aim is to discover the right
scheduling order that lessens the waiting time of the system. Next the scheduling
orders are recovered both for FCFS and GA that minimize the waiting time. The
queuing model is then applied over the scheduling orders that are retrieved through
FCFS and GA algorithms. It is used to minimize the queue length as well as waiting
time of the tasks. It is found that GA offers better results against FCFS.
391
The input here is the n number of tasks sent by the cloud users and output
provides the comparative analysis between FCFS and GA using queuing model that
reduces the waiting time of the overall system.
Fitness Sr
Wti
i1
(i = 1, 2, 3 N) where Wti is the waiting time of the task Sr and N is the total no of
tasks.
Roulette wheel is used as a random selection process. Each task is assigned a slot
size in proportion to its tness of the roulette wheel.
The probability of each task is calculated as:
Pi]
FitnessSr
TotalFitnessSr
392
S. Saha et al.
The ordered crossover is applied in this case. Two random crossover points are
chosen for partitioning from two parent tasks and divided into left, middle and right
portions. The ordered crossover is carried out in the following way. The left and
right portions remain unchanged and the middle portions strings interchange.
Mutation is a process of swapping the position of two genes. Two points are
selected from the given tasks and are swapped to get the new child. After applying
all the genetic operators on the selected parent, one new child is created. At that
point this new child is added to the existing population.
Queuing model is a mathematical theory that deals with managing and providing
a service on a queue or on a waiting time. It happens when enough service capacity
is not provided that causes the users to wait. The queuing model is recommended
by specifying the arrival process of users, service process, no of servers and server
capacity. Here, queuing model is used to reduce queue length and waiting time.
Poison distribution is taken into consideration as arrival patterns of the users. is
taken as an estimated value for this distribution. The time taken between the start of
a service and to its completion is known as service time.
Let Si be the service time of the ith user. So, the mean or average service time
will be
Pn
ES
i0
Si
1
ES
The condition provided for making a system stable is that the Utilization factor
should be
q
k
1:
l
3,
3,
2,
2,
2,
3,
4,
2,
1,
2,
1,
1,
4,
4,
4,
3,
3,
1,
3,
1,
2,
4,
4,
1,
4
4
4
3
4
2
3
1
4
1
2
4
1
2
1
2
1
3
1
3
3
2
3
2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
2,
1,
1,
1,
3,
4,
2,
3,
2,
4,
4,
3,
3,
3,
2,
1,
2,
2,
4,
4,
4,
1,
1,
3,
1,
2,
3,
4,
1,
1,
1,
4,
3,
3,
3,
2,
2,
1,
3,
4,
4,
4,
2,
2,
1,
3,
2,
4,
Serial no.
0.020
0.018
0.024
0.011
0.023
0.017
0.016
0.018
0.022
0.017
0.019
0.019
0.016
0.021
0.019
0.014
0.010
0.009
0.012
0.011
0.014
0.022
0.014
0.015
F(i) of FCFS
0.050
0.045
0.060
0.027
0.057
0.042
0.040
0.045
0.055
0.042
0.047
0.047
0.040
0.052
0.047
0.035
0.025
0.022
0.030
0.027
0.035
0.055
0.035
0.037
P(i)
CP(i)
3,
3,
4,
2,
1,
2,
2,
3,
3,
1,
1,
4,
1,
1,
3,
2,
4,
3,
2,
4,
1,
2,
4,
4,
4,
2,
3,
3,
2,
4,
3,
1,
1,
4,
3,
2,
3,
4,
2,
1,
1,
4,
1,
1,
2,
4,
3,
2,
1,
4,
1,
4,
3,
1,
4,
2,
4,
3,
4,
1,
2,
2,
1,
4,
2,
2,
3,
3,
4,
3,
2,
3,
2
1
2
1
4
3
1
4
2
2
2
3
4
3
4
3
3
1
4
2
3
1
1
1
New chromosome
3,
3,
4,
2,
1,
2,
2,
3,
3,
1,
1,
4,
1,
1,
3,
2,
4,
3,
2,
4,
1,
2,
4,
4,
1,
4,
1,
4,
3,
1,
4,
2,
4,
3,
4,
1,
2,
2,
1,
4,
2,
2,
3,
3,
4,
3,
2,
3,
4,
2,
3,
3,
2,
4,
3,
1,
1,
4,
3,
2,
3,
4,
2,
1,
1,
4,
1,
1,
2,
4,
3,
2,
2
1
2
1
4
3
1
4
2
2
2
3
4
3
4
3
3
1
4
2
3
1
1
1
Crossover
3,
3,
4,
2,
1,
2,
2,
3,
3,
1,
1,
4,
1,
1,
3,
2,
4,
3,
2,
4,
1,
2,
4,
4,
2,
1,
2,
1,
4,
3,
1,
4,
2,
2,
2,
3,
4,
3,
4,
3,
3,
1,
4,
2,
3,
1,
1,
1,
4,
2,
3,
3,
2,
4,
3,
1,
1,
4,
3,
2,
3,
4,
2,
1,
1,
4,
1,
1,
2,
4,
3,
2,
1
4
1
4
3
1
4
2
4
3
4
1
2
2
1
4
2
2
3
3
4
3
2
3
Mutation
0.019
0.024
0.010
0.018
0.014
0.016
0.018
0.019
0.022
0.016
0.020
0.018
0.017
0.021
0.017
0.019
0.015
0.022
0.011
0.009
0.023
0.014
0.014
0.011
F(i) of GA
394
S. Saha et al.
Accordingly the particular sequence that minimizes the waiting time must be stored
into the buffer queue. The sequence that reduces the waiting time of the overall
system is now used as a part of queuing model to nd the service rate. In GA the
sequence 4, 1, 3, 2 give the minimum waiting time. Furthermore, in case of FCFS
we have taken the sequence 1, 2, 3, 4 since it is basically a rst come rst served
algorithm.
For queuing system, the server has two parts, i.e. S1 and S2, and these two parts
are sequentially arranged. It is to be noted that when one task is executing in one
part then that same task cannot execute in another part. We assume that one task is
an entity, i.e. one task can be executed in one and only part at a same time. The two
data centres will be executed alternatively (Figs. 2, 3).
We approve our queuing model by using a different stream of arrival rates, = 6,
1, 22, 25, 34 and service rates, = 38.09, 40.40 which are arranged in Tables 2 and
3. Here the M/M/1 queuing model is used.
The graphical representations of the outcomes are presented in Figs. 4, 5, 6 and 7.
Fig. 2 The gantt chart of FCFS algorithm with mean service time E(S) = 0.02625 and service rate
= 38.09
Fig. 3 The gantt chart of genetic algorithm (GA) with mean service time E(S) = 0.02475 and
service rate = 40.40
395
Lq
Ls
Wq
Ws
=
=
=
=
=
6
14
22
25
34
0.03
0.21
0.79
1.25
7.42
0.19
0.58
1.37
1.91
8.31
0
0.02
0.04
0.05
0.22
0.03
0.04
0.06
0.08
0.24
Lq
Ls
Wq
Ws
=
=
=
=
=
6
14
22
25
34
0.03
0.18
0.65
1
4.47
0.17
0.53
1.2
1.62
5.31
0
0.01
0.03
0.04
0.13
0.03
0.04
0.05
0.06
0.16
396
Fig. 5 The average number
of customers in the system
(Ls) using FCFS and GA
S. Saha et al.
397
5 Conclusion
This paper proposes a hybrid approach for task scheduling algorithm for the cloud
environment with the combination of Genetic Algorithm (GA) and Queuing model
as a tool. This algorithm reduces the waiting time and queue length for satisfying
user requirements where GA is used to minimize the waiting time and the queuing
model is used to reduce both the queue length and waiting time. A comparative
analysis between the FCFS and GA algorithm is introduced taking into account
simulation. The simulation outcomes show that the Genetic Algorithm approach
gives 20 % better results against FCFS. Genetic Algorithm and Queuing model
approaches has been conveyed for reducing both queue length and waiting time.
For future work, this algorithm can be deployed on batch processing that may
prompt to good scheduling decisions.
References
1. Kamalapur, S., Deshpande, N.: Efcient CPU scheduling: a genetic algorithm based approach.
In: International Symposium on Ad Hoc and Ubiquitous Computing, pp. 206207. IEEE
(2006)
2. Li, L.: An optimistic differentiated service job scheduling system for cloud computing service
users and providers. In: Third International Conference on Multimedia and Ubiquitous
Engineering, pp. 295299. IEEE (2009)
3. Zhao, C., Zhang, S., Liu, Q., Xie, J., Hu, J.: Independent tasks scheduling based on genetic
algorithm in cloud computing. In: 5th International Conference on Wireless Communications,
Networking and Mobile Computing, pp. 14. IEEE (2009)
4. Ge, Y., Wei, G.: GA-based task scheduler for the cloud computing systems. In: International
Conference on Web Information Systems and Mining, vol. 2, pp. 181186. IEEE (2010)
398
S. Saha et al.
5. Selvarani, S., Sadhasivam, G.S.: Improved cost-based algorithm for task scheduling in cloud
computing. In: International Conference on Computational Intelligence and Computing
Research, pp. 15. IEEE (2010)
6. Guo-ning, G., Ting-Iei, H., Shuai, G.: Genetic simulated annealing algorithm for task
scheduling based on cloud computing environment. In: International Conference on Intelligent
Computing and Integrated Systems, pp. 6063. IEEE (2010)
7. Mocanu, E.M., Florea, M., Andreica, M., Tapus, N.: Cloud computingtask scheduling based
on genetic algorithms. In: International Conference on System Conference, pp. 16. IEEE
(2012)
8. Khazaei, H., Misic, J., Misic, V.B.: Performance analysis of cloud computing centers using
M/G/M/M+R queuing systems. IEEE Trans. Parallel Distrib. Syst. 23, 936943 (2012).
(IEEE)
9. Patel, J., Solanki, A.K.: Performance Enhancement of CPU Scheduling by Hybrid Algorithms
Using Genetic Approach, vol. 1, pp. 142144. IJARCET (2012)
10. Kumar, P., Verma, A.: Scheduling using improved genetic algorithm in cloud computing for
independent tasks. In: International Conference on Advances in Computing, Communications
and Informatics, pp. 137142. ACM (2012)
11. Baofang, H., Xiuli, S., Ying, L., Hongfeng, S.: An improved adaptive genetic algorithm in
cloud computing. In: 13th International Conference on Parallel and Distributed Computing,
Applications and Technologies, pp. 294297. IEEE (2012)
12. Idrissi, H.K., Kartit, A., Marraki, M.: A taxonomy and survey of cloud computing. In:
National Security Days, pp. 15. IEEE (2013)
13. Wu, X., Deng, M., Zhang, R., Zeng, B., Zhou, S.: A task scheduling algorithm based on QoS
driven in cloud computing. In: First Conference on Information Technology and Quantitative
Management, vol. 17, pp. 11621169. Elsevier (2013)
14. Randeep.: Processor scheduling algorithms in environment of genetics. Int. J. Adv. Res. Eng.
Technol. 1, 1419 (2013). (IJARET)
15. Vijayalakshmi, R., Prathibha, S.: A novel approach for task scheduling in cloud. In: Fourth
International Conference on Computing, Communications and Networking Technologies,
pp. 15. IEEE (2013)
16. Junwei, G., Yongsheng, Y.: Research of cloud computing task scheduling algorithm based on
improved genetic algorithm. In: 2nd International Conference on Computer Science and
Electronics Engineering, pp. 21342137. Atlantis Press (2013)
17. Sindhu, S., Mukherjee, S.: A genetic algorithm based scheduler for cloud environment. In: 4th
International Conference on Computer and Communication Technology, pp. 2327. IEEE
(2013)
18. Devipriya, S., Ramesh, C.: Improved max-min heuristic model for task scheduling in cloud.
In: International Conference on Green Computing, Communication and Conservation of
Energy, pp. 883888. IEEE (2013)