130 search results - page 1 / 26 » Algorithms and Complexity for Periodic Real-Time Scheduling |
SODA
2010
ACM
14 years 1 months ago
2010
ACM
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 ...
RTSS
2005
IEEE
13 years 10 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
Energy consumption is a critical design issue in real-time systems, especially in battery- operated systems. Maintaining high performance, while extending the battery life between...
RTAS
2010
IEEE
13 years 2 months ago
2010
IEEE
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
RTSS
2003
IEEE
13 years 9 months ago
2003
IEEE
We address the problem of providing compositional hard real-time guarantees in a hierarchy of schedulers. We first propose a resource model to characterize a periodic resource al...