An Optimal Task Allocation Model through Clustering with Inter-Processor Distances in Heterogeneous Distributed Computing Systems
Manisha Sharma1, Harendra Kumar2, Deepak Garg3

1Manisha Sharma, Department of Mathematics, Panjab University, Chandigarh- 160014, Punjab, INDIA.
2Harendra Kumar, Department of Mathematics & Statistics, Gurkula Kangari University, Hardwar-249404, U.K., INDIA.

3Deepak Garg, Department of Mathematics, Panjab University, Chandigarh- 160014, Punjab, INDIA.
Manuscript received on February 09, 2012. | Revised Manuscript received on February 13, 2012. | Manuscript published on March 05, 2012. | PP: 50-55 | Volume-2 Issue-1, March 2012. | Retrieval Number: A0376012111 /2012©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 (

Abstract: Distributed computing s y s t e m s ( DCS ) a r e of current interest d u e to the advancement of microprocessor technology and computers networks. It consists of multiple computing nodes that communicate with each other by message passing mechanism. Reliability and communication over distances are the main reasons for building the DCS. In distributed computing systems, partitioning of applications software in to modules and proper allocation of modules among processors are important factors for efficient utilization of resources. We consider the problem of m-modules and n-processors (m >> n). In this paper a mathematical model for finding optimal cost and optimal reliability to the problem is presented considering DCS with heterogeneous processors in such a way that the allocated load on each processor is balanced. The results obtained by the present model are compared with the recent models and comparison results show that the model is very effective.
Keywords: Distributed computing system, Module allocation, Inter module communication, Reliability, Data transfer rate, Inter processor distance.