Sciweavers

Share
RTSS
2015
IEEE

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

4 years 7 months ago
Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization
—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. It is known that this problem is strongly coNP-complete in the general case, but also that there exists a pseudo-polynomial time solution for instances with utilization bounded from above by any constant c,
Pontus Ekberg, Wang Yi 0001
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where RTSS
Authors Pontus Ekberg, Wang Yi 0001
Comments (0)
books