分级调度框架下基于溢出无回报的同步协议紧密可调度性分析

2011 16th IEEE International Conference on Engineering of Complex Computer Systems Pub Date : 2011-04-27 DOI:10.1109/ICECCS.2011.11

M. Behnam, Thomas Nolte, R. J. Bril

{"title":"分级调度框架下基于溢出无回报的同步协议紧密可调度性分析","authors":"M. Behnam, Thomas Nolte, R. J. Bril","doi":"10.1109/ICECCS.2011.11","DOIUrl":null,"url":null,"abstract":"In this paper, we show that both global as well as local schedulability analysis of synchronization protocols based on the stack resource policy (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority preemptive scheduling (FPPS) are pessimistic. We present tighter global and local schedulability analysis, illustrate the improvements of the new analysis by means of examples, and show that the improved global analysis is both uniform and sustainable. We evaluate the new global and local schedulability analysis based on an extensive simulation study and compare the results with the existing analysis.","PeriodicalId":298193,"journal":{"name":"2011 16th IEEE International Conference on Engineering of Complex Computer Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Tighter Schedulability Analysis of Synchronization Protocols Based on Overrun without Payback for Hierarchical Scheduling Frameworks\",\"authors\":\"M. Behnam, Thomas Nolte, R. J. Bril\",\"doi\":\"10.1109/ICECCS.2011.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we show that both global as well as local schedulability analysis of synchronization protocols based on the stack resource policy (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority preemptive scheduling (FPPS) are pessimistic. We present tighter global and local schedulability analysis, illustrate the improvements of the new analysis by means of examples, and show that the improved global analysis is both uniform and sustainable. We evaluate the new global and local schedulability analysis based on an extensive simulation study and compare the results with the existing analysis.\",\"PeriodicalId\":298193,\"journal\":{\"name\":\"2011 16th IEEE International Conference on Engineering of Complex Computer Systems\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 16th IEEE International Conference on Engineering of Complex Computer Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECCS.2011.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 16th IEEE International Conference on Engineering of Complex Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCS.2011.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

本文证明了基于堆栈资源策略(SRP)的同步协议的全局可调度性分析和基于固定优先级抢占调度(FPPS)的分层调度框架的无回报溢出可调度性分析是悲观的。给出了更严格的全局可调度性和局部可调度性分析，并用实例说明了改进后的全局可调度性分析的一致性和可持续性。基于广泛的仿真研究，我们评估了新的全局和局部可调度性分析，并将结果与现有的分析结果进行了比较。

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

查看原文本刊更多论文

Tighter Schedulability Analysis of Synchronization Protocols Based on Overrun without Payback for Hierarchical Scheduling Frameworks

In this paper, we show that both global as well as local schedulability analysis of synchronization protocols based on the stack resource policy (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority preemptive scheduling (FPPS) are pessimistic. We present tighter global and local schedulability analysis, illustrate the improvements of the new analysis by means of examples, and show that the improved global analysis is both uniform and sustainable. We evaluate the new global and local schedulability analysis based on an extensive simulation study and compare the results with the existing analysis.

求助全文

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

来源期刊

2011 16th IEEE International Conference on Engineering of Complex Computer Systems

自引率

0.00%

发文量