单处理器上零星任务的固定优先级可调度性是NP-Hard的

2017 IEEE Real-Time Systems Symposium (RTSS) Pub Date : 2017-12-01 DOI:10.1109/RTSS.2017.00020

Pontus Ekberg, W. Yi

{"title":"单处理器上零星任务的固定优先级可调度性是NP-Hard的","authors":"Pontus Ekberg, W. Yi","doi":"10.1109/RTSS.2017.00020","DOIUrl":null,"url":null,"abstract":"We study the computational complexity of the FP-schedulability problem for sporadic or synchronous periodic tasks on a preemptive uniprocessor. We show that this problem is (weakly) NP-hard, even when restricted to either (i) task sets with implicit deadlines and rate-monotonic priority ordering, or (ii) task sets with constrained deadlines, deadline-monotonic priority ordering and utilization bounded by any constant c, such that 0 c 1.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard\",\"authors\":\"Pontus Ekberg, W. Yi\",\"doi\":\"10.1109/RTSS.2017.00020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the computational complexity of the FP-schedulability problem for sporadic or synchronous periodic tasks on a preemptive uniprocessor. We show that this problem is (weakly) NP-hard, even when restricted to either (i) task sets with implicit deadlines and rate-monotonic priority ordering, or (ii) task sets with constrained deadlines, deadline-monotonic priority ordering and utilization bounded by any constant c, such that 0 c 1.\",\"PeriodicalId\":407932,\"journal\":{\"name\":\"2017 IEEE Real-Time Systems Symposium (RTSS)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE Real-Time Systems Symposium (RTSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTSS.2017.00020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Real-Time Systems Symposium (RTSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTSS.2017.00020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

研究了在抢占式单处理机上偶发或同步周期任务的fp -可调度性问题的计算复杂度。我们证明了这个问题是(弱)np困难的，即使被限制在(i)具有隐式截止日期和速率单调优先顺序的任务集，或(ii)具有约束截止日期，截止日期单调优先顺序和利用率由任意常数c限定的任务集，例如0 c 1。

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

查看原文本刊更多论文

Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard

We study the computational complexity of the FP-schedulability problem for sporadic or synchronous periodic tasks on a preemptive uniprocessor. We show that this problem is (weakly) NP-hard, even when restricted to either (i) task sets with implicit deadlines and rate-monotonic priority ordering, or (ii) task sets with constrained deadlines, deadline-monotonic priority ordering and utilization bounded by any constant c, such that 0 c 1.

求助全文

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

来源期刊

2017 IEEE Real-Time Systems Symposium (RTSS)

自引率

0.00%

发文量