Improvement for tasks allocation system in VM for cloud datacenter using modified bat algorithm

Abstract

Since its inception, cloud computing has greatly transformed our lives by connecting the entire world through shared computational resources over the internet. The COVID-19 pandemic has also disrupted the traditional learning and businesses and led us towards an era of cloud-based activities. Virtual machine is one of the main elements of virtualization in cloud computing that represents physical server into the virtual machine. The utilizations of these VM’s are important to achieved effective task scheduling mechanism in cloud environment. This paper focuses on improvment of the task distribution system in VM for cloud computing using load balancing technique. For that reason modification took place at Bat algorithm fitness function value this section used in load balancer section. When algorithm iteration are complete then time to distribute the task among different VM therefore in this section of algorithm was modified. The second modification took place at the search process of Bat at dimension section. The proposed algorithm is known as modified Bat algorithm. Four parameter are used to check the performance of the system which are throughput, makespan, degree of imbalance and processing time. The proposed algorithm provides efficient result as compaire to other standard technique. Hence the proposed algorithm improved cloud data center accuracy and efficiency.

Introduction

Cloud computing is new trend of technology which has changing the world direction over the last decade. The deliveries of virtualized resources are performed with the help of internet in cloud computing. These services are delivered with the rule of pay and gain base on the demand with real time services over the internet rather than having these service of local servers or person computer [26]. Cloud resource present as universal tools that any user can rent and release these services with the help of internet. It becomes twenty-first-century technology due to the mixture of high bandwidth statement and low-cost computing with storage [8, 9]. Normally four well know type of cloud computing exit which are private, hybrid, public and community cloud computing. Some of the main services offered by cloud provider are software as a service (SaaS), application as a service (AaaS), hardware as a service (HaaS), desktop as a service (DaaS), backup as a service (BaaS), and network as service (NaaS) [30]. Cloud computing is growing rapidly and is used in areas like education, geospatial sciences, engineering technology, data-intensive applications, health, life science, application programming services, different scientific and business domains. VM is a software program or operating systems that work as the real behaviour of the server or a separate computer. VM is capable of performing task like real system. Different rule and policy are mention in VM development process. With the help of these rule and policy, VM work more efficiently. Further more load balancing technique is used in improving task allocation system for VM in cloud computing [33, 37]. Figure 1 shows the structure of cloud technology.

Fig. 1.

Cloud computing structure

Cloud computing facing different kind of issues and one of the big issues is task allocation system in VM. During the allocation of tasks are performing in VM there are two conditions can occur. Both conditions are known as under-loaded and over loaded where both situations can cause the network failure or delay of user request. Moreover, a proper load balancing technique is needed to overcome this situation [15]. Dynamic load balancing technique is one of the main element or heart of data center in cloud environment because it helps VM to carry out the same amount of workload and deliver the service with minimal time without delay to the end user. Therefore, well know nature inspired algorithms were selected in improving in task allocation s ystem in VM for cloud computing. This study is an alternative to improve task allocation system of VM’s by proposing an improved load balancing technique for cloud computing. [2, 3]. Four parameter are used to check the performance of the system which are throughput, makespan,degree of imbalance and processing time. The result of the paper is organized as. The related work about Bat algorithm and different parameter improvement are discussed briefly in Sect. 2; paper contribution discuss in Sect. 3; simulation environment are briefly described in Sect. 4; performance comparison is presented in Sect. 5 Section 6 discuss about conclusion and future work. Different notations are used in this paper which is mention in Table 1 which helps the reader to understand the paper.

Table 1.

Notation used in this paper

Symbol	Description	Symbol	Description
VM	Virtual machine	iT	Iteration Of Algorithm
LB	Load balancing	Np	Number of requests per period
CC	Cloud computing	MIppt	Million instruction per second of Processing Time
DC	Data center	DC	Data center
PTstvm	Processing time of single tasks in VM	UB	Use base
PTtvm	Processing time of all tasks in VM	SCR	Second cycle range
CJmax	Total number of Tasks	SBP	Service broker policy
Ppn	Priority per node	SLA	Service level agreement
M.Bat	Modified Bat Algorithm	RP	Routing Policy
		GVM	Group of virtual machine

