Dynamic Load Balancing Approach Research Articles

Improving fog resource utilization with a dynamic round-robin load balancing approach

In fog computing, load balancing is an important research problem. It focuses on efficiently assigning tasks to fog nodes and minimizing delay in real-time applications. The traditional round-robin algorithm assigns tasks in a rotating manner among fog nodes, but it can send tasks to the cloud too early, leading to increased delays. To solve this problem, this paper introduces an improved round-robin algorithm that takes a dynamic approach to balancing the use of fog resources. The new model aims to improve load balancing in fog computing by distributing tasks more evenly among fog nodes, reducing dependence on cloud computing, and making better use of fog resources. The improved algorithm helps fog computing systems run more efficiently, reduces delays in real-time applications, and lowers the costs associated with cloud use. The results show that the proposed load balancing algorithm is key to optimizing fog resource use, improving system efficiency, and reducing task completion times in distributed computing systems.

Accurate and rapid reactive flow simulations using dynamic load balancing and sparse analytical Jacobian approach

The present study introduces a rapid and accurate customized solver on the OpenFOAM platform for large-scale industrial computations. Specifically, a sparse analytical Jacobian approach utilizing the SpeedCHEM library was implemented to enhance the efficiency of the ordinary differential equation solver. The dynamic load balancing code was used to distribute computational workloads uniformly across multiple processes. Optimization continued with open multi-processing to improve parallel computing efficiency and the local time stepping scheme to maximize individual cell time steps. The effectiveness and robustness of the customized solver were first validated using Sandia flames D–F as benchmarks. The results showed that the customized solver exhibited better strong scaling characteristics and led to a speed increase of up to 30 times for two-dimensional Sandia flame D calculations. The numerical predictions for temperature and species distribution closely matched the experimental trends, confirming the accuracy of the solver. Subsequently, a three-dimensional numerical study on a 10 kW ammonia co-combustion furnace was conducted, exploring the performance of the solver in large-scale reactive simulations. Results analysis indicated that the acceleration capability was reduced due to increased communication overhead between processors, achieving up to 7.06 times speed-up. However, as the size of the reaction mechanism increases, better acceleration capabilities can be demonstrated. The numerical predictions could closely replicate experimental trends, effectively predicting NO emission trends within the combustion furnace. This study offers one viable solution for rapid and accurate calculations in the OpenFOAM platform, which could be applied in the subsequent ammonia industrial combustion processes.

Comprehensive review of load balancing in cloud computing system

Load balancing plays a critical role in optimizing resource utilization and enhancing performance in cloud computing systems. As cloud environments grow in scale and complexity, efficient load balancing mechanisms become increasingly vital. This paper presents a comprehensive review of load balancing techniques in cloud computing systems, with a focus on their applicability, advantages, and limitations. The review encompasses both static and dynamic load balancing approaches, evaluating their effectiveness in addressing the challenges posed by cloud infrastructure, such as heterogeneity, scalability, and variability in workload demands. Furthermore, the review examines load balancing algorithms considering factors such as resource utilization, response time, fault tolerance, and energy efficiency. Additionally, the impact of load balancing on cloud performance metrics, including throughput, latency, and scalability, is analyzed. This review aims to provide insights into the state-of-the-art load balancing strategies and serve as a valuable resource for researchers, practitioners, and system designers involved in the development and optimization of cloud computing systems.

Dynamic Load Balancing in Cloud Computing: Optimized RL-Based Clustering with Multi-Objective Optimized Task Scheduling

Dynamic load balancing in cloud computing is crucial for efficiently distributing workloads across available resources, ensuring optimal performance. This research introduces a novel dynamic load-balancing approach that leverages a deep learning model combining Convolutional Neural Networks (CNNs) and Recurrent Neural Networks (RNNs) to calculate load values for each virtual machine (VM). The methodology aims to enhance cloud performance by optimizing task scheduling and stress distribution. The proposed model employs a dynamic clustering mechanism based on computed loads to categorize VMs into overloaded and underloaded clusters. To improve clustering efficiency, the approach integrates Reinforcement Learning (RL) with a sophisticated Hybrid Lyrebird Falcon Optimization (HLFO) algorithm. HLFO merges the Lyrebird Optimization Algorithm (LOA) and Falcon Optimization Algorithm (FOA), enhancing the effectiveness of load balancing. A Multi-Objective Hybrid Optimization model is introduced to optimize task scheduling while considering Quality of Service (QoS) parameters, including makespan minimization, energy consumption reduction, balanced CPU utilization, efficient memory usage, and task prioritization. The implementation, conducted in Python and CloudSim, demonstrates the model’s ability to effectively allocate work between virtual machines (VMs) and physical machines (PMs), resulting in improved resource utilization, shortened makespan, enhanced CPU usage, and rigorous assessments affirming its efficacy. This research addresses the complexity of dynamic load balancing in cloud environments by combining deep learning, reinforcement learning, and hybrid optimization techniques, offering a comprehensive solution to optimize cloud performance under varying workloads and resource conditions.

