Stochastic, utility accrual real-time scheduling with task-level and system-level timeliness assurances

Peng Li, Hyeonjoong Cho, B. Ravindran, E. Jensen
{"title":"Stochastic, utility accrual real-time scheduling with task-level and system-level timeliness assurances","authors":"Peng Li, Hyeonjoong Cho, B. Ravindran, E. Jensen","doi":"10.1109/ISORC.2005.52","DOIUrl":null,"url":null,"abstract":"Heuristic algorithms have enjoyed increasing interests and success in the context of utility accrual (UA) scheduling. However, few analytical results, such as bounds on task-level and system-level accrued utilities are known. In this paper, we propose the S-UA algorithm that can provide probabilistic bounds on task-level accrued utilities. Lower bound on system-level accrued utility ratio (AUR) is also derived and maximized by S-UA.","PeriodicalId":377002,"journal":{"name":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2005.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Heuristic algorithms have enjoyed increasing interests and success in the context of utility accrual (UA) scheduling. However, few analytical results, such as bounds on task-level and system-level accrued utilities are known. In this paper, we propose the S-UA algorithm that can provide probabilistic bounds on task-level accrued utilities. Lower bound on system-level accrued utility ratio (AUR) is also derived and maximized by S-UA.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有任务级和系统级时效性保证的随机、效用应计实时调度
启发式算法在效用应计(UA)调度中获得了越来越多的关注和成功。然而,很少有分析结果,例如任务级和系统级累积实用程序的界限是已知的。在本文中,我们提出了S-UA算法,该算法可以提供任务级累积效用的概率界限。系统级应计效用比(AUR)的下限也通过S-UA得到并最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dependable real-time data mining TMO-eCos: an eCos-based real-time micro operating system supporting execution of a TMO structured program Multipath disjoint routing algorithm for ad hoc wireless sensor networks Self-tuning planned actions time to make real-time SOAP real Placement solutions for multiple versions of a multimedia object
×
引用
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