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.

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.

Novel Hybrid Physics‑Informed Deep Neural Network for Dynamic Load Prediction of Electric Cable Shovel

Electric cable shovel(ECS)is a complex production equipment,which is widely utilized in open-pit mines.Rational valuations of load is the foundation for the development of intelligent or unmanned ECS,since it directly influences the planning of digging trajectories and energy consumption.Load prediction of ECS mainly consists of two types of methods:physics-based modeling and data-driven methods.The former approach is based on known physical laws,usually,it is necessarily approximations of reality due to incomplete knowledge of certain processes,which introduces bias.The latter captures features/patterns from data in an end-to-end manner without dwelling on domain expertise but requires a large amount of accurately labeled data to achieve generalization,which introduces variance.In addition,some parts of load are non-observable and latent,which cannot be measured from actual system sensing,so they can’t be predicted by data-driven methods.Herein,an innovative hybrid physics-informed deep neural network(HPINN)architecture,which combines physics-based models and data-driven methods to predict dynamic load of ECS,is presented.In the proposed framework,some parts of the theoretical model are incorporated,while capturing the difficult-to-model part by training a highly expressive approximator with data.Prior physics knowledge,such as Lagrangian mechanics and the conservation of energy,is considered extra constraints,and embedded in the overall loss function to enforce model training in a feasible solution space.The satisfactory performance of the proposed framework is verified through both synthetic and actual measurement dataset.

EV Charging Station Load Prediction in Coupled Urban Transportation and Distribution Networks

The increasingly large number of electric vehicles(EVs)has resulted in a growing concern for EV charging station load prediction for the purpose of comprehensively evaluating the influence of the charging load on distribution networks.To address this issue,an EV charging station load predictionmethod is proposed in coupled urban transportation and distribution networks.Firstly,a finer dynamic urban transportation network model is formulated considering both nodal and path resistance.Then,a finer EV power consumption model is proposed by considering the influence of traffic congestion and ambient temperature.Thirdly,the Monte Carlo method is applied to predict the distribution of EVcharging station load based on the proposed dynamic urban transportation network model and finer EV power consumption model.Moreover,a dynamic charging pricing scheme for EVs is devised based on the EV charging station load requirements and the maximum thresholds to ensure the security operation of distribution networks.Finally,the validity of the proposed dynamic urban transportation model was verified by accurately estimating five sets of test data on travel time by contrast with the BPR model.The five groups of travel time prediction results showed that the average absolute percentage errors could be improved from 32.87%to 37.21%compared to the BPR model.Additionally,the effectiveness of the proposed EV charging station load prediction method was demonstrated by four case studies in which the prediction of EV charging load was improved from27.2 to 31.49MWh by considering the influence of ambient temperature and speed on power energy consumption.

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 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.

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.

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).

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.

MDLB:a metadata dynamic load balancing mechanism based on reinforcement learning

With the growing amount of information and data, object-oriented storage systems have been widely used in many applications, including the Google File System, Amazon S3, Hadoop Distributed File System, and Ceph, in which load balancing of metadata plays an important role in improving the input/output performance of the entire system. Unbalanced load on the metadata server leads to a serious bottleneck problem for system performance. However, most existing metadata load balancing strategies, which are based on subtree segmentation or hashing, lack good dynamics and adaptability. In this study, we propose a metadata dynamic load balancing(MDLB) mechanism based on reinforcement learning(RL). We learn that the Q_learning algorithm and our RL-based strategy consist of three modules, i.e., the policy selection network, load balancing network, and parameter update network. Experimental results show that the proposed MDLB algorithm can adjust the load dynamically according to the performance of the metadata servers, and that it has good adaptability in the case of sudden change of data volume.

Novel cyber-physical collaborative detection and localization method against dynamic load altering attacks in smart energy grids

