Systematic Review:Load Balancing in Cloud Computing by Using Metaheuristic Based Dynamic Algorithms

Cloud Computing has the ability to provide on-demand access to a shared resource pool.It has completely changed the way businesses are managed,implement applications,and provide services.The rise in popularity has led to a significant increase in the user demand for services.However,in cloud environments efficient load balancing is essential to ensure optimal performance and resource utilization.This systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing algorithms.Specifically,metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased traffic.In a cloud-based context,this paper describes load balancing measurements,including the benefits and drawbacks associated with the selected load balancing techniques.It also summarizes the algorithms based on implementation,time complexity,adaptability,associated issue(s),and targeted QoS parameters.Additionally,the analysis evaluates the tools and instruments utilized in each investigated study.Moreover,comparative analysis among static,traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also performed.Finally,the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed.

Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network

To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.

Multi-head neural networks for simulating particle breakage dynamics

The breakage of brittle particulate materials into smaller particles under compressive or impact loads can be modelled as an instantiation of the population balance integro-differential equation.In this paper,the emerging computational science paradigm of physics-informed neural networks is studied for the first time for solving both linear and nonlinear variants of the governing dynamics.Unlike conventional methods,the proposed neural network provides rapid simulations of arbitrarily high resolution in particle size,predicting values on arbitrarily fine grids without the need for model retraining.The network is assigned a simple multi-head architecture tailored to uphold monotonicity of the modelled cumulative distribution function over particle sizes.The method is theoretically analyzed and validated against analytical results before being applied to real-world data of a batch grinding mill.The agreement between laboratory data and numerical simulation encourages the use of physics-informed neural nets for optimal planning and control of industrial comminution processes.

Hierarchical Bayesian Calibration and On-line Updating Method for Influence Coefficient of Automatic Dynamic Balancing Machine

Measurement error of unbalance＇s vibration response plays a crucial role in calibration and on-line updating of influence coefficient（IC）. Focusing on the two problems that the moment estimator of data used in calibration process cannot fulfill the accuracy requirement under small sample and the disturbance of measurement error cannot be effectively suppressed in updating process, an IC calibration and on-line updating method based on hierarchical Bayesian method for automatic dynamic balancing machine was proposed. During calibration process, for the repeatedly-measured data obtained from experiments with different trial weights, according to the fact that measurement error of each sensor had the same statistical characteristics, the joint posterior distribution model for the true values of the vibration response under all trial weights and measurement error was established. During the updating process, information obtained from calibration was regarded as prior information, which was utilized to update the posterior distribution of IC combined with the real-time reference information to implement online updating. Moreover, Gibbs sampling method of Markov Chain Monte Carlo（MCMC） was adopted to obtain the maximum posterior estimation of parameters to be estimated. On the independent developed dynamic balancing testbed, prediction was carried out for multiple groups of data through the proposed method and the traditional method respectively, the result indicated that estimator of influence coefficient obtained through the proposed method had higher accuracy; the proposed updating method more effectively guaranteed the measurement accuracy during the whole producing process, and meantime more reasonably compromised between the sensitivity of IC change and suppression of randomness of vibration response.

Dynamic and Integrated Load-Balancing Scheduling Algorithm for Cloud Data Centers

One of the challenging scheduling problems in Cloud data centers is to take the allocation and migration of reconfigurable virtual machines as well as the integrated features of hosting physical machines into consideration. We introduce a Dynamic and Integrated Resource Scheduling algorithm (DAIRS) for Cloud data centers. Unlike traditional load-balance scheduling algorithms which often consider only one factor such as the CPU load in physical servers, DAIRS treats CPU, memory and network bandwidth integrated for both physical machines and virtual machines. We develop integrated measurement for the total imbalance level of a Cloud datacenter as well as the average imbalance level of each server. Simulation results show that DAIRS has good performance with regard to total imbalance level, average imbalance level of each server, as well as overall running time.

A Dynamic Load Balancing Method of Cloud-Center Based on SDN

In order to balancing based on data achieve dynamic load flow level, in this paper, we apply SDN technology to the cloud data center, and propose a dynamic load balancing method of cloud center based on SDN. The approach of using the SDN technology in the current task scheduling flexibility, accomplish real-time monitoring of the service node flow and load condition by the OpenFlow protocol. When the load of system is imbalanced, the controller can allocate globally network resources. What＇s more, by using dynamic correction, the load of the system is not obvious tilt in the long run. The results of simulation show that this approach can realize and ensure that the load will not tilt over a long period of time, and improve the system throughput.

Dynamic Load Balancing Based on Restricted Multicast Tree in Homogeneous Multiprocessor Systems

To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.

MDSLB:A new static load balancing method for parallel molecular dynamics simulations