Dynamic load balancing in IoT environments using type-2 fuzzy logic systems

In recent years, the Internet of Things (IoT) has rapidly emerged as an essential technology, enabling seamless communication between billions of interconnected devices. These devices generate a massive amount of data that requires efficient management to ensure optimum performance in IoT environments. Dynamic load balancing (DLB) is a crucial technique employed to distribute workloads evenly across multiple computing resources, thereby reducing latency and increasing the overall efficiency of IoT networks. This paper presents a novel DLB approach based on type-2 fuzzy logic systems (T2FLS) to enhance the performance and reliability of IoT environments. The proposed T2FLS-based DLB technique addresses the inherent uncertainties and imprecisions in IoT networks by considering various parameters, such as workload, processing capability, and communication latency. A comprehensive performance evaluation is carried out to compare the proposed method with traditional DLB approaches. Simulation results demonstrate that the T2FLS-based DLB technique significantly improves the network’s response time, throughput, and energy efficiency, while also providing better adaptability and robustness to dynamic changes in IoT environments. This study contributes to the advancement of DLB techniques in IoT networks and lays the groundwork for further research in this field.

Optimal Rate-Matrix Pruning For Heterogeneous Systems

We consider large-scale load balancing systems where processing time distribution of tasks depend on both task and server types. We analyze the system in the asymptotic regime where the number of task and server types tend to infinity proportionally to each other. In such heterogeneous setting, popular policies like Join Fastest Idle Queue (JFIQ), Join Fastest Shortest Queue (JFSQ) are known to perform poorly and they even shrink the stability region. Moreover, to the best of our knowledge, in this setup, finding a scalable policy with provable performance guarantee has been an open question prior to this work. In this paper, we propose and analyze two asymptotically delay-optimal dynamic load balancing approaches: (a) one that efficiently reserves the processing capacity of each server for "good" tasks and route tasks under the Join Idle Queue policy; and (b) a speed-priority policy that increases the probability of servers processing tasks at a high speed. Introducing a novel analytical framework and using the mean-field method and stochastic coupling arguments, we prove that both policies above achieve asymptotic zero queueing, whereby the probability that a typical task is assigned to an idle server tends to 1 as the system scales.

Dynamic load balancing in IoT-enabled WSNs using fuzzy logic-based control

The rapid expansion of Internet of Things (IoT) applications and the increasing complexity of Wireless Sensor Networks (WSNs) have created a critical need for efficient load balancing strategies. This paper proposes a dynamic load balancing approach for IoT-enabled WSNs using a fuzzy logic-based control mechanism. The proposed method aims to optimize energy consumption, reduce latency, and enhance network lifetime by intelligently distributing the workload among sensor nodes. The fuzzy logic controller takes into account various parameters, such as energy levels, communication distances, and node density, to make adaptive load balancing decisions. The control mechanism allocates tasks to the most suitable nodes, ensuring efficient utilization of resources and preventing overloading of individual nodes. Simulations are conducted in diverse network scenarios to validate the performance of the proposed approach. Results demonstrate significant improvements in energy efficiency, latency reduction, and overall network lifetime compared to traditional load balancing techniques. The fuzzy logic-based control mechanism proves to be a promising solution for addressing the dynamic and resource-constrained nature of IoT-enabled WSNs, paving the way for more robust and resilient networks in various IoT applications.

Light Weight Native Edge Load Balancers for Edge Load Balancing

Edge computing has become an essential aspect of modern computing systems. Edge computing involves processing data at the edge of the network, closer to where the data is generated. The ability to process data in real-time at the edge provides various benefits such as lower latency, improved response times, and reduced network congestion. Load balancing is a critical component of edge computing, which distributes the workload across multiple edge devices, ensuring that the workload is evenly distributed. This paper discusses current trends in edge computing load balancing techniques, including static, dynamic, and hybrid load balancing approaches.

