Optimize task allocation method to reduce processing time in Distributed Processing Environment

Abstract

Distributed Processing Environment (DPE) refers multiple computers are linked together and forms a computer network to solve a common problem. In DPE many application elements that are spread over numerous computers, but work as a one processing system. DPE may include a local area network and computers are physically close together or it may be link by a wide area network and computers are geographically distant. Processing power of processing units in DPE may vary due to their different configurations. User sends a processing request to DPE in order to get process. A request may include multiple tasks. It is always suitable that all the tasks must be process within least possible time frame along with maximum accuracy of data. Hence performance of the DPE can improve and it can be achieve by reducing processing time. In DPE, a process request may include multiple modules of a single task and proper assignments of these modules on processors involved in distributed processing environment are main aspects to enhance the performance of DPE. If tasks counts are equal to or less than available processors counts, tasks can be assigned without any trouble. Problem arises when the task counts are greater than available processors counts in DPE. The problem of allocation of `m' tasks on `n' number of processors in DPE is discussed here through a optimize task allocation method. The task allocation method, discussed in this research paper assign the tasks to the heterogeneous processing environment to optimize the performance of the DPE. Allocation method presented in this research paper is also ensuring allocation of each task according processor's availability in DPE.