Abstract
SummaryThe scheduling of load balanced transactions is an emerging problem in on‐demand computing system. This problem can be studied considering several parameters such as resource availability, performance, and reliability. The existing approaches to find the exact solutions for this problem are limited. This paper presents a Honey Bee Optimization (HBO)–based method to solve the mentioned problem. In this method, first, the load of the system is balanced and then the transactions are scheduled using foraging behavior of honey bees to find the optimal solutions. We also modify four known scheduling algorithms such as Ant Colony Optimization (ACO), Hierarchical Load Balanced Algorithm (HLBA), Dynamic and Decentralized Load Balancing (DLB), and Randomized to obtain transaction scheduling algorithms for the purpose of comparison with our proposed algorithm. The compared results show that the proposed algorithm performs better than the modified existing algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
