Sciweavers

SODA
2010
ACM
219views Algorithms» more  SODA 2010»
14 years 1 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...