IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Heuristic Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System

Heuristic Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System
View Sample PDF
Author(s): Bibhudatta Sahoo (NIT Rourkela, India), Sanjay Kumar Jena (NIT Rourkela, India)and Sudipta Mahapatra (IIT Karagpur, India)
Copyright: 2014
Pages: 29
Source title: Advances in Secure Computing, Internet Services, and Applications
Source Author(s)/Editor(s): B.K. Tripathy (VIT University, India)and D. P. Acharjya (VIT University, India)
DOI: 10.4018/978-1-4666-4940-8.ch010

Purchase


Abstract

Distributed heterogeneous computing is being widely applied to a variety of large-size computational problems. These computational environments consist of multiple heterogeneous computing modules; these modules interact with each other to solve the problem. The load balancing problem in the Heterogeneous Distributed Computing System (HDCS) deals with allocation of tasks to computing nodes, so that computing nodes are evenly loaded. The complexity of dynamic load balancing increases with the size of HDCS and becomes difficult to solve effectively. Due to the complexity of the dynamic load balancing problem, the majority of researchers use a heuristic algorithm to obtain near optimal solutions. The authors use three different type of resource allocation heuristic techniques, namely greedy heuristic, simulated annealing, and genetic algorithm, for dynamic load balancing on HDCS. A new codification suitable to simulated annealing and the genetic algorithm has been introduced for dynamic load balancing on HDCS. This chapter demonstrates the use of the common coding scheme and iterative structure by simulated annealing and genetic algorithms for allocating the tasks among the computing nodes to minimize the makespan. The resource allocation algorithm uses sliding window techniques to select the tasks to be allocated to computing nodes in each iteration. A suitable codification for simulated annealing and genetic algorithm for dynamic load balancing strategy are explained along with implementation details. Consistent Expected Time to Compute (ETC) matrix is used to simulate the effect of the genetic algorithm-based dynamic load balancing scheme compared with first-fit, randomized heuristic, and simulated annealing.

Related Content

Chaymaâ Boutahiri, Ayoub Nouaiti, Aziz Bouazi, Abdallah Marhraoui Hsaini. © 2024. 14 pages.
Imane Cheikh, Khaoula Oulidi Omali, Mohammed Nabil Kabbaj, Mohammed Benbrahim. © 2024. 30 pages.
Tahiri Omar, Herrou Brahim, Sekkat Souhail, Khadiri Hassan. © 2024. 19 pages.
Sekkat Souhail, Ibtissam El Hassani, Anass Cherrafi. © 2024. 14 pages.
Meryeme Bououchma, Brahim Herrou. © 2024. 14 pages.
Touria Jdid, Idriss Chana, Aziz Bouazi, Mohammed Nabil Kabbaj, Mohammed Benbrahim. © 2024. 16 pages.
Houda Bentarki, Abdelkader Makhoute, Tőkési Karoly. © 2024. 10 pages.
Body Bottom