Task Assignment in Distributed Systems based on PSO Approach
Publish place: پنجمین کنفرانس بین المللی مهندسی کامپیوتر ،برق و الکترونیک
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 410
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
NSOECE05_022
تاریخ نمایه سازی: 10 تیر 1396
Abstract:
In 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 GA-based approach.
Authors
Mostafa Haghi Kashani
Department of Computer Engineering, Shahr Qods Branch, Islamic Azad University, Tehran, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :