.png){kind=icon}
返回
An efficient dynamic scheduling algorithm for multiprocessor real-time systems
.png){kind=icon}
PRE
AI
DOI：10.1109/71.674322.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met. In this paper, we propose an efficient algorithm for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic tasks) in multiprocessor systems. A real-time task is characterized by its deadline, resource requirements, and worst case computation time on p processors, where p is the degree of parallelization of the task. We use this parallelism in tasks to meet their deadlines and, thus, obtain better schedulability compared to nonparallelizable task scheduling algorithms. To study the effectiveness of the proposed scheduling algorithm, we have conducted extensive simulation studies and compared its performance with the myopic [8] scheduling algorithm. The simulation studies show that the schedulability of the proposed algorithm is always higher than that of the myopic algorithm for a wide variety of task parameters.
Keyword:
multiprocessor
real-time systems
dynamic scheduling
parallelizable tasks
resource constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Recurrence of Subdural Haematoma in a Population-Based Cohort – Risks and Predictive Factors.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏Light speed reduction to 17 metres per second in an ultracold atomic gas在超冷原子气体中，光速降低到每秒17米Nature
NatureIF0
PREAI
分享收藏分享收藏
查看更多内容