.png){kind=icon}
Return
Genetic-algorithm-based real-time task scheduling with multiple goals
.png){kind=icon}
PRE
AI
DOI：10.1016/S0164-1212(02)00147-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents and evaluates a new method for real-time task scheduling in multiprocessor systems. Its objectives are to minimize the number of processors required and the total tardiness of tasks. The minimization is carried out through a multiobjective genetic algorithm (GA), because the problem has non-commensurable and competing objectives to be optimized. The experimental results showed that when compared to five methods used previously, such as list-scheduling algorithms and a specific GA, the performance of our algorithm was comparable or better for 178 out of 180 randomly generated task graphs. Also shown is the impact of the sparsity of a task graph on the performance of-our algorithm. (C) 2002 Elsevier Inc. All rights reserved.
Keywords:
scheduling
real-time system
deadline
total tardiness
multiobjective genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.5K
Citations:
8.4K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveLSTF: A new scheduling policy for complex real-time tasks in multiple processor systems.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSave
View more