Reliability-aware task scheduling for energy efficiency on heterogeneous multiprocessor systems

Time‐constrained and reliability aware energy minimization scheduling algorithm for heterogeneous multiprocessor environments

“…To meet the deadline constraint, the task execution time needs to be shortened by increasing the processor frequency, so the system energy consumption will rise accordingly. As also shown in Equation (7), task reliability is positively correlated with processor frequency, so after increasing the processor frequency in ensuring system reliability, the system energy consumption will rise accordingly. Increasing the number of processors can improve the concurrency of the system and effectively reduce the overall execution time of the tasks, when the frequency of each processor can be reduced accordingly, and the system energy consumption will also be reduced.…”

“…Recently, there are also some studies on the optimization of energy consumption under the simultaneous constraints of deadline and reliability. Deng et al 7 proposed a scheduling strategy based on the whale algorithm to reduce the energy consumption of the system under time and reliability constraints. But it is based on a meta‐heuristic strategy to find the optimal solution, which often requires a large amount of time and computational resources.…”

“…The energy‐aware task scheduling problem with deadline and reliability constraints in heterogeneous multiprocessor systems has been proven to an NP‐hard problem, 6 and it is not practical to use methods such as linear programming to solve the optimal solution. Most of the existing scheduling strategies are based on heuristic or meta‐heuristic algorithms 7 . Meta‐heuristic algorithms generally find the approximate optimal solution eventually by means of a guided random search of the solution space 8 .…”

“…Most of the existing scheduling strategies are based on heuristic or meta-heuristic algorithms. 7 Meta-heuristic algorithms generally find the approximate optimal solution eventually by means of a guided random search of the solution space. 8 However, they require a large amount of computational resources, which is not allowed in some time-cost sensitive tasks.…”

Near-optimal energy-efficient partial-duplication task mapping of real-time parallel applications

“…Approaches exist without applying a fault tolerance policy, e.g., the task mapping problem is decomposed into a sub-problem that satisfies the reliability constraint and another that minimizes resources [5] and a whale optimization algorithm is proposed [6]. In [7], the scheduling algorithm for dependent multi-version tasks is studied based on Forward List Scheduling with the goal of minimizing the total energy consumption under real-time constraint.…”