edf调度系统中的资源锁定持续时间

N. Fisher, M. Bertogna, Sanjoy Baruah
{"title":"edf调度系统中的资源锁定持续时间","authors":"N. Fisher, M. Bertogna, Sanjoy Baruah","doi":"10.1109/RTAS.2007.32","DOIUrl":null,"url":null,"abstract":"The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared \"open\" platform. The concept of resource hold time (RHT) - the largest length of time that may elapse between the instant that an application system locks a resource and the instant that it subsequently releases the resource - is formally defined and studied in this paper. An algorithm is presented for computing resource hold times for every resource in an application that is scheduled using earliest deadline first scheduling, with resource access arbitrated using the stack resource policy. An algorithm is presented for decreasing these RHT's without changing the semantics of the application or compromising application feasibility","PeriodicalId":222543,"journal":{"name":"13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Resource-Locking Durations in EDF-Scheduled Systems\",\"authors\":\"N. Fisher, M. Bertogna, Sanjoy Baruah\",\"doi\":\"10.1109/RTAS.2007.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared \\\"open\\\" platform. The concept of resource hold time (RHT) - the largest length of time that may elapse between the instant that an application system locks a resource and the instant that it subsequently releases the resource - is formally defined and studied in this paper. An algorithm is presented for computing resource hold times for every resource in an application that is scheduled using earliest deadline first scheduling, with resource access arbitrated using the stack resource policy. An algorithm is presented for decreasing these RHT's without changing the semantics of the application or compromising application feasibility\",\"PeriodicalId\":222543,\"journal\":{\"name\":\"13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTAS.2007.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTAS.2007.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

摘要

在共享的“开放”平台上组合多个独立开发的应用程序时,每个应用程序锁定每个共享资源的持续时间至关重要。本文正式定义并研究了资源保持时间(resource hold time, RHT)的概念,即应用程序系统从锁定资源到随后释放资源之间可能经过的最长时间。提出了一种计算应用程序中每个资源的资源保持时间的算法,该算法使用最早的截止日期优先调度调度,并使用堆栈资源策略仲裁资源访问。提出了在不改变应用程序语义或影响应用程序可行性的情况下减少这些RHT的算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource-Locking Durations in EDF-Scheduled Systems
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared "open" platform. The concept of resource hold time (RHT) - the largest length of time that may elapse between the instant that an application system locks a resource and the instant that it subsequently releases the resource - is formally defined and studied in this paper. An algorithm is presented for computing resource hold times for every resource in an application that is scheduled using earliest deadline first scheduling, with resource access arbitrated using the stack resource policy. An algorithm is presented for decreasing these RHT's without changing the semantics of the application or compromising application feasibility
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信