Large-scale parallelization of molecular dynamics simulations is facing challenges which seriously affect the simula- tion efficiency, among which the load imbalance problem is the most critical. In this paper, we propose, a new molecular dynamics static load balancing method （MDSLB）. By analyzing the characteristics of the short-range force of molecular dynamics programs running in parallel, we divide the short-range force into three kinds of force models, and then pack- age the computations of each force model into many tiny computational units called ＂cell loads＂, which provide the basic data structures for our load balancing method. In MDSLB, the spatial region is separated into sub-regions called ＂local domains＂, and the cell loads of each local domain are allocated to every processor in turn. Compared with the dynamic load balancing method, MDSLB can guarantee load balance by executing the algorithm only once at program startup without migrating the loads dynamically. We implement MDSLB in OpenFOAM software and test it on TianHe-lA supercomputer with 16 to 512 processors. Experimental results show that MDSLB can save 34%-64% time for the load imbalanced cases.

THE DESIGN AND ANALYSIS OF VIBRATION STRUCTURE OF VERTICAL DYNAMIC BALANCING MACHINE

A new type of vibration structure (i.e. supporting system, called swing frame cus- tomarily) of vertical dynamic balancing machine has been designed, which is based on an analysis for the swing frame of a traditional double-plane vertical dynamic balancing machine. The static unbalance and couple unbalance can be e?ectively separated by using the new dynamic balancing machine with the new swing frame. By building the dynamics model, the advantages of the new structure are discussed in detail. The modal and harmonic response are analyzed by using the ANSYS7.0. By comparing the ?nite element modal analysis with the experimental modal analy- sis, the natural frequencies and vibration modes are found. There are many spring boards in the new swing frame. Their sti?nesses are di?erent and assorted with each other. Furthermore, there are three sensors on the measuring points. Therefore, the new dynamic balancing machine can measure static unbalance and coupling unbalance directly, and the interaction between them is faint. The result shows that the new vertical dynamic balancing machine is suitable for inertial measurement of ?ying objects, and can overcome the shortcomings of traditional double-plane vertical dynamic balancing machines, which the e?ect of plane-separation is inferior. The vertical dynamic balancing machine with the new vibration structure can ?nd wide application in the future. The modelling and analysis of the new vibration structure will provide theoretical basis and practical experience for designing new-type vertical dynamic balancing machines.

NEW TYPE OF VIBRATION STRUCTURE OF VERTICAL DYNAMIC BALANCING MACHINE

A new type of vibration structure of vertical dynamic balancing machine isdesigned, which is based on the analysis for swing frame of a traditional vertical dynamic balancingmachine. The static unbalance and couple unbalance can be separated effectively by using the newmachine with the new swing frame. By building the dynamics model, the advantages of the newstructure are discussed in detail. The modal and harmonic response are analyzed by using theANSYS7.0. By comparing the finite element modal analysis with the experimental modal analysis, thenatural frequencies and vibration modes are found out. There are many spring boards in the new swingframe. Their stiffness is different and assort with each other. Furthermore, there are threesensors on the measurement points. Therefore, the new dynamic balancing machine can measure thestatic unbalance and couple unbalance directly, and the influence between them is faint. The newstructure has the function of belt-strain compensation to improve the measurement precision. Thepractical result indicates that the new vertical dynamic balancing machine is suitable for inertialmeasurement of flying objects, and can overcome the shortcomings of traditional double-planevertical dynamic balancing machines. The vertical dynamic balancing machine with the new vibrationstructure can be widely used in the future applications. The modeling and analysis of the newvibration structure provide theoretic instruction and practical experience for designing new type ofvertical dynamic balancing machines. Based on the design principles such as stiffness-matching,frequency-adjacence and strain-compensation and so on, various new type of vibration structures canbe designed.

LOW-COST HIGH PERFORMANCE CLUSTER OF WORK-STATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL DEPTH-FIRST SEARCH(DFS)

This paper presented an idea to replace the traditionally expensive parallel machines by heterogeneous cluster of workstations. To emphasise the usability of cluster of workstations platform for parallel and distributed computing, also the paper presented the status report on the effort and experiences for the implementation of a dynamic load balancing for parallel tree computation depth first search(DFS) on the cluster of a workstations project. It compared the speedup performance obtained from our platform with that obtained from the traditional one. The speedup results show that cluster of workstations can be a serious alternative to the expensive parallel machines.

CLUSTER OF WORKSTATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL TREE COMPUTATION DEPTH-FIRST-SEARCH

The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.

Optimization of Load Balancing Algorithm for Virtual Machine Dynamic Migration under Mobile Cloud Computing

As one of the key technologies of cloud computing,the virtualization technology can virtualize all kinds of resources and integrate them into the unified planning of the cloud computing management platform.The migration of virtual machines is one of the important technologies of virtual machine applications.However,there are still many deficiencies in the implementation of load balancing by virtual machine dynamic migration in cloud computing.Traditional triggering strategy thresholds are mostly fixed.If there is an instantaneous peak,it will cause migration,which will cause a waste of resources.In order to solve this problem,based on improving the dynamic migration framework,this paper proposes node selection optimization algorithm and node load balancing strategy and designs a prediction module,which uses a one-time smooth prediction to avoid the shortcoming of peak load moment.The simulation experiments and conclusions analysis results show that the fusion algorithm has performance advantages obvious.

