Abstract

The problem of the task allocation in distributed computing system is to need to allocate a number of tasks to different processors for execution. In this paper we have developed a task allocation model and have proposed a heuristic algorithm for task allocation that will find an optimal solution to the problem. The proposed algorithm try to minimize the inter processor communication cost (IPCC) by assigning those task first, which has the heaviest communication link sum (CLS). Using this approach it has been seen that the system cost will minimize more than other heuristic.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call