Load Balancing Scheduling Research Articles

In-depth analysis of fault tolerant approaches integrated with load balancing and task scheduling

AbstractOne of the most important and frequently reported issues in cloud computing is fault tolerance. Implementing Fault Tolerance (FT) in cloud computing is challenging due to the diverse architecture and the complex interrelationships of system resources. The primary objective of this article is to critically review and analyze the fault-tolerant models with two other related aspects, i.e., load balancing and scheduling which is the peak need of the time and was not adequately addressed in the recent related surveys. In this paper, we present the systematic and comparative analysis of these hybrid models highlighting their limitations in different parameters, cases, and scenarios. Our analysis reveals that Proactive, Reactive, and Resilient approaches are commonly utilized to address system failure in the cloud. Also, it was found that a thorough study of intelligent fault tolerance approaches, also known as resilient fault tolerance, was overseen to determine their efficacy over conventional approaches. Additionally, the survey includes the discussion part which presents a unique in-depth analysis of hybrid fault tolerant approaches with respect to the handling of different faults and parameters. To illustrate the reviewed observations, a detailed statistical analysis has been conducted and presented graphically to provide insights into the study and simultaneously highlight further research in this area. Our analysis includes the critical role of these hybrid fault-tolerant models in accomplishing high accessibility and reliability in emerging computing systems thereby providing valuable insights for future researchers of the field. We have also provided a broad roadmap that charts strategies for facing the discussed cloud challenges. The study provides valuable contributions to the field.

DuCFF: A Dual-Channel Feature-Fusion Network for Workload Prediction in a Cloud Infrastructure

Cloud infrastructures are designed to provide highly scalable, pay-as-per-use services to meet the performance requirements of users. The workload prediction of the cloud plays a crucial role in proactive auto-scaling and the dynamic management of resources to move toward fine-grained load balancing and job scheduling due to its ability to estimate upcoming workloads. However, due to users’ diverse usage demands, the changing characteristics of workloads have become more and more complex, including not only short-term irregular fluctuation characteristics but also long-term dynamic variations. This prevents existing workload-prediction methods from fully capturing the above characteristics, leading to degradation of prediction accuracy. To deal with the above problems, this paper proposes a framework based on a dual-channel temporal convolutional network and transformer (referred to as DuCFF) to perform workload prediction. Firstly, DuCFF introduces data preprocessing technology to decouple different components implied by workload data and combine the original workload to form new model inputs. Then, in a parallel manner, DuCFF adopts the temporal convolution network (TCN) channel to capture local irregular fluctuations in workload time series and the transformer channel to capture long-term dynamic variations. Finally, the features extracted from the above two channels are further fused, and workload prediction is achieved. The performance of the proposed DuCFF’s was verified on various workload benchmark datasets (i.e., ClarkNet and Google) and compared to its nine competitors. Experimental results show that the proposed DuCFF can achieve average performance improvements of 65.2%, 70%, 64.37%, and 15%, respectively, in terms of Mean Absolute Error (MAE), Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE) and R-squared (R2) compared to the baseline model CNN-LSTM.

A systematic literature review for load balancing and task scheduling techniques in cloud computing

Cloud computing is an emerging technology composed of several key components that work together to create a seamless network of interconnected devices. These interconnected devices, such as sensors, routers, smartphones, and smart appliances, are the foundation of the Internet of Everything (IoE). Huge volumes of data generated by IoE devices are processed and accumulated in the cloud, allowing for real-time analysis and insights. As a result, there is a dire need for load-balancing and task-scheduling techniques in cloud computing. The primary objective of these techniques is to divide the workload evenly across all available resources and handle other issues like reducing execution time and response time, increasing throughput and fault detection. This systematic literature review (SLR) aims to analyze various technologies comprising optimization and machine learning algorithms used for load balancing and task-scheduling problems in a cloud computing environment. To analyze the load-balancing patterns and task-scheduling techniques, we opted for a representative set of 63 research articles written in English from 2014 to 2024 that has been selected using suitable exclusion-inclusion criteria. The SLR aims to minimize bias and increase objectivity by designing research questions about the topic. We have focused on the technologies used, the merits-demerits of diverse technologies, gaps within the research, insights into tools, forthcoming opportunities, performance metrics, and an in-depth investigation into ML-based optimization techniques.

Tetris: Proactive Container Scheduling for Long-Term Load Balancing in Shared Clusters

