What is it about?
The 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 the 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.
Featured Image
Why is it important?
In this paper, we formulated performability term of dependability in the transaction processing system considering load balanced scheduling.
Perspectives
In this paper, we formulated performability term of dependability in the transaction processing system considering load balanced scheduling.
Dr. Dharmendra Prasad MAHATO
BIT Sindri, Dhanbad, Jharkhand, India
Read the Original
This page is a summary of: Load balanced transaction scheduling using Honey Bee Optimization considering performability in on-demand computing system, Concurrency and Computation Practice and Experience, August 2017, Wiley,
DOI: 10.1002/cpe.4253.
You can read the full text:
Contributors
The following have contributed to this page