Owing to the integration of energy digitization and artificial intelligence technology,smart energy grids can realize the stable,efficient and clean operation of power systems.However,the emergence of cyber-physical attacks,such as dynamic load-altering attacks(DLAAs)has introduced great challenges to the security of smart energy grids.Thus,this study developed a novel cyber-physical collaborative security framework for DLAAs in smart energy grids.The proposed framework integrates attack prediction in the cyber layer with the detection and localization of attacks in the physical layer.First,a data-driven method was proposed to predict the DLAA sequence in the cyber layer.By designing a double radial basis function network,the influence of disturbances on attack prediction can be eliminated.Based on the prediction results,an unknown input observer-based detection and localization method was further developed for the physical layer.In addition,an adaptive threshold was designed to replace the traditional precomputed threshold and improve the detection performance of the DLAAs.Consequently,through the collaborative work of the cyber-physics layer,injected DLAAs were effectively detected and located.Compared with existing methodologies,the simulation results on IEEE 14-bus and 118-bus power systems verified the superiority of the proposed cyber-physical collaborative detection and localization against DLAAs.

On-Line Predicting Behaviors of Jobs in Dynamic Load Balancing

A key issue of dynamic load balancing in a loosely coupled distributed systemis selecting appropriate jobs to transfer. In this paper, a job selection policybased on on-line predicting behaviors of jobs is proposed. Thacing is used atthe beginning of execution of a job to predict the approkimate execution timeand resource requirements of the job so as to make a correct decision aboutwhether transferring the job is worthwhile. A dynamic load balancer using thejob selection policy has been implemelited. Experimelital measurement resultsshow that the policy proposed is able to improve mean response time of jobsand resource utilization of systems substantially.

Strategy and Simulation of Adaptive RID for Distributed Dynamic Load Balancing in Parallel Systems

Dynamic load balancing schemes are significant for efficiently executing nonuniform problems in highly parallel multicomputer systems. The objective is to minimize the total execution time of single applications. This paper has proposed an ARID strategy for distributed dynamic load balancing. Its principle and control protocol are described, and the communication overhead, the effect on system stability and the performance efficiency are analyzed. Finally,simulation experiments are carried out to compare the adaptive strategy with other dynamic load balancing schemes.

Research on dynamic load balancing of data flow under big data platform

In the big data platform,because of the large amount of data,the problem of load imbalance is prominent.Most of the current load balancing methods have problems such as high data flow loss rate and long response time;therefore,more effective load balancing method is urgently needed.Taking HBase as the research subject,the study analyzed the dynamic load balancing method of data flow.First,the HBase platform was introduced briefly,and then the dynamic load-balancing algorithm was designed.The data flow was divided into blocks,and then the load of nodes was predicted based on the grey prediction GM(1,1)model.Finally,the load was migrated through the dynamic adjustable method to achieve load balancing.The experimental results showed that the accuracy of the method for load prediction was high,the average error percentage was 0.93%,and the average response time was short;under 3000 tasks,the response time of the method designed in this study was 14.17%shorter than that of the method combining TV white space(TVWS)and long-term evolution(LTE);the average flow of nodes with the largest load was also smaller,and the data flow loss rate was basically 0%.The experimental results show the effectiveness of the proposed method,which can be further promoted and applied in practice.

Global Dynamic Load Balancing Based on Data-omitting （GDLBD）

E-mail, WWW, FTP, BT and QQlive, etc. axe used more and more universal because the advantage of Internet, but the data-omitting phenomenon is a headache problem. In this paper, we consider the problem of allocating a large number of independent, unequal-sized loads exchanged between servers and clients or between themselves when there are data-omitting, and we describe the dynamic load balancing problems by intro- ducing some parameters αij, we use an undirected graph to model the platform, where servers （CPU time, disk memory） can have different speeds of computation and communication. Because the number of loads is large, we focus on the question of determining the optimal dynamic load balancing scheduling strategy （splittable strategy） for each processor （the fraction of time spent computing and the fraction of time spent communication with each neighbor）. We show that finding the optimal dynamic load balancing state can be solved using a linear programming approach by adding more constrains and, thus, in polynomial time. And make the execute time minimization.

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.

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.

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.