<i>Tetris:</i> Proactive Container Scheduling for Long-Term Load Balancing in Shared Clusters

Deep reinforcement learning-based resource scheduling for energy optimization and load balancing in SDN-driven edge computing

Traditional techniques for edge computing resource scheduling may result in large amounts of wasted server resources and energy consumption; thus, exploring new approaches to achieve higher resource and energy efficiency is a new challenge. Deep reinforcement learning (DRL) offers a promising solution by balancing resource utilization, latency, and energy optimization. However, current methods often focus solely on energy optimization for offloading and computing tasks, neglecting the impact of server numbers and resource operation status on energy efficiency and load balancing. On the other hand, prioritizing latency optimization may result in resource imbalance and increased energy waste. To address these challenges, we propose a novel energy optimization method coupled with a load balancing strategy. Our approach aims to minimize overall energy consumption and achieve server load balancing under latency constraints. This is achieved by controlling the number of active servers and individual server load states through a two stage DRL-based energy and resource optimization algorithm. Experimental results demonstrate that our scheme can save an average of 19.84% energy compared to mainstream reinforcement learning methods and 49.60% and 45.33% compared to Round Robin (RR) and random scheduling, respectively. Additionally, our method is optimized for reward value, load balancing, runtime, and anti-interference capability.

Optimized Resource Management and Dynamic Routing Protocol for Wireless Sensor Networks Through Load Balancing, Packet Scheduling, and Intelligent Clustering

Heterogeneous Wireless Sensor Networks (HWSNs) are pivotal for providing weather-related event data, enabling universal location access, and facilitating remote monitoring through multi-hop transmission. Efficient energy utilization is critical in ensuring the optimal functioning of HWSNs. Previously, Compressive Sensing (CS) technology was established to enhance communication efficiency within HWSNs. While previous methods were effective in managing energy consumption and reducing transmission delays across network devices, the increased number of devices has impacted their efficacy. Consequently, energy becomes a vital limitation in constructing HWSNs. In order to address these challenges, this study introduces Load Balancing and Packet Scheduling with Intelligent Clustering based Improved Routing Protocol (LPICR). This integrates load balancing, packet scheduling, intelligent clustering, and enhanced routing techniques. The protocol is structured into three main categories: intelligent route selection, load balancing-based Cluster Head (CH) selection, and path scheduling. Initially, an efficient opportunistic routing is conducted by the intelligent route selection process. This routing method minimizes data forwarding during communication and significantly decreases energy consumption in the HWSN. Furthermore, by using a load balancing-oriented procedure for selecting cluster heads, the system achieves efficient determination of cluster heads and construction of clusters, resulting in the most efficient use of energy in communication. Path scheduling reduces the probability of delays by facilitating effective data flow between the source and destination in the HWSN. The NS2 platform is used to implement the proposed LPICR-HWSN protocol. The calculation of the result and comparison analysis is considered for the parameters are Data loss rate, communication time, packet success rate, malicious detection ratio, throughput, Routing overhead and energy efficiency. The results are thoroughly investigated by accounting for factors like the quantity of nodes and the varying speed of the network. To assess the efficacy of this proposed protocol, we conduct a comparative analysis using established methodologies such as CDAS-WSN, EEPC-WSN, TCCS-WSN, and MTODS-HWSN. The results suggest that the proffered LPICR-HWSN model demonstrates superior performance compared to previous methods.

Automated Backend Allocation for Multi-Model, On-Device AI Inference

On-Device Artificial Intelligence (AI) services such as face recognition, object tracking and voice recognition are rapidly scaling up deployments on embedded, memory-constrained hardware devices. These services typically delegate AI inference models for execution on CPU and GPU computing backends. While GPU delegation is a common practice to achieve high speed computation, the approach suffers from degraded throughput and completion times under multi-model scenarios, i.e., concurrently executing services. This paper introduces a solution to sustain performance in multi-model, on-device AI contexts by dynamically allocating a combination of CPU and GPU backends per model. The allocation is feedback-driven, and guided by a knowledge of model-specific, multi-objective pareto fronts comprising inference latency and memory consumption. Our backend allocation algorithm that runs online per model, and achieves 25-100% improvement in throughput over static allocations as well as load-balancing scheduler solutions targeting multi-model scenarios.

Implementation of Improved Scheduling Load Balancing Algorithm in Cloud Environment

