مشاهده مشخصات مقاله
Semi-partitioned Scheduling Hard Real-time Periodic DAGs in Multicores
|
Authors |
-
Mojtaba Hatami
-
Mahmoud Naghibzadeh
|
|
Conference |
سمپوزیوم بینالمللی سیستمها و فنآوریهای بیدرنگ و نهفته RTEST 2018 |
|
Abstract |
Recent trends in real-time systems are towards multicores and parallel processes in the form of directed acyclic graphs. The scheduling aspect of such systems has been worked on and many methods are developed. Nevertheless, the need for more efficient approaches which can use fewer number of cores has not vanished. Semi-partitioned scheduling of hard real-time parallel tasks in multicores is studied in this paper. Since there is no benefit in completing a task much before its deadline, after scheduling a parallel task, if it is beneficial for other tasks, the execution of this task is further moved towards its deadline, i.e., stretching, to make room for tasks with closer deadlines. A new concept, prior+, load of tasks is used to rank all tasks of each directed acyclic graph and order them for scheduling. The scheduler is offline and the schedule map is used during run time. One benefit of this is the reduction of the scheduling overhead during run time which helps to safely accept loads. The comparative evaluations show the algorithms performance is superior to the state of the art ones. It also confirmed that the new concept of prior+ load of a task is very effective in scheduling real-time directed acyclic graphs and suggests that it can as well be useful in scheduling workflows. |
|
قیمت |
-
برای اعضای سایت : 100,000 Rial
-
برای دانشجویان عضو انجمن : 20,000 Rial
-
برای اعضای عادی انجمن : 40,000 Rial
|
خرید مقاله
|
|
.gif){kind=icon}