DSMLB: Dynamic switch-migration based load balancing for software-defined IoT network

The deployment of multiple controllers in Software-Defined Internet of Things (SD-IoT) networks enhance the distributed control plane scalability and reliability. With the rapid advancement of IoT, millions of smart devices generate enormous amounts of IoT traffic, causing significant challenges for the network to acquire the better Quality-of-Service (QoS) to the user. The control plane load management is crucial due to the dynamic nature of IoT networks and the heterogeneity of IoT devices in terms of flow generation rate. The load distribution among SD-IoT controllers relies on their available capacity to ensure optimal load balancing performance. The dynamic switch migration method was proposed in prior findings to handle load balancing distribution among controllers. However, the migration efficiency of conventional approaches is limited due to inefficient load balancing performance of the control plane after the migration of switch, leading to additional migration overhead on the network. Taking this into account, we propose a dynamic switch migration-based load balancing approach (DSMLB) to prevent control plane overhead and distribute traffic efficiently while considering heterogeneous IoT devices. The proposed DSMLB scheme measures the real-time load ratio to the mean load ratio of each controller by describing various load metrics and selecting the target controller by optimizing the migration efficiency with residual controller resource utilization. When choosing the candidate switches from the associated overloaded controller, DSMLB considers the migration efficiency and load balancing degree simultaneously for the fastest load reduction and enhances the load balancing performance. The simulation results show that DSMLB outperforms conventional approaches for efficient load balancing performance on a distributed control plane by reducing the controller response time up to 38.6% and migration cost about 45.5% on average. Moreover, DSMLB also improves controller load balancing rate and reduces communication overhead.

Dynamic load balancing with over decomposition in plasma plume simulations

An electric propulsion plasma plume simulation employs the Particle-in-Cell (PIC) model for heavy species (i.e. ions and neutral atoms) and yields a highly non-uniform particle distribution at steady state. For parallel simulations, partitioning the computational domain uniformly and evenly assigning the subdomains to MPI processes would never lead to properly balanced loads across MPI processes. For this reason, a patch-based dynamic load balancing method with over-decomposition and Hilbert space-filling curve has been implemented into the Thermophysics Universal Research Framework (TURF). The data transfer is accomplished by utilizing TURF's serialization and deserialization feature, in which the tree hierarchical object structure is copied into a contiguous memory block of data, and the tree hierarchy is reconstructed after the data transfer. This generalized dynamic load balancing approach allows for the same routine to be used for any models besides the PIC model in TURF (e.g. fluid, continuum kinetic, hybrid models, etc). This paper first introduces individual pieces of TURF that enable dynamic load balancing when they are combined. Then, the dynamic load balancing method is demonstrated in three different particle simulations, showing performance gains when the number of subdomains is larger than that of MPI processes. The benefit is even more notable in simulations with highly non-uniform particle distributions at steady state, commonly seen in plasma plume simulations.

Cloud Dynamic Load Balancing and Reactive Fault Tolerance Techniques: A Systematic Literature Review (SLR)

The computational cloud aims to move traditional computing from personal computers to cloud providers on the internet. Cloud security represents an important research area. Confidentiality, integrity, and availability are the main cloud security characteristics addressed. Cloud providers apply dynamic load balancing and reactive fault tolerance techniques to build secure cloud services to achieve high service availability. Dynamic cloud load balancing approaches distribute submitted tasks to virtual machines during tasks execution and the load of virtual machines is updated based on the system’s state. Reactive cloud fault tolerance is activated for system process failures after failure effectively happens. Reactive cloud fault tolerance handles failure after the fault has occurred. Despite the significance of dynamic load balancing and reactive fault tolerance techniques and mechanisms, few reviews focus on these approaches in a systematic, unbiased method focusing on integrating cloud dynamic load balancing and reactive fault tolerance techniques. This paper conducts a systematic literature review of the existing literature concerning reactive fault tolerance, dynamic load balancing, and their integration in their basic approaches, types, frameworks, and future directions.

Dynamic load balancing assisted optimized access control mechanism for Edge‐Fog‐Cloud network in Internet of Things environment