Implementation of Improved Scheduling Load Balancing Algorithm in Cloud Environment

Effective task scheduling based on interactive autodidactic school algorithm for cloud computing

The topic of load balanced task scheduling has emerged as a prominent and intricate area of study within the realm of Cloud computing. Swarm intelligence-based meta-heuristic algorithms are commonly considered more suitable for the purposes of Cloud scheduling and load balancing. These algorithms employ a combination of local and global search strategies in order to ascertain the ideal location. To achieve an optimal mapping strategy for task allocation to resources, it is imperative to find a suitable equilibrium between local and global search techniques, since this approach has demonstrated significant efficacy. This research introduces a new approach to task scheduling using the Autodidactic Interactive School Optimization Algorithm (IASOA). The objective of this method is to decrease the time required for job execution while also enhancing throughput. The assessment of the suggested methodology has been executed, and a comparative analysis has been performed with five established algorithms in relation to makespan and throughput. The tests were subsequently extended to encompass a comparative analysis of the suggested methodology alongside four other established meta-heuristic scheduling methodologies. The study of the simulated experimentation reveals that the proposed approach yielded noteworthy advantages in makespan and throughput, with improvements of up to 10% and 60% respectively.

Automated Backend Allocation for Multi-Model, On-Device AI Inference

On-Device Artificial Intelligence (AI) services such as face recognition, object tracking and voice recognition are rapidly scaling up deployments on embedded, memory-constrained hardware devices. These services typically delegate AI inference models for execution on CPU and GPU computing backends. While GPU delegation is a common practice to achieve high speed computation, the approach suffers from degraded throughput and completion times under multi-model scenarios, i.e. concurrently executing services. This paper introduces a solution to sustain performance in multi-model, on-device AI contexts by dynamically allocating a combination of CPU and GPU backends per model. The allocation is feedback-driven, and guided by a knowledge of model-specific, multi-objective pareto fronts comprising inference latency and memory consumption. Primary contribution of this paper is a backend allocation algorithm that runs online per model, and achieves 25-100% improvement in throughput over static allocations as well as load-balancing scheduler solutions targeting multi-model scenarios. Other noteworthy contributions include a novel pareto front estimator that runs on-device, and also a software-based GPU profiler with a lightweight algorithm to detect changing GPU workloads. Specifically, the pareto front estimator outperforms state of the art algorithms NSGA-II and SPEA2 by 94% on pareto coverage, and by almost 2x on computational overhead.

Cloud computing: an efficient load balancing and scheduling of task method using a hybrid optimization algorithm

&lt;p&gt;The cloud computing trend on the internet is vital as it allows data and applications to be managed over the internet instead of requiring personal devices. The job of users is scheduled in the resources of the cloud in order to improve performance. Schedu ling tasks is an non - deterministic polynomial (NP) - hard problem, as it may have multiple solutions. Various researchers have proposed different load balancing and job scheduling algorithms to optimize the scheduling process in cloud environments, each with disadvantages. Therefore, this research proposes a novel hybrid load balancing and scheduling of tasks by the whale optimization algo rithm (WOA) and seagull optimization algorithm (SOA) in the cloud. This hybrid proposed whale - seagull optimization algorithm (WSOA) optimizes task scheduling in the cloud b y reducing processing time, response, and execution time, maximizing central processing unit (CPU) utilization, memory utilization, throughput, reliability, and balancing the load. The algorithm is simulated using the CloudSim toolkit package. As compared with existing approaches, simulation results showed better performance in terms of response time, processing time, execution time, CPU utilization, memory utilization, throughput, and reliability and is analyzed by comparing with the harries hawks optimiza tion (HHO), hybrid dragonfly and firefly algorithm (ADA), spider monkey algorithm (SMA) and bird swarm optimization (BSO).&lt;/p&gt;

Region-aware dynamic job scheduling and resource efficiency for load balancing based on adaptive chaotic sparrow search optimization and coalitional game in cloud computing environments

