Module Allocation for Maximizing Reliability of Distributed Computing Systems using Genetic Algorithms
Surinder Kumar
Surinder Kumar, Assistant Professor, Department of Mathematics, D.A.V. College, Chandigarh-160011, India.
Manuscript received on August 05, 2016. | Revised Manuscript received on August 06, 2016. | Manuscript published on September 05, 2016. | PP: 44-48 | Volume-6 Issue-4, September 2016. | Retrieval Number: D2910096416/2016©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The problem of the module allocation in distributed computing system is to need to allocate a number of modules to different processors for execution. The paper deals with the problem of module allocation in heterogeneous distributed computing systems with the goal of maximizing the system reliability. We present a genetic algorithm to obtain the optimal solution for this problem. In the performance of the algorithm we consider more one parameter such as the number of modules, the number of processors, and module interaction density of applications. The experimental results illustrate the effectiveness of this algorithm over conventional algorithms.
Keywords: Distributed computing systems, Genetic algorithms, Module allocations and Maximizing reliability.