AbstractThe modern age networks are supposed to be connected, agile, programmable, and load efficient to counter the side‐effects of an imbalanced network such as network congestion, higher transmission cost, low reliability, and so forth. The wide number of electronic devices around us have a great potential to realize the concept of a connected world. Internet of Things (IoT) is an effort of the research community to realize this concept, and cloud computing plays an important role in this realization. However, fog and edge computing are more prominent solutions for small power devices and latency sensitive applications. As IoT sensors generate huge volume of data, and the IoT environment comprises of multiple applications and traffic conditions, a network traffic based dynamic load balancing approach is needed to optimize the overall network performance. This work proposes a layer based Edge‐Fog‐Cloud network architecture to distribute the network traffic load in an IoT environment. In addition to this, a load balancing assisted optimized access control mechanism is discussed to improve the network load conditions further. The proposed mechanism is tested using Amazon web services platform and the achieved results validate the effectiveness of the proposed approach. The simulation results show an average improved CPU utilization rate of 10.13%, 10.01%, 10.82%, 8.78%, and 11.91% in five different experiments conducted.

Adaptive Neuro Fuzzy Interference and PNN Memory Based Grey Wolf Optimization Algorithm for Optimal Load Balancing

In recent years, cloud computing provides a spectacular platform for numerous users with persistent and alternative varying requirements. In the cloud environment, security and service availability are the two most significant factors during the data encryption process. For providing optimal service availability, it is necessary to establish a load balancing technique that is capable of balancing the request from diverse nodes present in the cloud. This paper aims in establishing a dynamic load balancing technique using the APMG approach. Here in this paper, we integrated adaptive neuro-fuzzy interference system-polynomial neural network as well as memory-based grey wolf optimization algorithm for optimal load balancing. The memory-based grey wolf optimization algorithm is employed to enhance the precision of ANFIS-PNN and to maximize the locations of the membership functions respectively. Also, two significant factors namely the turnaround time and CPU utilization involved in optimal load balancing scheme are evaluated. Finally, the performance evaluation of the proposed MG-ANFIS based dynamic load balancing approach is compared with various other load balancing approaches to determine the system performances.

Dynamic Load Balancing in Parallel Execution of Cellular Automata

The allocation of the computational load across different processing elements is an important issue in parallel computing. Indeed, an unbalanced load distribution can strongly affect the performances of a parallel system caused by an excess of synchronization idle times due to less loaded processes waiting for more loaded ones. In this article, we focus on the load balancing issues in the context of the parallel execution of spatial-related applications where the domain space is partitioned in regions that are assigned to different processing elements. In particular, without loss of generality, we consider the well-known spatial-related Cellular Automata computational paradigm for evaluating the proposed dynamic load balancing approach. The main contribution of this article is the derivation of simple closed-form expressions that allow to compute the optimal workload assignment in a dynamic fashion, with the goal of guaranteeing a fully balanced workload distribution during the parallel execution. Based on these expressions, an algorithm for balanced execution of cellular automata is presented and implemented using the MPI technology. Eventually, an experimental section practically shows the behaviour of the proposed dynamic load balancing approach and proves its performance improvement, compared to the not-balanced version, as witnessed by the appreciable reduction of execution times.

A Dynamic Multi–Objective Approach for Dynamic Load Balancing in Heterogeneous Systems

Modern standards in High Performance Computing (HPC) have started to consider energy consumption and power draw as a limiting factor. New and more complex architectures have been introduced in HPC systems to afford these new restrictions, and include coprocessors such as GPGPUs for intensive computational tasks. As systems increase in heterogeneity, workload distribution becomes a more core problem to achieve the maximum efficiency in every computational component. We present a Multi-Objective Dynamic Load Balancing (DLB) approach where several objectives can be applied to tune an application. These objectives can be dynamically exchanged during the execution of an algorithm to better adapt to the resources available in a system. We have implemented the Multi-Objective DLB together with a generic heuristic engine, designed to perform multiple strategies for DLB in iterative problems. We also present Ull Multiobjective Framework (UllMF), an open-source tool that implements the Multi-Objective generic approach. UllMF separates metric gathering, objective functions to be optimized and load balancing algorithms, and improves code portability using a simple interface to reduce the costs of new implementations. We illustrate how performance and energy consumption are improved for the implemented techniques, and analyze their quality using different DLB techniques from the literature.

Dynamic Load Balancing Using Actual Workload Traces Based on Central Processing Unit Temperatures

