跳到主要导航 跳到搜索 跳到主要内容

Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization

  • Uppsala University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

A central problem in real-time scheduling theory is to decide whether a sporadic task system with constrained deadlines is feasible on a preemptive uniprocessor.

源语言英语
主期刊名Proceedings - 2015 IEEE 36th Real-Time Systems Symposium, RTSS 2015
出版商Institute of Electrical and Electronics Engineers Inc.
87-95
页数9
ISBN(电子版)9781467395076
DOI
出版状态已出版 - 14 1月 2016
已对外发布
活动36th IEEE Real-Time Systems Symposium, RTSS 2015 - San Antonio, 美国
期限: 1 12月 20154 12月 2015

出版系列

姓名Proceedings - Real-Time Systems Symposium
2016-January
ISSN(印刷版)1052-8725

会议

会议36th IEEE Real-Time Systems Symposium, RTSS 2015
国家/地区美国
San Antonio
时期1/12/154/12/15

指纹

探究 'Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization' 的科研主题。它们共同构成独一无二的指纹。

引用此