4.7 Article

METSM: Multiobjective energy-efficient task scheduling model for an edge heterogeneous multiprocessor system

Publisher

ELSEVIER
DOI: 10.1016/j.future.2023.10.024

Keywords

Heterogeneous multiprocessor system; Task scheduling; Energy efficiency; Multiobjective optimization; Iterated greedy algorithm; Edge device

Ask authors/readers for more resources

This paper proposes a multi-objective energy-efficient task scheduling technique (METSM) for edge heterogeneous multiprocessor systems. A mathematical model is established for the task scheduling problem, and a problem-specific algorithm (IMO) is designed for optimizing task scheduling and resource allocation. Experimental results show that the proposed algorithm can achieve optimal Pareto fronts and significantly save time and power consumption.
ABS T R A C T Along with the growth of computing requirements, edge devices, such as satellites and unmanned aerial vehicles, are equipped with heterogeneous multiprocessor systems to cope with complicated missions, including attitude control, signal processing, and objective detection. Concerning the extremely limited power on these devices, reducing the energy and time overhead of task execution evolves into a crucial challenge. Therefore, a multiobjective energy-efficient task scheduling technique (METSM) is proposed. First, a mathematical model is established for the energy-efficient task scheduling problem on edge heterogeneous multiprocessor systems. In this model, both makespan and total energy consumption are the optimization objectives. The decision variables include the task execution sequence, processor assignment, and dynamic voltage and frequency scaling level for each processor. Second, a problem-specific algorithm, namely, iterated greedy-based multiobjective optimizer (IMO), is proposed. Specifically, destruction-reconstruction and local search are redesigned for optimizing task scheduling and resource allocation. Considering local optima avoidance, a probabilistic mutation operation is developed. In addition, multiobjective-oriented strategies of optimal solution selection and acceptance criteria are adopted to accelerate the convergence. Finally, our proposed IMO is compared with several of the latest algorithms through multiple performance metrics. The experimental results show that IMO can obtain optimal Pareto fronts among several multiobjective methods. Savings of approximately 10% and 12% in time and power consumption, respectively, can be achieved by IMO. Moreover, in comparison with classic list-based heuristics for solving test cases, while IMO maintains a similar makespan, energy is reduced by nearly 90%.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available