AbstractWith the rapid growth in demand for distributed computing, data centers are a critical physical component of the “cloud.” Recent studies show that the energy consumption of data centers for both cooling and computing keeps increasing, and the growth in server power densities makes it ever more challenging to keep the servers below their maximum operating temperature. This paper presents a new dynamic load-balancing approach based on individual server central processing unit (CPU) temperatures. In this approach, a load balancer assigns a task in real time to a server based on the objective to keep the CPU temperatures below a maximum value. Experimental studies are conducted in a single rack based on production workload traces of Google clusters. This study also compares the performance of this method with two other load balancing approaches, Round Robin, and a CPU utilization-based method in terms of temperature distributions, local fan rotation speeds, system loads, and server processing times. Furthermore, we investigate how the effect of the proposed load balancing changes with different assumed applications run on servers. The results indicate that this new method can more effectively reduce both server CPU temperatures and local fan rotation speed in a rack especially for the most of web applications.

DDOps: dual-direction operations for load balancing on non-dedicated heterogeneous distributed systems

Given the increasing prevalence of compute/data intensive applications, the explosive growth in data, and the emergence of cloud computing, there is an urgent need for effective approaches to support such applications in non-dedicated heterogeneous distributed environments. This paper proposes an efficient technique for handling parallel tasks, while dynamically maintaining load balancing. Such tasks include concurrently downloading files from replicated sources; simultaneously using multiple network interfaces for message transfers; and executing parallel computations on independent distributed processors. This technique, DDOps, (Dual Direction Operations) enables efficient utilization of available resources in a parallel/distributed environment without imposing any significant control overhead. The idea is based on the notion of producer pairs that perform tasks in parallel from opposite directions and the consumers that distribute and control the work and receive and combine the results. Most dynamic load balancing approaches require prior knowledge and/or constant monitoring at run time. In DDOps, load balancing does not require prior knowledge or run-time monitoring. Rather, load balancing is automatically inherent as the tasks are handled from the opposite directions, allowing the processing to continue until the producers meet indicating the completion of all tasks at the same time. Thus DDOps is most suitable for heterogeneous environments where resources vary in specifications, locations, and operating conditions. In addition, since DDOps does not require producers to communicate at all, the network effect is minimized.

User Demand Aware Grid Scheduling Model with Hierarchical Load Balancing

Grid computing is a collection of computational and data resources, providing the means to support both computational intensive applications and data intensive applications. In order to improve the overall performance and efficient utilization of the resources, an efficient load balanced scheduling algorithm has to be implemented. The scheduling approach also needs to consider user demand to improve user satisfaction. This paper proposes a dynamic hierarchical load balancing approach which considers load of each resource and performs load balancing. It minimizes the response time of the jobs and improves the utilization of the resources in grid environment. By considering the user demand of the jobs, the scheduling algorithm also improves the user satisfaction. The experimental results show the improvement of the proposed load balancing method.

Monte Carlo simulation on heterogeneous distributed systems: A computing framework with parallel merging and checkpointing strategies

This paper introduces an end-to-end framework for efficient computing and merging of Monte Carlo simulations on heterogeneous distributed systems. Simulations are parallelized using a dynamic load-balancing approach and multiple parallel mergers. Checkpointing is used to improve reliability and to enable incremental results merging from partial results. A model is proposed to analyze the behavior of the proposed framework and help tune its parameters. Experimental results obtained on a production grid infrastructure show that the model fits the real makespan with a relative error of maximum 10%, that using multiple parallel mergers reduces the makespan by 40% on average, that checkpointing enables the completion of very long simulations and that it can be used without penalizing the makespan.

Improved the Energy of Ad Hoc On-Demand Distance Vector Routing Protocol

In the last few years, most of the proposed routing protocols problems in mobile ad-hoc networks (MANET) is how to improve the energy and how to maximize the network lifetime, the network node energy-limited routing protocol research is a central issue, IETF's MANET working group has proposed several classical routing protocols, which are the shortest route, but without considering the energy factor associated with minimum hop-routing. This paper proposes simple but efficient algorithm to balance energy consumption among all participating nodes will extending the network lifetime of the batteries that power these mobile ad hoc network based on one of the most important routing protocols Ad hoc On-Demand Distance Vector. Our approach is a dynamic distributed load balancing approach that avoids power congested nodes and chooses paths that are easily loaded.