Treffer: Dynamic scheduling strategies for cloud-based load balancing in parallel and distributed systems.

Actual load balancing in parallel and distributed systems ruins a serious task due to workloads' dynamic nature and resource availability. Existing scheduling procedures continually fail to regulate real-time alterations, leading to suboptimal performance and resource underutilization. Our study validates dynamic and effective load distribution by combining novel systems and optimization techniques to handle these issues. We utilize a comprehensive dynamic scheduling approach in this work to provide efficient load balancing in distributed and parallel systems. In this example, we start by using Round-Robin Allocation with Sunflower Whale Optimization (RRA-SWO) to perform an allocation procedure. The allocation step is followed by the Hybrid Ant Genetic Algorithm (HAGA), which is used to schedule tasks in parallel. The Least Response Time (LRT) technique for the Load Monitoring procedures will be developed once the job scheduling is complete. The Harmony Search Algorithm with Linear Regression (LR-HSA) is then used to do Distributed Computing-based Load Prediction and Adjustment. Alongside ongoing observation, this is carried out. Finally, we use the Least Recently Used (LRU) technique to do dynamic load balancing. Performance evaluations are using CloudSim and NetBeans 12.3, metrics like Packet Delivery Ratio at 98 (%), Average Response Time at 65 (s), Task Success Rate at 95 (%), Memory Utilization Rate at 80 (%), and Throughput at 97 (%) are all analyzed to validate our strategy. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Cloud Computing (2192-113X) is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)