A rapid on-site calibration method for measuring dynamic envelope curve of high-speed trains

Dynamic envelope curve is a significant parameter to assess the running safety of high-speed trains.Up to now the method based on binocular stereo vision is the only way available to measure the dynamic envelope curve of a train,the speed of which is over200km/h.Nevertheless the method has two limitations,one is large field-〇f-view(FO V),the other is calibration time.Hence portable calibration equipment,easy-t〇-build target and rapid calibration algorithm are required to complete the calibration.In this paper,a new rapid on-site calibration method with large FOV based on binocular stereo vision is proposed.To address these issues,a light target has been designed,the rail coordinate system(RCS)is represented by40fixed retroreflective points on the target,and they are utilized to calibrate the parameters of two cameras.In addition,two cameras merely capture a single image of the target simultaneously,and the intrinsic and extrinsic parameters of the cameras can be calculated rapidly.To testify the proposed method,the experiments have been conducted and the results reveal that the accuracy can reach+1mm,which can meet the measurement requirement.

Dynamic balancing of dual-rotor system with very little rotating speed difference

Unbalanced vibration in dual-rotor rotating machinery was studied with numerical simulations and experiments. A new method is proposed to separate vibration signals of inner and outer rotors for a system with very little difference in rotating speeds. Magnitudes and phase values of unbalance defects can be obtained directly by sampling the vibration signal synchronized with reference signal. The balancing process is completed by the reciprocity influence coefficients of inner and outer rotors method. Results showed the advantage of such method for a dual-rotor system as compared with conventional balancing.

Dynamic load balancing with learning model for Sudoku solving system

This paper proposes a dynamic load balancing with learning model for a Sudoku problem solving system that has multiple workers and multiple solvers.The objective is to minimise the total processing time of problem solving.Our load balancing with learning model distributes each Sudoku problem to an appropriate pair of worker and solver when it is received by the system.The information of the estimated solution time for a specific number of given input values,the estimated finishing time of each worker,and the idle status of each worker is used to determine the worker-solver pairs.In addition,the proposed system can estimate the waiting period for each problem.Test results show that the system has shorter processing time than conventional alternatives.

Implementation Study of Dynamic Load Balancing Algorithm of Parallel Tree Computation on Clusters of Heterogeneous Workstation

The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).

Dynamic Load Balancing with Overlay-Based Reconfiguration for Wireless Sensor Networks

Wireless sensor networks are characterized by multihop wireless links and resource constrained nodes. In terms of data collection and forwarding scheduling, this paper investigates the load balancing in sensor nodes and wireless link based on the performance of wireless sensor networks. Leveraging the property of dissimilarity distribution, a method to quantitatively evaluate the benefits of load balancing is presented, in order to access the profitability. Then a novel Dynamic Load Balancing of Overlay-based WSN (DLBO) algorithm has been put forward. In particular, the tradeoff between transferring ratio and the load imbalance among nodes is discussed. The load balancing method in this paper outperforms others based on balancing factor, different nodes number and data scales of applications. The proposed model and analytical results can be effectively applied for reliability analysis for other wireless applications (e.g., persistent data delivery is involved).

Research on Full Vector Dynamic Balancing Algorithm for Rotors

Influence coefficient method and the modal balancing method are often used in the dynamic balancing in the past days. These methods sometimes exist a lot of big measurement errors. So, in order to make these errors much smaller, and to use the vibration information of the rotor more sufficiently, at last, we put forward the full vector dynamic balancing algorithm. Though the theoretical analysis, and the experiment tests, we can compare with the new method and the old method , study the relationship between the dynamic balancing and the rotation equipment, and the direction of the development. The full vector dynamic balancing algorithm theory can be inferred from the Jeffcott rotor. To compare with the methods which are mentioned before, we can find that the full vector dynamic balancing algorithm is much better than the influence coefficient method and the modal balancing method. We can use the MATLAB program to prove that the full vector dynamic balancing algorithm is much better. So the conclusion is completely right.

The Application of Ridge Regression in Dynamic Balancing of Flexible Rotors Based on Influence Coefficient Method

Based on the model structure of the influence coefficient method analyzed in depth by matrix theory ,it is explained the reason why the unreasonable and instable correction masses with bigger MSE are obtained by LS influence coefficient method when there are correlation planes in the dynamic balancing. It also presencd the new ridge regression method for solving correction masses according to the Tikhonov regularization theory, and described the reason why the ridge regression can eliminate the disadvantage of the LS method. Applying this new method to dynamic balancing of gas turbine, it is found that this method is superior to the LS method when influence coefficient matrix is ill-conditioned,the minimal correction masses and residual vibration are obtained in the dynamic balancing of rotors.