Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors

Abstract

We propose three novel mathematical optimization formulations that solve the same two-type heterogeneous multiprocessor scheduling problem for a real-time taskset with hard constraints. Our formulations are based on a global scheduling scheme and a fluid model. The first formulation is a mixed-integer nonlinear program, since the scheduling problem is intuitively considered as an assignment problem. However, by changing the scheduling problem to first determine a task workload partition and then to find the execution order of all tasks, the computation time can be significantly reduced. Specifically, the workload partitioning problem can be formulated as a continuous nonlinear program for a system with continuous operating frequency, and as a continuous linear program for a practical system with a discrete speed level set. The latter problem can therefore be solved by an interior point method to any accuracy in polynomial time. The task ordering problem can be solved by an algorithm with a complexity that is linear in the total number of tasks. The work is evaluated against existing global energy/feasibility optimal workload allocation formulations. The results illustrate that our algorithms are both feasibility optimal and energy optimal for both implicit and constrained deadline tasksets. Specifically, our algorithm can achieve up to 40% energy saving for some simulated tasksets with constrained deadlines. The benefit of our formulation compared with existing work is that our algorithms can solve a more general class of scheduling problems due to incorporat-

Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms

“…Finally, constraints and particularities of real-time systems (recurrent tasks, deadlines and migration) have also been considered [3,4,6,18,[30][31][32]36] for systems like ARM big.LITTLE hardware. Table 2 summarizes the related guaranteed algorithms for this problem.…”

Maximizing Utilization and Minimizing Migration in Thermal-Aware Energy-Efficient Real-Time Multiprocessor Scheduling

“…Authors in [22] also relay on DP to find an energy-efficient scheduler based on mathematical optimization, in this case for two heterogeneous processors. They formulate a general case as a non-linear integer programming problem to obtain a schedule, which yields algorithms with high computational complexity.…”

Optimal Communication Scheduling in the Smart Grid

“…Various energy-efficient task scheduling algorithms on multiprocessor systems have been developed in the past years [10]- [12]. However, we cannot directly use these existing algorithms for the reason that both latency and energy consumption of the communication aspect are ommited in the task scheduling problems on multiprocessor systems, whereas our focus is to obtain the energy-optimal communication topology of smart meters in a building.…”