具有任务级和系统级时效性保证的随机、效用应计实时调度

Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05) Pub Date : 2005-05-18 DOI:10.1109/ISORC.2005.52

Peng Li, Hyeonjoong Cho, B. Ravindran, E. Jensen

{"title":"具有任务级和系统级时效性保证的随机、效用应计实时调度","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":"{\"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}","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

摘要

启发式算法在效用应计(UA)调度中获得了越来越多的关注和成功。然而，很少有分析结果，例如任务级和系统级累积实用程序的界限是已知的。在本文中，我们提出了S-UA算法，该算法可以提供任务级累积效用的概率界限。系统级应计效用比(AUR)的下限也通过S-UA得到并最大化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)

自引率

0.00%

发文量