A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic
Abstract Multiprocessor task scheduling problem is a pressing problem that affects systems' performance and is still being investigated by the researchers. Finding the optimal schedules is considered to be a computationally hard problem. Recently, researchers have used fuzzy logic in the field...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-05-01
|
| Series: | IET Computers & Digital Techniques |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cdt2.12018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832546649595969536 |
|---|---|
| author | Heba E. Hassan Gihan Nagib Khaled Hosny Ibrahiem |
| author_facet | Heba E. Hassan Gihan Nagib Khaled Hosny Ibrahiem |
| author_sort | Heba E. Hassan |
| collection | DOAJ |
| description | Abstract Multiprocessor task scheduling problem is a pressing problem that affects systems' performance and is still being investigated by the researchers. Finding the optimal schedules is considered to be a computationally hard problem. Recently, researchers have used fuzzy logic in the field of task scheduling to achieve optimal performance, but this area of research is still not well investigated. In addition, there are various scheduling algorithms that used fuzzy logic but most of them are often performed on uniprocessor systems. This article presents a new proposed algorithm in which the priorities of the tasks are derived from the fuzzy logic and bottom level parameter. This approach is designed to find task schedules with optimal or sub‐optimal lengths in order to achieve high performance for a multiprocessor environment. With respect to the proposed algorithm, the precedence constraints between the non‐preemptive tasks and their execution times are known and described by a directed acyclic graph. The number of processors is fixed, the communication costs are negligible and the processors are homogeneous. The suggested technique is tested and compared with the Prototype Standard Task Graph Set. |
| format | Article |
| id | doaj-art-202f07421a0c4e7bb12000f41ec5ceb9 |
| institution | Kabale University |
| issn | 1751-8601 1751-861X |
| language | English |
| publishDate | 2021-05-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Computers & Digital Techniques |
| spelling | doaj-art-202f07421a0c4e7bb12000f41ec5ceb92025-02-03T06:47:36ZengWileyIET Computers & Digital Techniques1751-86011751-861X2021-05-0115321422210.1049/cdt2.12018A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logicHeba E. Hassan0Gihan Nagib1Khaled Hosny Ibrahiem2Faculty of Engineering Fayoum University Fayoum EgyptFaculty of Engineering Fayoum University Fayoum EgyptFaculty of Engineering Fayoum University Fayoum EgyptAbstract Multiprocessor task scheduling problem is a pressing problem that affects systems' performance and is still being investigated by the researchers. Finding the optimal schedules is considered to be a computationally hard problem. Recently, researchers have used fuzzy logic in the field of task scheduling to achieve optimal performance, but this area of research is still not well investigated. In addition, there are various scheduling algorithms that used fuzzy logic but most of them are often performed on uniprocessor systems. This article presents a new proposed algorithm in which the priorities of the tasks are derived from the fuzzy logic and bottom level parameter. This approach is designed to find task schedules with optimal or sub‐optimal lengths in order to achieve high performance for a multiprocessor environment. With respect to the proposed algorithm, the precedence constraints between the non‐preemptive tasks and their execution times are known and described by a directed acyclic graph. The number of processors is fixed, the communication costs are negligible and the processors are homogeneous. The suggested technique is tested and compared with the Prototype Standard Task Graph Set.https://doi.org/10.1049/cdt2.12018computational complexitydirected graphsfuzzy logicmultiprocessing systemsparallel algorithmsprocessor scheduling |
| spellingShingle | Heba E. Hassan Gihan Nagib Khaled Hosny Ibrahiem A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic IET Computers & Digital Techniques computational complexity directed graphs fuzzy logic multiprocessing systems parallel algorithms processor scheduling |
| title | A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic |
| title_full | A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic |
| title_fullStr | A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic |
| title_full_unstemmed | A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic |
| title_short | A novel task scheduling approach for dependent non‐preemptive tasks using fuzzy logic |
| title_sort | novel task scheduling approach for dependent non preemptive tasks using fuzzy logic |
| topic | computational complexity directed graphs fuzzy logic multiprocessing systems parallel algorithms processor scheduling |
| url | https://doi.org/10.1049/cdt2.12018 |
| work_keys_str_mv | AT hebaehassan anoveltaskschedulingapproachfordependentnonpreemptivetasksusingfuzzylogic AT gihannagib anoveltaskschedulingapproachfordependentnonpreemptivetasksusingfuzzylogic AT khaledhosnyibrahiem anoveltaskschedulingapproachfordependentnonpreemptivetasksusingfuzzylogic AT hebaehassan noveltaskschedulingapproachfordependentnonpreemptivetasksusingfuzzylogic AT gihannagib noveltaskschedulingapproachfordependentnonpreemptivetasksusingfuzzylogic AT khaledhosnyibrahiem noveltaskschedulingapproachfordependentnonpreemptivetasksusingfuzzylogic |