An Imperialist Competitve Algorithm for solving the Multi Processor Scheduling Problem
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 385
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
COMCONF04_210
تاریخ نمایه سازی: 10 تیر 1396
Abstract:
Scheduling is a key problem in multi-processor systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we propose a meta heuristic technique, namely the Imperialist Competitive Algorithm (ICA), for homogeneous multiprocessor scheduling problem (MPSP).ICA is a population-based search algorithm based on the simulation of the socio-political process of imperialism and imperialistic competition. Imperial compete in problem search space to find optimal or near-optimal solutions. The scheduler aims at minimizing makespan, which is the time when finishes the latest job. Also in this paper, a simple method proposed to calculate the relative power of the empires in imperialist competitive algorithm, which calculation is less than the original method and runs faster. Experimental Evaluation shows that the proposed method is efficient of Genetic Algorithm (GA) approach for this problem.
Keywords:
colonial , imperialist competitive algorithm , multiprocessor scheduling problem (MPSP) , scheduling
Authors
Mansour Noushfar
Department of Computer Science and Research Branch, Islamic Azad University, Khuzestan,Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :