Abstract
This paper deals with the scheduling of real-time periodic tasks executed on heterogeneous multicore platforms. Each processor is composed of a set of multi-speed cores with limited energy resources. A reconfigurable system is sensible to unpredictable reconfiguration events from related environment, such as the activation, removal or update of tasks. The problem is to handle feasible reconfiguration scenarios under energy constraints. Since any task can finish execution before achieving its worst-case execution time (WCET), the idea is to distribute this execution on different processor cores for meeting related deadlines and reducing energy consumption. The methodology consists in using lower processor speeds first to consume less energy. If the system is still non-feasible after reconfiguration, then we adjust the task periods as a flexible solution or migrate some of them to the least loaded processors. Accordingly, an integer linear program (ILP) is formulated to encode the execution model that assigns tasks to different cores with optimal energy consumption, thereby realizing energy-efficient computing/green computing. The potency and effectiveness of the proposed approach are rated through simulation studies. By measuring the energy consumption cost, our solution offers better than 11% of gain than recently published methods and improves by 85% the overall number of adjusted periods.
Highlights
Real-time applications are conditioned by temporal requirements and need to be executed before their deadlines
It offers more than 8% of gain compared with the approach in [27] and 15% of gain compared with the work in [1] when 20% of tasks finish execution in worst-case execution time (WCET)
The contributions of this paper can be summarized as follows: We propose a scheduling scheme based on multi-speed cores, which consists of three cascading solutions depending on configuration scenarios: 1) We assign each task to different cores with different speeds while wishing to finish them as soon as possible with low-cost cores to save energy and cost, 2) If the first solution is not feasible, we adjust the periods of tasks with a new application of this solution, and
Summary
Real-time applications are conditioned by temporal requirements and need to be executed before their deadlines. The developed solution presents an optimization mechanism that affects all the levels, such as partitioning tasks on different cores, and adjusting periods and migrating tasks from one processor to another This makes the system more flexible and able to handle run-time reconfigurations. The contributions of this paper can be summarized as follows: We propose a scheduling scheme based on multi-speed cores, which consists of three cascading solutions depending on configuration scenarios: 1) We assign each task to different cores with different speeds while wishing to finish them as soon as possible with low-cost cores to save energy and cost, 2) If the first solution is not feasible, we adjust the periods of tasks with a new application of this solution, and.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
