登录 注册 会员服务 联系我们

Feasibility problems for recurring tasks on one processor

  • Published:1993-09 Issue:1 Volume:118 Page:3-20
  • ISSN:0304-3975
  • Container-title:Theoretical Computer Science
  • language:en
  • Short-container-title:Theoretical Computer Science

Author:

Baruah Sanjoy K.,Howell Rodney R.,Rosier Louis E.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference19 articles.

1. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor;Baruah;Real-Time System,1990

2. Preemptively scheduling hard-real-time sporadic tasks on one processor;Baruah,1990

3. The complexity of theorem-proving procedures;Cook,1971

4. Control robotics: the procedural control of physical processors;Dertouzos,1974

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;garey,1979

Cited by 47 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Rethinking Tractability for Schedulability Analysis;2023 IEEE Real-Time Systems Symposium (RTSS);2023-12-05

2. On-demand Edge Inference Scheduling with Accuracy and Deadline Guarantee;2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS);2023-06-19

3. Efficient schedulability analysis of hierarchical EDF scheduling with resource sharing;Journal of Systems Architecture;2023-02

4. Schedulability analysis of dynamic priority real-time systems with contention;The Journal of Supercomputing;2022-04-08

5. Efficient Schedulability Analysis of Hierarchical Real-Time Scheduling with Resource Sharing;SSRN Electronic Journal;2022
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3