Scheduling tasks in a multi-processor systemutilizes a hybrid of genetic algorithms and priorities ofthe number of offspring

سال انتشار: 1395
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 637

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

NAECE01_097

تاریخ نمایه سازی: 26 شهریور 1395

چکیده مقاله:

Task scheduling problem on multiprocessor systems because of the use of the processors and also spend less time is particularly important. The problem of a class of hard problems and obtain optimal solutions with high temporal complexity, so to solve this problem is to use heuristic methods. Using geneticalgorithms, effective method for multi-processor systems are scheduled. In this paper, a new method for multiprocessor scheduling system is presented the scheduling priority of doing things based on the number of children and grandchildren and check earliest start time and end up enjoying things a genetic algorithm is done. The results show proposed new algorithmoptimal timing to acquire common genetic methods.

نویسندگان

Sevila Sojudi

Islamic Azad University Of QAZVIN, QIAU Qazvin, Iran

Mehrdad ziadi

Islamic Azad University of QAZVIN, QIAU Qazvin, Iran

Rashno Ali

Payyam NOOR University of KhoramAbad BranchKhoramAbad, Iran