Recent work

The basic inspiration behind Bat algorithm is the role of echolocation behaviour of micro-bats [20]. The micro-Bats can search their prey even in the darkness with the help of echolocation behavior these micro-bats have different sound pulses of different properties and used for different hunting strategies for his objects. In Bat algorithm makes a balance between exploration and exploitation with the help of two main parameters which are frequency and emission rate. The wavelength and pulse rate adjusted automatically the distance upon the distance and prey [14]. A lot of work has already has been published about optimization in cloud computing in the section of VM task allocation system some of them are summaries below.

VM play important role of resource allocation system therefore the author [29], proposed Bat algorithm using directed acyclic graph with topological ordering in Bat algorithm for improvement in task allocation system of VM for cloud computing. Due to the modification of the above section improve the algorithm waiting time of task and make idle time for VM as it improves the convergence rate high.

Due to the data handing and processing capacity of cloud computing increase therefore it need to proper distributed task among different VM properly. Therefore the author proposed a modified Bat algorithm for resource allocation system optimization. The new approach the workflow system are modified by minimizing the iteration number due to this section it take less time for data executation. The proposed algorithm verified by testing and compare it result with stand algorithm based on the result it improve the makespan of them system [34].

Task scheduling in one the important issue which still exit in cloud computing therefore the author proposed chaos theory and Bat algorithm for task allocation for VM in cloud environment. In the proposed technique the author uses chaos theory for distribution of data to different VM. Due to the theory it changes the fitness function value and improves the makespan and network stability. It result are compare with well know algorithm based on the result it improve the task allocation system [24].

Due to the demand of user for better service in cloud computing increase the importance of resource allocation system. Therefore the author modified Bat algorithm local search section for improvement in energy management system. The proposed algorithm are compare to well know algorithm based of the result it improved the energy utilization system [12].

The author [22] the position of each Bat is mainly updated by the current optimal solution in the early stage of searching and in the late search it also depends on the mean best position which can enhance the convergence speed of the algorithm.

To balance between the local and global search capability in Bat algorithm, a new search equation is proposed for each Bat based on the history optimal position that it memorized; to avoid falling into a local optimal solution, an abandoned mechanism is adopted for each Bat based on the number of its position has not been improved, to enhance the local search ability, a dynamic adaptive search equation is presented [36]. Table 2 present the different modified section of Bat algporithm.

Table 2.

Improvement different parameter of Bat algorithm

Ref	VM	Bat modification section	Performance parameters
[23]	VM/ Load balancer	loading detection section	Response time, fault torrent
[7]	VM	SLA violation metrics	Quality of services (QoS) Migration time
[25]	VM	Probity at initiation section	Makespan and QoS
[21]	VM/ Based learning	Generated section	Response time, Accuracy
[19]	VM	Rules	Reduce Response
[28]	VM	Initiation rule	QoS, Makespan, Task finishing time
[1]	VM/ Load balancer	Search Section	Reduce Response, QoS
[35]	VM	Initial stage	Response Time, QoS
[31]	VM	Depends on policies	Makespan
[16]	VM		Makespan, Throughput
[39]	VM	Global optimized section	QoS, Minimize the decision time
[32]	VM/Game theory	Search Section	Makespan, QoS
[5]	VM	Initiation section	QoS, Accuracy
[18]	VM	Search Rule	QoS, Accuracy
[17]	VM	Fitness function	Makespan
[27]	VM	Fitness function	Makespan

Table 2 presents the related work about the improvement in different parameter of Bat algorithm. This parameter modification or improvement took place just for improvement in resource allocation system of VM in cloud computing. Analysis of the study of these related works that motivates this paper in finding some issues which are still exist in Bat algorithm. Due to the modification in tasks allocation system different parameter of time consumptions improved in cloud datacenter. Our contribution of the paper can be summarized as below.