Uneven distribution of workloads represents a significant challenge in cloud data centers, negatively impacting the efficient utilization of resources. To address this problem and optimize the performance-to-profit (PP) ratio, we introduced the Regional Awareness dynamic Scheduling Algorithm (RASA) through a three-phase approach. In the initial phase, tasks are categorized based on critical parameters like CPU usage, memory utilization, and I/O operations, using a task classification model. The second phase involves estimating the CPU, memory, and I/O capacities of each node. Subsequently, a unique merge-and-split-based coalitional game-theoretic process is employed to group nodes into clusters. In the final phase, we have improved task placement by introducing an enhanced Sparrow Search Algorithm (ISSA) to overcome the slow convergence and local optimization issues found in the traditional SSA. We have incorporated the Tent chaotic mapping approach to enhance both global and local search efficiency during this stage. Additionally, we have fine-tuned fair load distribution using the Cauchy mutation process. We performed simulations using the CloudSim toolkit, and the results underscore the RASA algorithm’s superiority in terms of how quickly it converges its precision in task placement and its ability to distribute workloads fairly. Our proposed algorithm achieves a 9% reduction in latency overhead, a 14% decrease in processing time, a 15% reduction in workload imbalance, a 19% decrease in energy consumption, and a 26% decrease in idle periods. Furthermore, it enhances resource availability and efficiency by 22% and 27% respectively, while simultaneously boosting service throughput by 32%.

Phase space load balancing priority scheduling algorithm for cloud computing clusters

Due to the development of new technologies such as the Internet and cloud computing, high requirements have been placed on the storage and management of big data. At the same time, new applications in the cloud computing environment also pose new requirements for cloud storage systems, such as strong scalability and high concurrency. Currently, the existing nosql database system is based on cloud computing virtual resources, supporting dynamic addition and deletion of virtual nodes. Based on the study of phase space reconstruction, the necessity of considering traffic flow as a chaotic time series is analyzed. In addition, offline data migration methods based on load balancing are also studied. Firstly, a data migration model is proposed through analysis, and the factors that affect migration performance are analyzed. Based on this, optimization objectives for migration are proposed. Then, the system design of data migration is presented, and optimization research is conducted from two aspects around the migration optimization objectives: optimizing from the data source layer, and proposing the LBS method to convert data sources into distributed data sources, ensuring the balanced distribution of data and meeting the scalability requirements of the system. This paper applies cloud computing technology and phase space reconstruction to load balancing scheduling algorithms to promote their development.

Review of Load Balancing Algorithms Inspired by Artificial Bee Colony Algorithm in the Cloud Computing

Research interest in cloud-based load balancing and task scheduling has grown rapidly over the last few years. To be more precise, load balancing of virtual machine tasks (VMs) that require nature-inspired algorithms has become an area of particular interest. It is essential to ensure load balancing between VMs as this avoids overloading and underloading VMs, aspects that can cause issues like high-power consumption, increased execution time, and elevated response times, all of which can ultimately cause a system failure. Swarm intelligence is critical when dealing with issues that are difficult to solve and must be overcome using traditional and mathematical techniques. The algorithm was developed by Karaboga in 2005 and is inspired by the foraging behaviors of an artificial bee colony. This algorithm is extremely robust, convergent, and flexible. Another researcher applied the ABC method to load balancing in order to enhance it. In-depth research on load balancing in cloud computing utilizing the ABC method is presented in this review paper. Moreover, this work also discusses some fundamental ideas on the intelligence and characteristics of the swarm. Additionally, the paper provided a detailed explanation of cloud computing, its services, and components, as well as the concept and objectives of load balancing in the cloud

Efficient power management optimization based on whale optimization algorithm and enhanced differential evolution

Daily increases in electricity prices accompany daily increases in energy consumption and use. An effective load-balancing scheduling system is necessary for the lowest cost of use and the lowest cost. Despite these devices having a significant capacity for power consumption, they must find a means to balance the load at a low price. Even if lowering the voltage is challenging, it is possible to do it at the lowest cost. Hybrid Whale Differential Evolution (HWDE) is a new optimization method that combines the well-known approaches of the Whale Optimization Algorithm (WOA) and Enhanced Differential Evolution (EDE). By balancing the required Real-Time Price (RTP) and Critical Peak Price (CPP) loads, WOA and EDE capabilities can save costs and ensure the device receives sufficient voltage. The three most recent performance indicators are kWh per charge, energy usage, and the maximum-average ratio. Existing models are evaluated according to their expenses (in rupees), energy consumption, cost per kilowatt-hour, and total cost. All simulation results indicate that HWDE is the optimal solution in every circumstance. In MATLAB simulations, HWDE consistently outperforms its rivals.

Research on load-balancing scheduling optimization for wafer surface defect detection

