A Solution to Task Allocation Problem Statically by Considering the Cost Factor in a Distributed Computing System

Abstract

The problem of the task allocation in Distributed Computing System (DCS) is to need to allocate a number of tasks to different processors for execution. The purpose of the distributed system is to coordinate the use of shared resources or provide communication services to the users.  We consider the problem of finding an optimal task allocation in distributed computing system with the goal of minimizing the system cost. In the present paper we are taking n to denote the number of processors and m for denoting the number of different tasks where m n. A distributed network consists of multiple autonomous computers that communicate through a communication media. In a static task allocation, the information regarding the tasks and processor attributes is assumed to be known in advance, before the execution of the tasks.so it gives better execution environment. Execution cost can be termed as the amount of value of resource used. In this paper an algorithm is presented to solve the problem of static task allocation in DCS, i.e. given a set of communicating tasks to be processed on a set of processors, to which processor should each task be allocated to get the more reliable results in lesser cost.