• (b)A survey of existing improvement in different section of Bat algorithm used for load balancing purpose.
• (c)The proposed algorithm modification sections are discussed with explanation.
• (d)The proposed algorithm addresses the VM violation issue like under/overloaded task distribution in cloud datacenter.
• (e)The proposed algorithm improved different time consumptions parameters in cloud data center.
• (f)The proposed algorithm results are comparing with well-known algorithm.
• (g)Discuss the result along with future implementation of the proposed algorithm. Figure 2 presents the frame work of the proposed approach.

Fig. 2.

Proposed algorithm working criteria

Proposed modified bat algorithm

The proposed algorithm used inload balancing technique for improvements in task allocation system of VM in cloud computing. Four main parameter throughput, makespan, degree of imbalance and processing time are used to check the performance of proposed technique in cloud computing. Cloud computing consist of a set of data centre and each data centre consist of m set of host and each host consist j of set of VM. The following step of algorithm used for implementation of task distribution. The numbers of population are uniformly distributed randomly to different VM o and n. Bat represents a solution that Bat describes by the position X_ij2 = [o, n] and velocity X_ij where I represent the population and j present tasks [38]. The initializing the positions are present step 1 present in Table 3.

Table 3.

Algorithm step 1

Algorithm step 1
1	Xij = Xmin + (Xmax − Xmin)×∂ Where Xmax = n and Xmin=0
2	∂ϵ [0, 1]is random number drawn from a uniform distribution.

In the second step the algorithm generate the new solution which present Table 4.

Table 4.

Algorithm step 2

Algorithm step 2
1	fi = fmin + (fmax − fmin) × β ${\mathrm{V}}_{\mathrm{ij}}^{\mathrm{t}+1}={\mathrm{V}}_{\mathrm{ij}}^{\mathrm{t}}+\left({\mathrm{X}}_{\mathrm{ij}-{\mathrm{g}}^{{\text{best}}_{\mathrm{j}}}}^{\mathrm{t}}\right)\times {\mathrm{f}}_{\mathrm{i}}$ ${\mathrm{X}}_{\mathrm{ij}}^{\mathrm{t}+1}={\mathrm{X}}_{\mathrm{ij}}^{\mathrm{t}}+{\mathrm{V}}_{\mathrm{ij}}^{\mathrm{t}+1}$
2	β ϵ [0, 1] Is random number distributed from uniformly gbest is the task number which is placed on VM (j) for the best solution (t) is the number iteration and (fi) is the frequency of Bat. For the local search generate the uniform distribution number if the number bigger the rate of pulse emission (${\mathrm{r}}_{\mathrm{i}}^{\mathrm{t}})$ update position.
3	${\mathrm{X}}_{\mathrm{ij}}^{\mathrm{t}+1}={\mathrm{X}}_{\mathrm{ij}}^{\mathrm{t}+1}$+ random (−1,1)A meantt Where R and(−1 1) is number of uniform is the average loudness of tit iteration number[6].

After the generate the new solution now it time to speed at which Bat searches for prey in the dimension present as dimension. Table 5 present the equation.

Table 5.

Algorithm step 3

Algorithm step 3
1	$V_{\mathit{id}}^t=v_{\mathit{id}}^{\left(t-1\right)}+f_i\left(x_{\mathit{id}}^{\left(t-1\right)}-x_d^{\ast }\right)$
2	In the given equation d present the dimension of the search space $V_{\mathit{id}}^t$ and $v_{\mathit{id}}^{\left(t-1\right)}$ denote the flight speed of the bat i and t − 1 respectively $x_{\mathit{id}}^{\left(t-1\right)}$ denote the position of bat i at time t − 1 and $x_d^{\ast }$ represent the best position in the population up to the t iteration so far.

Fourth step form the update loudness and rate of pulse emission are producing a random number form uniform distribution. If the value small smaller then loudness Ai and f new generated by using (Eq 1in step 3) is smaller then pervious frequenting and update the following equation Tables 6.

Table 6.

Algorithm step 3

Algorithm step 4
1	fi = fnew $A_i^{t+1}=\alpha A_i^t$ $r_i^{t+1}=r_i^t(1-e^{-\mathit{rt}}$)
2	Where α = γ = .0 7 Used to update the global best position.

