| Autor: |
Yudong Li, Jinquan Ma, Zongfu Xie, Zeming Hu, Xiaolong Shen, Kun Zhang |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Applied Sciences, Vol 13, Iss 7, p 4428 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2076-3417 |
| DOI: |
10.3390/app13074428 |
| Popis: |
Currently, many problems such as variable signal resources, complex execution environments, and low efficiency of scheduling algorithms are faced by heterogeneous signal processing platforms. The task scheduling algorithm is one of the key factors that directly affect the performance of the processing platform. In order to solve the problems of low efficiency of task scheduling algorithms and high computational cost of processors, a heterogeneous platform scheduling algorithm based on the quantum genetic algorithm is proposed in this paper. The algorithm constructs a task scheduling model by using a directed acyclic graph. This paper quantifies the mapping relationship between the quantum genetic algorithm and task scheduling. It corresponds qubits to binary, chromosomes to processor numbers, and individuals to processor scheduling strategies. In this paper, a new way of coding chromosomes using quantum coherence properties is designed to reduce the population size and increase population diversity. Crossover operations are performed on all individuals using full-interference crossover to avoid the results falling into local optimal solutions. The population of slow convergence is solved by implementing mutation operations on populations through quantum rotation gates. In addition, a task pre-ordering stage is designed based on the table scheduling algorithm. The task scheduling priority developed at this stage is used as the reference value for the initial encoding of the population, so that the search space for solutions is reduced. Finally, experiments are conducted using randomly generated task graphs. The algorithm is compared with improved genetic algorithms and existing intelligent scheduling algorithms. The results show that the algorithm can still obtain better results when the number of populations and iterations is small. It is more appropriate for heterogeneous platforms and computation-intensive tasks. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
