Article ID Journal Published Year Pages File Type
11023881 Microelectronics Journal 2018 13 Pages PDF
Abstract
Adopting multicore platforms is a general trend in real-time embedded systems. However, integrating tasks with different real-time constraints into a single platform presents new design challenges. While it must be guaranteed that hard real-time tasks are able to meet their deadline even in worst case scenarios, firm real-time tasks should be scheduled in a way to achieve high system utilization in order to provide a better quality of service. In this paper, we propose a scheduling scheme for frame-based tasks on real-time multicore embedded systems which is able to guarantee the schedulability of the hard real-time tasks, while it improves the number of executed firm real-time tasks. Considering intrinsic variation of execution time of tasks and with the help of a clustering algorithm, hard real-time tasks are scheduled in a way that their expected slack time could be exploited more efficiently for the execution of firm tasks. The extensive simulations show that our proposed scheme can improve the system utility up to 60% compared to a state-of-the-art scheduling technique.
Related Topics
Physical Sciences and Engineering Computer Science Hardware and Architecture
Authors
, , , ,