The in the algorithm step 5 (eq. 4) are the modified section where they are used for calculation of load on load balancer section (Table 7). When this section calculated the load and get information from data centre where any VM available or not. When some of the VM found overloaded with multiple task then they need to migrate the data to overloaded VM. The data selection method used for Data migration is priority based if any low case priority is selected from migration then other remains as candidate for migration. The above process done on the equation base, line 3,4 of the algorithm step 5 and it compare the which the threshold value. Figure 3 show the flow chat of the proposed technique.

Table 7.

Algorithm step 5

Algorithm step 5
1	Calculate load balancer. After submitting data to the under-loaded VMj the current workload of all available VM’s can be calculated by using the information that received from the data center. Thus variance (σ) is called in order to measure the variance of data on VM ‘s calculate variance of load can be defined as follows [13].
2	$S^2\frac{\sum f{\mathit{xi}}^2}{n}-\overline{X}$ Where $\overline{X}$ =$\frac{\sum \mathit{fi}}{n}$
3	Processing time of VM $X_j={\sum }_1^d\frac{\text{task}-\text{length}\left(i\right)}{\text{Capacity}}$
4	Means of processing time of all VMs $\mathit{VM}={\sum }_1^{\mathrm{d}}\frac{\text{task}-\text{length}\left(\mathrm{i}\right)}{\mathrm{n}-1}$

Fig. 3.

Flow chat of proposed algorithm

Simulation environment

The simulations consist of different experiments which consist of different data centers, different number of VM’s running on the physical host and different numbers of tasks are given. Table 8 show different parameters of simulation and these parameters changes at each experiment.

Table 8.

Simulation parameters

Type	Parameter	Value	Type	Parameter	Value
Region	From 1 to 4	5	Task/Data	Number of task	100/1000
Data center	Number of data center	5		Length of task	100/200/400 byte
	Number of hosts	100/1000		Number of processor per requirement	250 KB
	Type of Manager	Time and space		Type of manager	Time and space
	Bandwidth	1000	Memory	Total memory	204,800 Mb
Virtual machine	Total number of VM	30/20/20		Number of processors	4 per VM
	Number of processor per virtual machine	4		Total processor	120
	Virtual machine memory	512		Storage Memory	100,000 Mb
	Bandwidth in bit	1000		Viable memory	10,000
	VM image size	1000	Cloudlets	Total number of task	400/600
Used algorithm	Maximum number of Iteration	100	CPU	MIPS OF PE/Number of PFs VM	2500/1
			Proposed algorithm	Maximum number of Iteration	100
Dataset	Data center	No/VMs	No/VMs	DC/Policy	12 GBRM
SWF			D1 = 5	Random	Windows 2010
Size 400 K/200 k	D1,D2,D3	D1 = 5	64-bit version	12 GBRM
PC	D4,D5	D*5 = 30/50

Table 8 present the different parameters some of these parameters are change durning each experiments like task number, VM number and data size.

Performance comparison

I this section we present all the result of different parameters which are used to measure the performance of the proposed algorithm like throughput, makespan, degree of imbalance and processing time. These parameters are checked with different simulation steps their result are explain below.

Performance based on makespan

In this sub-section the performance of proposed algorithm measured based on makespan time. For the paper makespan measured as total time taken by resource to complete the executing of all tasks in a cloud datacenter [10]. Here the analysis has been done taking 7 different scenarios taking 200 to 1200 tasks and the makespan time is calculated as.

$$\mathit{\text{Makespan}}=\frac{\mathit{\text{Given time to the network}}}{\mathit{\text{Complite time of network}}}\ast 100$$

Here five different algorithm like Round-Robin, Bat, artificial bee colony, genetic algorithm, and proposed modified Bat algorithm are evaluated by different number of tasks from 200 to 1200.The result of proposed algorithm makespan are, 187/200,293/400,338/600,396/800,443/1000 and 478/1200 which are the most less number of time taken by any algorithm for completing number of takes in the experiments. Figures 4, 5 and 6 presents the makespan.