Research on load-balancing scheduling optimization for wafer surface defect detection

Improved QoS with Fog computing based on Adaptive Load Balancing Algorithm

As the number of sensing devices rises, traffic on the cloud servers is boosting day by day. When a device connected to the IoTwants access to data, cloud computing encourages the pairing of fog &amp; cloud nodes to provide that information. One of the key needs in a fog-based cloud system, is efficient job scheduling to decrease the data delay and improve the QoS (Quality of Service). The researchers have used a variety of strategies to maintain the QoS criteria. However, because of the increased service delay caused by the busty traffic, job scheduling is impacted which leads to the unbalanced load on the fog environment. The proposed work uses a novel model which curates the features and working style of Genetic algorithm and the optimization algorithm with the load balancing scheduling on the fog nodes. The performance of the proposed hybrid model is contrasted with the other well-known algorithms in contrast to the fundamental benchmark optimization test functions. The proposed work displays better results in sustaining the task scheduling process when compared to the existing algorithms, which include Round Robin (RR) method, Hybrid RR, Hybrid Threshold based and Hybrid Predictive Based models, which ensures the efficacy of the proposed load balancing model to improve the quality of service in fog environment.

Load balancing scheduling mechanism for OpenStack and Docker integration

With the development of cloud-edge collaborative computing, cloud computing has become crucial in data analysis and data processing. OpenStack and Docker are important components of cloud computing, and the integration of the two has always attracted widespread attention in industry. The scheduling mechanism adopted by the existing fusion solution uses a uniform resource weight for all containers, and the computing nodes resources on the cloud platform is unbalanced under differentiated resource requirements of the containers. Therefore, considering different network communication qualities, a load-balancing Docker scheduling mechanism based on OpenStack is proposed to meet the needs of various resources (CPU, memory, disk, and bandwidth) of containers. This mechanism uses the precise limitation strategy for container resources and a centralized strategy for container resources as the scheduling basis, and it generates exclusive weights for containers through a filtering stage, a weighing stage based on weight adaptation, and a non-uniform memory access (NUMA) lean stage. The experimental results show that, compared with Nova-docker and Yun, the proposed mechanism reduces the resource load imbalance within a node by 57.35% and 59.00% on average, and the average imbalance between nodes is reduced by 53.53% and 50.90%. This mechanism can also achieve better load balancing without regard to bandwidth.

A systematic review on security aware real-time task scheduling

Nowadays, security and scheduling are the most crucial aspects of each distributed real-time application due to the rapidly enhanced use of such applications. This study presents a systematic literature review (SLR) on security and scheduling techniques for real-time applications in homogeneous and heterogeneous environments and to identify areas that need more attention for a wide range of applicability of real-time applications. The search procedure identified 3162 articles, and 103 best relevant articles are selected based on quality assessment scores for a brief review and discussions with the area experts or academicians. This study considers articles with a quality assessment score of more than five for a brief review. Hence, the applications related to security, scheduling, load balancing, fixed priority, task, job, and packet scheduling, and deadline constraints of soft and hard real-time systems in homogeneous and heterogeneous environments as per the state-of-the-art have been discussed. This discussion provides a better understanding of the real-time applications. The survey thus, aims to present the improvements in real-time task scheduling with security constraints in different distributed computing environments. The SLR also highlights various real-time task scheduling algorithms/techniques including the role of security. This SLR also provides meaningful and valuable study to the researchers by providing brief studies of various real-time task scheduling algorithms and security needs in tabular form.

Virtual machine tree task scheduling for load balancing in cloud computing

The increasing number of publications towards cloud computing proves that much research and development has been done, especially for task scheduling. Organizations are eager to get more customized technology to run the most smoothly in the provision of visual cloud services for fruity users. As the circumstances of Covid indicate to technology that everyone should run digitally, the workload on machines increased. For workload solutions, organizations are trying to balance the situation with the successful operation of cloud services to use appropriate services/resources. Nevertheless, the issues are still to be resolved by researchers, so we respect all my friends who are putting a lot of effort into developing new techniques. A proposed paper is showing a new collation with the load balancing factor by implementing quality of service (QoS) and virtual machine tree (VMT). A CloudSim toolkit will then be used to compare them. A tree structure graph is included in the VMT algorithm to schedule tasks with the appropriate distribution on each machine. The QoS algorithm performs the task of scheduling based on the service required by the user with the best quality and satisfies the user.