A Novel Federated Earliest Deadline FirstReal-time Task Scheduler forMultiprocessors
سال انتشار: 1402
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 172
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICTBC07_024
تاریخ نمایه سازی: 26 اسفند 1402
چکیده مقاله:
This research paper focuses on the development of scheduling algorithms for real-time systems, with aspecific emphasis on multiprocessor environments. The primary objective is to ensure the timely execution ofhard real-time tasks to avoid any detrimental consequences caused by missed deadlines. To achieve thisgoal, Federated Earliest Deadline First (fEDF) scheduler is proposed, which exhibits promising capabilitiesin meeting the desired objective. The fEDF algorithm incorporates shared and dedicated modes, enhancingflexibility and minimizing idle time and overhead through the utilization of shared tasks. Experimental resultsvalidate the effectiveness of the proposed algorithm, demonstrating its ability to significantly improveutilization and maximize processor efficiency while maintaining comparable overhead to the singleprocessormode. This research contributes to the advancement of scheduling algorithms for multiprocessorsystems, effectively addressing the challenges associated with reliable and efficient real-time task execution
کلیدواژه ها:
نویسندگان
Ali Moghaddaszadeh
Department of Computer Engineering, Ferdowsi University of Mashhad,Mashhad, Iran.
Arash Deldari
Department of Computer Engineering, University of Torbat Heydarieh, Torbat Heydarieh, Iran.
Mahmoud Naghibzadeh
Department of Computer Engineering, Ferdowsi University of Mashhad,Mashhad, Iran.