An Optimal Real-Time Scheduling Algorithm for Multiprocessors

Hyeonjoong Cho, B. Ravindran, E. Jensen
{"title":"An Optimal Real-Time Scheduling Algorithm for Multiprocessors","authors":"Hyeonjoong Cho, B. Ravindran, E. Jensen","doi":"10.1109/RTSS.2006.10","DOIUrl":null,"url":null,"abstract":"We present an optimal real-time scheduling algorithm for multiprocessors $one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed based on a novel abstraction for reasoning about task execution behavior on multiprocessors: the time and local execution time domain plane (or T-L plane). LLREF is based on the fluid scheduling model and the fairness notion, and uses the T-L plane to describe fluid schedules without using time quanta, unlike the optimal Pfair algorithm (which uses time quanta). We show that scheduling for multiprocessors can be viewed as repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in the optimal schedule. We analytically establish the optimality of LLREF. Further, we establish that the algorithm has bounded overhead, and this bound is independent of time quanta (unlike Pfair). Our simulation results validate our analysis on the algorithm overhead","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"273","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTSS.2006.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 273

Abstract

We present an optimal real-time scheduling algorithm for multiprocessors $one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed based on a novel abstraction for reasoning about task execution behavior on multiprocessors: the time and local execution time domain plane (or T-L plane). LLREF is based on the fluid scheduling model and the fairness notion, and uses the T-L plane to describe fluid schedules without using time quanta, unlike the optimal Pfair algorithm (which uses time quanta). We show that scheduling for multiprocessors can be viewed as repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in the optimal schedule. We analytically establish the optimality of LLREF. Further, we establish that the algorithm has bounded overhead, and this bound is independent of time quanta (unlike Pfair). Our simulation results validate our analysis on the algorithm overhead
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种多处理器实时调度优化算法
提出了一种满足所有任务期限的多处理器实时调度算法$ 1,当总利用率需求不超过处理器的利用率时。该算法称为LLREF,是基于一种新的抽象来设计的,用于对多处理器上的任务执行行为进行推理:时间和本地执行时域平面(或T-L平面)。LLREF基于流体调度模型和公平性概念,与最优的Pfair算法(使用时间量子)不同,它使用T-L平面来描述流体调度,而不使用时间量子。我们证明了多处理器的调度可以看作是重复发生的T-L平面,并且在单个T-L平面上进行调度是可行的,可以产生最优调度。我们分析地建立了LLREF的最优性。进一步,我们建立了该算法具有有限的开销,并且该界限与时间量子无关(与Pfair不同)。我们的仿真结果验证了我们对算法开销的分析
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks Mutual Consistency in Real-Time Databases A Pattern for Adaptive Behavior in Safety-Critical, Real-Time Middleware RTSAT-- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures A Generic Framework for Monitoring Timing Constraints over Uncertain Events
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1