在AUTOSAR/OSEK平台上使用本机非抢占组的可调度性

L. Hatvani, R. J. Bril
{"title":"在AUTOSAR/OSEK平台上使用本机非抢占组的可调度性","authors":"L. Hatvani, R. J. Bril","doi":"10.23919/DATE.2017.7926990","DOIUrl":null,"url":null,"abstract":"To combine the relative strengths of fully preemptive and non-preemptive fixed priority scheduling, we can use limited preemptive scheduling methods. One such method is fixed-priority threshold scheduling (FPTS). This approach defines dual priorities for every task, a priority assigned to the inactive jobs and an equal or a higher one, called preemption threshold, for the jobs that have already started executing. A task can preempt another task's job if and only if its priority is greater than the other task's preemption threshold. FPTS can be implemented by assigning tasks to non-preemptive groups in a one-to-many manner. That is groups of tasks that are mutually non-preemptive.","PeriodicalId":6862,"journal":{"name":"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)","volume":"8 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform\",\"authors\":\"L. Hatvani, R. J. Bril\",\"doi\":\"10.23919/DATE.2017.7926990\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To combine the relative strengths of fully preemptive and non-preemptive fixed priority scheduling, we can use limited preemptive scheduling methods. One such method is fixed-priority threshold scheduling (FPTS). This approach defines dual priorities for every task, a priority assigned to the inactive jobs and an equal or a higher one, called preemption threshold, for the jobs that have already started executing. A task can preempt another task's job if and only if its priority is greater than the other task's preemption threshold. FPTS can be implemented by assigning tasks to non-preemptive groups in a one-to-many manner. That is groups of tasks that are mutually non-preemptive.\",\"PeriodicalId\":6862,\"journal\":{\"name\":\"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)\",\"volume\":\"8 1\",\"pages\":\"1-8\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/DATE.2017.7926990\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/DATE.2017.7926990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

为了结合完全抢占和非抢占固定优先级调度的相对优势,我们可以使用有限抢占调度方法。其中一种方法是固定优先级阈值调度(FPTS)。这种方法为每个任务定义了双重优先级,一个优先级分配给不活动的作业,另一个同等或更高的优先级分配给已经开始执行的作业,称为抢占阈值。当且仅当一个任务的优先级大于另一个任务的抢占阈值时,该任务才能抢占另一个任务的任务。FPTS可以通过一对多的方式将任务分配给非抢占组来实现。这是一组相互之间没有优先权的任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform
To combine the relative strengths of fully preemptive and non-preemptive fixed priority scheduling, we can use limited preemptive scheduling methods. One such method is fixed-priority threshold scheduling (FPTS). This approach defines dual priorities for every task, a priority assigned to the inactive jobs and an equal or a higher one, called preemption threshold, for the jobs that have already started executing. A task can preempt another task's job if and only if its priority is greater than the other task's preemption threshold. FPTS can be implemented by assigning tasks to non-preemptive groups in a one-to-many manner. That is groups of tasks that are mutually non-preemptive.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信