A Heuristic Approach for Optimal Task Allocation for The System Cost Analysis in Distributed Systems
Main Article Content
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.
Downloads
Download data is not yet available.
Article Details
How to Cite
Kumar, A., & Bhat, T. (2014). A Heuristic Approach for Optimal Task Allocation for The System Cost Analysis in Distributed Systems. SRMS Journal of Mathmetical Science, 1(01), 39-53. Retrieved from https://www.srmsjmaths.in/index.php/SRMSMATHS/article/view/41
Section
Review Article

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.