Low-Power Task Scheduling Algorithm for the Multicore Processor System Based on the Genetic Algorithm

In order to solve the periodic hard real-time tasks with dependencies on multicore processors, the author proposes a low-power task scheduling algorithm for multicore processor systems based on the genetic algorithm. This method first uses the RDAG algorithm to separate the tasks and then takes the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Wireless communications and mobile computing Ročník 2022; číslo 1
Hlavní autor: Li, Xianning
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Hindawi 2022
John Wiley & Sons, Inc
Témata:
Communication
Completion time
Embedded systems
Energy consumption
Genetic algorithms
Heuristic
Microprocessors
Power consumption
Power management
Resource utilization
Response time (computers)
Scheduling
Supercomputers
Task scheduling
ISSN:1530-8669, 1530-8677
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In order to solve the periodic hard real-time tasks with dependencies on multicore processors, the author proposes a low-power task scheduling algorithm for multicore processor systems based on the genetic algorithm. This method first uses the RDAG algorithm to separate the tasks and then takes the lowest power consumption as the principle; a genetic algorithm is used to determine the task mapping. Experimental results show that based on the power consumption model of Intel PXA270, several random task sets are used for simulation experiments, which shows that this method saves 20% to 30% of the energy consumption compared with the existing methods. This method effectively shortens the completion time of tasks, improves the utilization efficiency of multicore system resources, improves the parallel computing capability of multicore systems, reduces the average response time of tasks, and improves the throughput and resource utilization of multicore systems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1530-8669
1530-8677
DOI:10.1155/2022/4363937