Fig. 4.

Makespan result of 600 task

Fig. 5.

Makespan result of 1000 task

Fig. 6.

Makespan result of 1200 task

Performance based on processing time

In this sub section the evaluation performance of the proposed algorithm is calculated based on processing time and the result are measured with other algorithms. The equation of total processing time is given below.

Proces sin g_Time = Cloudlet_length/VM_Mips × PE_Number) [11]. Based on Table 9 the result of proposed algorithm are 1089.56, 1123.67, 1234.78, 1234.78, 1876.78 and 2078.89 which are the most lowest total processing time in the simulation Table 9 and Fig. 7 present the overall result.

Table 9.

Total processing time

Total processing time
Task Number	RR	Bat	ABC	GA	Modified Bat
200	1300.89	1245.67	1223.67	1156.78	1089.56
400	1500.67	1478.89	1389.89	1245.78	1123.67
600	1765.65	1645.89	1567.78	1356.89	1234.78
800	1800.78	1769.89	1543.67	1456.89	1289.67
1000	2234.89	2145.89	2089.89	1987.89	1876.78
1200	2489.89	2356.78	2245.78	2167.98	2078.89

Fig. 7.

Total processing time

Performance based on degree of imbalance

In this sub-section the proposed algorithm is tested based on the degree of imbalance and compared with other present algorithms the given equation presents degree of imbalance.

$$D_i=\left(T_{\max }-T_{\min }\right)/T_{\mathit{avg}}$$

Where T_max and T_min are minimum and maximum T_i present the all VM’s T_avg is present the average T_i VM [4]. Based on Table 10 the proposed algorithm provide most efficient result as compare to the standard algorithm Table 10 and Fig. 8 present the overall result.

Table 10.

Result analysis of different workflows for degree of imbalance

Degree of imbalance
Task Number	RR	Bat	ABC	GA	Modified Bat
200	56.90	47.45	45.34	43.78	40.89
400	89.90	87.67	80.34	77.45	70.34
600	110.56	100.89	89.78	86.67	80.56
800	170.67	167.67	162.67	160.56	156.45
100	198.90	190.45	188.67	180.67	176.78
1200	210.67	200.78	190.56	189.67	180.67

Fig. 8.

Degree of imbalance

Based on the Table 10 most efficient result are, 40.89, 70.34, 80.56, 156.45, 176.78 and 180.67 these are the result of the proposed algorithm as compare to other algorithm. Figure 9 present the result of makespan where it shows it present the different algorithm makespan result.

Fig. 9.

Result of makespan

The inspiration driving this work is to diminish makespan and improve task allocation system in VM for cloud computing in a dynamic environment. Therefore, this study proposed modified Bat algorithm design for improvement in tasks allocation system in VM for cloud computing. The proposed algorithm can greatly reduce the makespan time, increase the utilization of resources and balance the load on each virtual machine. The per- formance of the proposed algorithm on 120 trial simulations were performed in which tasks number, size of task, VMs number and DC number in different zones are dynamically changed. CloudSim simulation tool was used for the simulation purpose. Based on the results the proposed took less amount of time in each data center during execution.

Conclusion

In this paper the proposed algorithm was design for improvement of four parameter which are throughput, makespan, degree of imbalance and processing time in cloud computing. During experiments process different parameter of simulation change like task number, VM and data size to check the proposed algorithm performance. The proposed model results are compared with Bat algorithm ABC algorithm RR algorithm and GA algorithm. From the calculation new technique improves 1.78% improvement in reduction of time consumption of cloud datacenter using load balancing technique. The simulation result shows that purposed algorithm improve in time consumption of datacenter for cloud computing. The proposed load balancing algorithm shows better performance for a large number of assigned tasks and data size as compare to the other standard algorithms. In upcoming paper we implement the proposed algorithm for predication of host in cloud datacenters.

Author contribution

All authors are equality contribution for making paper.

Data availability

No specific Data are used because it is review papers all those paper which are study and used in this paper are cited in the paper.

Declarations

Competing interests

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.