53 search results - page 4 / 11 » Time-Optimal Test Cases for Real-Time Systems |
ECRTS
2004
IEEE
13 years 11 months ago
2004
IEEE
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
SODA
2010
ACM
14 years 4 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 ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we study the partitioning approach for multiprocessor real-time scheduling. This approach seems to be the easiest since, once the partitioning of the task set has be...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we address the scheduling problem of multi-mode real-time systems upon uniform multiprocessor platforms. We propose two transition protocols, specified together wit...
PARELEC
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...