204 search results - page 2 / 41 » Scheduling Periodic Tasks in a Hard Real-Time Environment |
DELTA
2004
IEEE
13 years 11 months ago
2004
IEEE
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
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 2 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
RTAS
2007
IEEE
14 years 1 months ago
2007
IEEE
Multiprocessor platforms have been widely adopted in both embedded and server systems. In addition to the performance improvement, multiprocessor systems could have the flexibili...
IPPS
2003
IEEE
14 years 20 days ago
2003
IEEE
In this paper we present an adaptation of the Dual Priority Scheduling Algorithm to schedule both hard realtime periodic tasks and soft-aperiodic tasks in shared memory multiproce...