Module Allocation for Maximizing Reliability of Distributed Computing Systems using Dynamic Greedy Heuristic
Surinder Kumar

Surinder Kumar, Assistant Professor, Department of Mathematics, Dayanand Anglo Vaidik College, Chandigarh (Punjab). India.
Manuscript received on September 01, 2016. | Revised Version Manuscript Received on September 08, 2016. | Manuscript published on September 20, 2016. | PP: 1-4 | Volume-2 Issue-1, September 2016.
Open Access | Ethics and Policies | Cite
© The Authors. Published by Lattice Science Publication (LSP). This is an open access article under the CC BY-NC-ND license (

Abstract: This paper deals with the problem of module allocation (i.e., to which processor should each task of an application be assigned) in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The module assignment problem for more than three processors is known to be NP-hard, and therefore satisfactory suboptimal solutions obtainable in an acceptable amount of time are generally sought. We propose a new intelligent technique based on dynamic module allocation which uses greedy search algorithm for this problem. Performance of the algorithm depends on number of modules, number of processors, and the ratio of average communication time to average computation time and module interaction density of application. The effectiveness and efficiency of our algorithm is compared with recently proposed module allocation algorithms for maximizing system reliability available in literature.
Keywords: Module assignment, Distributed computing, Reliability, Dynamic Greedy heuristic, Module interaction graph.