Threshold Compare and Load Balancing Algorithm to for Resource Optimization in a Green Cloud

The reduction in the consumption of energy by the cloud data centers is called as green cloud. Green cloud also helps in restraining the waste disposed to the environment. With the increasing demand in cloud computing, there has been an increase in the energy consumption. Green cloud can be achieved by server consolidation and proper load balancing techniques using virtual machine (VM) migration. It is a feature provided by virtualization. The virtual machines are transferred from one host to another. The overhead associated with migration is performance degradation. This can be overcome by proper load balancing techniques. This helps to curtail the number of VM migrations as well as the energy consumption. In this paper, a technique called as threshold compare and load balance algorithm (TCLBA) is proposed for optimization of the resources at the cloud provider. Two types of threshold are defined for load balancing, namely the lower and upper threshold. This algorithm works on the principle of shifting the load from a server if the load is above the upper threshold or shifting to the server if its load is below the lower threshold. The load is balanced by migrating the VMs. The workload is consolidated to smaller number of hosts such that the remaining hosts are shut down. This method solves the purpose of effective utilization of available resources with lesser energy consumption.

New Algorithm to Handle Routing with Load Balancing in Wireless Networks Using EERNN

In this paper, static wireless network load balance algorithm is proposed, that use only optimal paths from point-to-point to achieve good load balance. This algorithm based on Enhanced version of Elman Recurrent Neural Network (EERNN) to make load balance decision depended on two metrics (traffic load on node and probability of link failure). This algorithm make good work in terms of both metrics simultaneously. Also, this algorithm use only local information. The execution of the proposed algorithm is compared with ERNN based on traffic load on node and probability of link failure. © 2018 JASET, International Scholars and Researchers Association Author Biographies Lubna Najah Rasoul Mazaya University Collage Wijdan Rasheed Abd Al-Hussain University of Thi-Qar

An efficient, robust and automatic overlapping grid assembly approach for partitioned multi-block structured grids

An efficient, robust and fully automatic grid assembly method on multi-block cell-centered structured grids for massively parallel computation is proposed in this paper. Compared with the traditional serial algorithm, the new approach eliminates the complex irregular boundaries created during the grid partition and avoids the large load imbalance caused by the large variation of grid-block overlapping. The main task of the overlapping grid assembly is to categorize all grid points into field points, fringe points and hole points. As to the main processes of the overlapping grid assembly, for hole cutting, an improved hole map method is applied to accurately identify the hole points located on the wall boundary with less memory cost. For donor search which is the most complex process on account of the irregular distribution of the partitioned multi-block structured grids in a parallel computation environment, the Alternating Digital Tree (ADT) is utilized to find out the potential donor cells quickly for query points. Besides, to achieve better overlapping quality, the wall distance criterion is implemented for overlapping optimization. In addition, two load balance algorithms are designed to solve the imbalance problem of overlapping grid assembly. Two test cases are applied to test the new overlapping grid assembly algorithm and the results show that the new overlapping grid assembly algorithm can deal with large-scale simulation of vehicles. The comparison of total time and speed-up among three algorithms manifests that the initial load balance algorithm using query point number as load criterion is not reliable while the improved load balance algorithm achieves good speed-up and least runtime. Meanwhile, the maximum proportion the improved load balance algorithm takes in one physical unsteady step in wing-pylon-store separation test case is less than 6.1%.