Abstract
This work presents a comparison between several task distribution methods for load balancing with the help of an original implementation of a solution based on a multi-agent system. Among the original contributions, one can mention the design and implementation of the agent-based solution and the proposal of various scenarios, strategies and metrics that are further analyzed in the experimental case studies. The best strategy depends on the context. When the objective is to use the processors at their highest processing potential, the agents preferences strategy produces the best usage of the processing resources with an aggregated load per turn for all PAs up to four times higher than the rest of the strategies. When one needs to have a balance between the loads of the processing elements, the maximum availability strategy is better than the rest of the examined strategies, producing the lowest imbalance rate between PAs out of all the strategies in most scenarios. The random distribution strategy produces the lowest average load especially for tasks with higher required processing time, and thus, it should generally be avoided.
Subject
Applied Mathematics,Modeling and Simulation,General Computer Science,Theoretical Computer Science
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献