Welcome to the InfoSci Platform
Reference Hub1
A Hybrid Dynamic Load Balancing Algorithm for Distributed Systems Using Genetic Algorithms

A Hybrid Dynamic Load Balancing Algorithm for Distributed Systems Using Genetic Algorithms

Mayuri A. Mehta, Devesh C. Jinwala
Copyright: © 2014 |Volume: 5 |Issue: 3 |Pages: 23
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781466653696|DOI: 10.4018/ijdst.2014070101
Cite Article Cite Article

MLA

Mehta, Mayuri A., and Devesh C. Jinwala. "A Hybrid Dynamic Load Balancing Algorithm for Distributed Systems Using Genetic Algorithms." IJDST vol.5, no.3 2014: pp.1-23. http://doi.org/10.4018/ijdst.2014070101

APA

Mehta, M. A. & Jinwala, D. C. (2014). A Hybrid Dynamic Load Balancing Algorithm for Distributed Systems Using Genetic Algorithms. International Journal of Distributed Systems and Technologies (IJDST), 5(3), 1-23. http://doi.org/10.4018/ijdst.2014070101

Chicago

Mehta, Mayuri A., and Devesh C. Jinwala. "A Hybrid Dynamic Load Balancing Algorithm for Distributed Systems Using Genetic Algorithms," International Journal of Distributed Systems and Technologies (IJDST) 5, no.3: 1-23. http://doi.org/10.4018/ijdst.2014070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Dynamic Load Balancing (DLB) is sine qua non in modern distributed systems to ensure the efficient utilization of computing resources therein. This paper proposes a novel framework for hybrid dynamic load balancing. Its framework uses a Genetic Algorithms (GA) based supernode selection approach within. The GA-based approach is useful in choosing optimally loaded nodes as the supernodes directly from data set, thereby essentially improving the speed of load balancing process. Applying the proposed GA-based approach, this work analyzes the performance of hybrid DLB algorithm under different system states such as lightly loaded, moderately loaded, and highly loaded. The performance is measured with respect to three parameters: average response time, average round trip time, and average completion time of the users. Further, it also evaluates the performance of hybrid algorithm utilizing OnLine Transaction Processing (OLTP) benchmark and Sparse Matrix Vector Multiplication (SPMV) benchmark applications to analyze its adaptability to I/O-intensive, memory-intensive, or/and CPU-intensive applications. The experimental results show that the hybrid algorithm significantly improves the performance under different system states and under a wide range of workloads compared to traditional decentralized algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.