Energy efficient scheduler of aperiodic jobs for real-time embedded systems

Energy-Efficient Real-Time Scheduling Algorithm for Fault-Tolerant Autonomous Systems

“…We consider the notation processor speed S N , or slowdown factor, as the ratio of the computed speed to the maximum processor speed, this means that S N = f N /f max [13]. The CPU speed can be changed continuously in [S min , S max ].…”

“…Definition 3.1. A schedule Γ for a job set J is said to be valid if the deadlines of all jobs of J are met in Γ, starting with a storage fully charged [13]. Definition 3.2.…”

“…A system is said to be feasible if there exists at least one valid schedule Γ for J with a given energy source. Otherwise, it is infeasible [13].…”

“…Subsequently, a great number of procedures considering the issue of limiting the energy consumption without jeopardizing the timing constraints on uniprocessor platforms are widely proposed in literature for different task models. Many of the previous work that studied the problem of energy efficient frameworks for real-time embedded systems employ the DVFS technique [4], [10], [11], [12], [13].…”

“…In [12], authors considered the temperate and leakage dependencies and proposed an efficient DVFS scheme to minimize the overall energy consumption while guaranteeing the timing constraints of a real-time system. Later in [13], we settle the hypothesis for enhancing energy saving in real-time systems, we proposed an energy-efficient scheduling algorithm for aperiodic tasksin real-time embedded systems. Specifically, we applied the DVFS technique to the concept of real-time process scheduling.…”