In a distributed system, Task Assignment Problem (TAP) is a key factor for obtaining efficiency. TAP illustrates the appropriate allocation of tasks to the processor of each computer. In this problem, the proposed methods up to now try to minimize Makespan and maximizing CPU utilization. Since this problem is NP-complete, many genetic algorithms have been proposed to search optimal solutions from the entire solution space. Disregarding the techniques which can reduce the complexity of optimization, the existing approaches scan the entire solution space. On the other hand, this approach is time-consuming in scheduling which is considered a shortcoming. Therefore, in this paper, a hybrid genetic algorithm has been proposed to overcome this shortcoming. Particle Swarm Optimization (PSO) has been applied as local search in the proposed genetic algorithm in this paper. The results obtained from simulation can prove that, in terms of CPU utilization and Makespan, the proposed approach outperforms the GA-based approach.
翻译:在分布式系统中,任务分配问题(TAP)是提高效率的一个关键因素。 TAP 向每个计算机的处理者说明任务的适当分配情况。在此问题上,到目前为止,拟议的方法试图最大限度地减少制造量和最大限度地利用CPU。由于这个问题是NP的完整,许多遗传算法都建议从整个解决方案空间寻找最佳解决办法。不考虑能够降低优化复杂性的技术,现有方法扫描整个解决方案空间。另一方面,这种方法在时间安排上耗费时间,被认为是一个缺陷。因此,本文件建议采用混合遗传算法来克服这一缺陷。本文中,在拟议的遗传算法中,当地搜索使用了Swarm优化(PSO),模拟的结果可以证明,在CPU和Makepan方面,拟议方法比GA方法要好。