Extended tabu search-based scheduling to improve profitability in heterogeneous parallel systems
سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 84
فایل این مقاله در 28 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_KJMMRC-13-1_034
تاریخ نمایه سازی: 28 آبان 1402
چکیده مقاله:
Higher utilization of existing resources and facilities in order to increase efficiency and profitability is always one of the basic challenges for parallel processing systems and environments, and this challenge becomes more complicated when the system resources are heterogeneous. One way to achieve high efficiency and profitability of heterogeneous parallel systems is to schedule tasks optimally. In this paper, an extended tabu search-based scheduling algorithm (ESTS) is presented to improve the profitability of heterogeneous parallel systems, which can achieve suitable solutions in a short computational time. To evaluate the efficiency of the proposed solution, due to the lack of a suitable criterion to evaluate this problem, the obtained results are compared with both the results of an extended scheduling based on a genetic algorithm (ESGA) with a large number of chromosomes and a high number of generations, as well as an extended scheduling based on a simulated annealing algorithm (ESSA) with a linear temperature reduction. The benchmark files of different sizes were tested under the same conditions, and the comparison of results shows the superiority of the proposed solution in terms of profitability and computational time.
کلیدواژه ها:
نویسندگان
Saeedeh Bakhoda
Department of Computer Engineering, Miyaneh Branch, Islamic Azad University, Miyaneh, Iran
Mohammad Abdollahi Azgomi
School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Mohammad Reza Ebrahimi Dishabi
Department of Computer Engineering, Miyaneh Branch, Islamic Azad University, Miyaneh, Iran
مراجع و منابع این مقاله:
لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :