edf调度系统中的资源共享:深入研究

Sanjoy Baruah
{"title":"edf调度系统中的资源共享:深入研究","authors":"Sanjoy Baruah","doi":"10.1109/RTSS.2006.41","DOIUrl":null,"url":null,"abstract":"Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The stack resource policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times","PeriodicalId":353932,"journal":{"name":"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"83","resultStr":"{\"title\":\"Resource Sharing in EDF-Scheduled Systems: A Closer Look\",\"authors\":\"Sanjoy Baruah\",\"doi\":\"10.1109/RTSS.2006.41\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The stack resource policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times\",\"PeriodicalId\":353932,\"journal\":{\"name\":\"2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"83\",\"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.41\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 83

摘要

基于优先级的系统中的资源共享可能导致优先级反转和阻塞,其中作业的执行会延迟,因为较低优先级的作业占用了执行所需的一些资源。堆栈资源策略(SRP)可用于减少edf调度系统中的这种阻塞。提出了一种算法的有效实现,用于确定以这种方式调度的系统是否可行。导出了这类系统的一些有趣的性质。探讨了通过复制选定资源来减少阻塞持续时间的技术:提出了一种算法,该算法确定了实现指定阻塞时间所需的最小资源复制量
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource Sharing in EDF-Scheduled Systems: A Closer Look
Resource sharing in priority-based systems can give rise to priority-inversion and blocking, wherein a job's execution is delayed because a lower-priority job holds some resource that is needed for execution. The stack resource policy (SRP) can be used to reduce such blocking in EDF-scheduled systems. An efficient implementation of an algorithm is presented for determining whether systems scheduled in this manner are feasible. Some interesting properties of such systems are derived. The technique of reducing the duration of blocking by the replication of selected resources is explored: an algorithm is presented which determines the minimum amount of resource replication necessary to achieve specified blocking times
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信