.png){kind=icon}
返回
Harmonic-Aware Multi-Core Scheduling for Fixed-Priority Real-Time Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2013.71.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new semipartitioned approach to schedule sporadic tasks on multicore platforms based on the Rate Monotonic Scheduling policy. To improve the schedulability, our approach exploits the fact that the utilization bound of a task set increases as task periods become closer to harmonic on single processor platforms. The challenge for our approach, however, is how to take advantage of this fact to assign and split appropriate tasks on different processors in the semipartitioned approach, and how to guarantee the schedulability of real-time tasks. We formally prove that our scheduling approach can successfully schedule any task set with a system utilization bounded by Liu&Layland's bound for N tasks, that is, N(2(1/N) - 1). Our extensive experimental results demonstrate that the proposed algorithm can significantly improve the scheduling performance compared with the previous work.
Keyword:
Harmonic
real-time semipartitioned scheduling
fixed-priority
rate monotonic scheduling (RMS)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Current and future use of nucleo(s)tide prodrugs in the treatment of hepatitis C virus infection
OAAI
OAAI分享收藏REAL-TIME COMPUTING - A NEW DISCIPLINE OF COMPUTER-SCIENCE AND ENGINEERING.png)
PROCEEDINGS OF THE IEEE
OAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏
查看更多内容