返回
Optimizing multiprocessor performance in real-time systems using an innovative genetic algorithm approach
DOI:10.1038/s41598-024-80910-4.png)
摘要
En 中文
Due to its enormous influence on system functionality, researchers are presently looking into the issue of task scheduling on multiprocessors. Establishing the most advantageous schedules is often regarded as a difficult-to-compute issue. Genetic Algorithm is a recent tool employed by researchers to optimize scheduling tasks and boost performance, although this field of research is yet mostly unexplored. In this article, a novel approach for generating task schedules for real-time systems utilizing a Genetic Algorithm is proposed. The approach seeks to design task schedules for multiprocessor systems with optimal or suboptimal lengths, with the ultimate goal of achieving high performance. This research project focuses on non-preemptive independent tasks in a multiprocessor environment. All processors are assumed to be identical. We conducted a thorough analysis of the proposed approach and pitted it against three frequently utilized scheduling methodologies: the Evolutionary Fuzzy Based Scheduling Algorithm, the Least Laxity First Algorithm, and the Earliest Deadline First Algorithm. The Proposed Algorithm demonstrated superior efficiency and reliability compared to Earliest Deadline First, Least Laxity First, and Evolutionary Fuzzy-based Scheduling Algorithm. It consistently achieved zero missed deadlines and the lowest average response and turnaround times across all scenarios, maintaining optimal performance even under high load conditions.
Keyword:
Multiprocessors
Task Scheduling
Genetic algorithms
Performance utilization
Multiprocessor
No-Preemptions
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
28.0W
被引数:
83.5W
机构
引用论文
Prone Positioning With Deep Inspiration Breath Hold for Left Breast Radiotherapy左侧乳腺癌放疗中的俯卧位结合深吸气末屏气技术

